./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8 --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:44:59,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:44:59,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:44:59,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:44:59,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:44:59,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:44:59,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:44:59,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:44:59,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:44:59,947 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:44:59,948 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:44:59,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:44:59,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:44:59,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:44:59,952 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:44:59,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:44:59,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:44:59,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:44:59,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:44:59,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:44:59,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:44:59,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:44:59,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:44:59,978 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:44:59,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:44:59,986 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:44:59,986 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:44:59,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:44:59,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:44:59,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:44:59,995 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:44:59,996 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:44:59,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:44:59,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:45:00,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:45:00,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:45:00,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:45:00,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:45:00,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:45:00,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:45:00,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:45:00,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-13 07:45:00,054 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:45:00,054 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:45:00,055 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:45:00,056 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:45:00,056 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:45:00,056 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:45:00,056 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:45:00,056 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:45:00,057 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:45:00,057 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:45:00,058 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:45:00,058 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:45:00,058 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:45:00,058 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:45:00,059 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:45:00,059 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:45:00,059 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:45:00,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:45:00,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:45:00,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:45:00,060 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:45:00,060 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:45:00,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:45:00,061 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:45:00,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:45:00,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:45:00,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:45:00,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:45:00,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:45:00,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:45:00,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:00,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:45:00,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:45:00,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:45:00,086 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:45:00,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:45:00,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:45:00,087 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:45:00,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:45:00,088 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/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_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2021-10-13 07:45:00,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:45:00,392 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:45:00,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:45:00,396 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:45:00,396 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:45:00,397 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-13 07:45:00,462 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/eac910606/475625cb049a47bda6e51c80790edb3b/FLAGc21e54259 [2021-10-13 07:45:00,905 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:45:00,906 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-13 07:45:00,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/eac910606/475625cb049a47bda6e51c80790edb3b/FLAGc21e54259 [2021-10-13 07:45:01,312 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/eac910606/475625cb049a47bda6e51c80790edb3b [2021-10-13 07:45:01,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:45:01,316 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:45:01,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:01,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:45:01,323 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:45:01,324 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6b3e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01, skipping insertion in model container [2021-10-13 07:45:01,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,335 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:45:01,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:45:01,508 WARN L228 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_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-13 07:45:01,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:01,558 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:45:01,571 WARN L228 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_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-13 07:45:01,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:01,609 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:45:01,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01 WrapperNode [2021-10-13 07:45:01,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:01,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:01,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:45:01,611 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:45:01,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:01,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:45:01,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:45:01,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:45:01,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,717 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:45:01,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:45:01,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:45:01,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:45:01,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (1/1) ... [2021-10-13 07:45:01,733 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:01,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:01,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:45:01,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:45:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:45:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:45:01,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:45:01,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:45:02,525 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:45:02,526 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-10-13 07:45:02,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:02 BoogieIcfgContainer [2021-10-13 07:45:02,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:45:02,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:45:02,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:45:02,554 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:45:02,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:01" (1/3) ... [2021-10-13 07:45:02,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49e99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:02, skipping insertion in model container [2021-10-13 07:45:02,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:01" (2/3) ... [2021-10-13 07:45:02,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b49e99f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:02, skipping insertion in model container [2021-10-13 07:45:02,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:02" (3/3) ... [2021-10-13 07:45:02,558 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-10-13 07:45:02,571 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:45:02,571 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 07:45:02,647 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:45:02,654 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:45:02,654 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 07:45:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 43 states have internal predecessors, (69), 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) [2021-10-13 07:45:02,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-13 07:45:02,682 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:02,683 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:02,683 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:02,689 INFO L82 PathProgramCache]: Analyzing trace with hash 992082448, now seen corresponding path program 1 times [2021-10-13 07:45:02,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:02,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527731368] [2021-10-13 07:45:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:02,719 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:02,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:02,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:02,966 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527731368] [2021-10-13 07:45:02,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527731368] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:02,968 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:02,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:45:02,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130433560] [2021-10-13 07:45:02,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:02,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:02,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:02,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:02,997 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.6829268292682926) internal successors, (69), 43 states have internal predecessors, (69), 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 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2021-10-13 07:45:03,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,087 INFO L93 Difference]: Finished difference Result 116 states and 182 transitions. [2021-10-13 07:45:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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 18 [2021-10-13 07:45:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,103 INFO L225 Difference]: With dead ends: 116 [2021-10-13 07:45:03,104 INFO L226 Difference]: Without dead ends: 69 [2021-10-13 07:45:03,108 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-13 07:45:03,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2021-10-13 07:45:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 64 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) [2021-10-13 07:45:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2021-10-13 07:45:03,168 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 18 [2021-10-13 07:45:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,168 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2021-10-13 07:45:03,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 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) [2021-10-13 07:45:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2021-10-13 07:45:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 07:45:03,171 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,172 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:03,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:45:03,173 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,176 INFO L82 PathProgramCache]: Analyzing trace with hash -504803389, now seen corresponding path program 1 times [2021-10-13 07:45:03,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,177 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724975403] [2021-10-13 07:45:03,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,177 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:03,231 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724975403] [2021-10-13 07:45:03,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724975403] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:45:03,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717936321] [2021-10-13 07:45:03,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:03,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:03,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,235 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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) [2021-10-13 07:45:03,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,275 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2021-10-13 07:45:03,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2021-10-13 07:45:03,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,278 INFO L225 Difference]: With dead ends: 188 [2021-10-13 07:45:03,278 INFO L226 Difference]: Without dead ends: 124 [2021-10-13 07:45:03,280 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-10-13 07:45:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2021-10-13 07:45:03,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 119 states have internal predecessors, (174), 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) [2021-10-13 07:45:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2021-10-13 07:45:03,295 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 19 [2021-10-13 07:45:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,296 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2021-10-13 07:45:03,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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) [2021-10-13 07:45:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2021-10-13 07:45:03,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-13 07:45:03,298 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,298 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:03,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:45:03,299 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1973994324, now seen corresponding path program 1 times [2021-10-13 07:45:03,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,300 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989595667] [2021-10-13 07:45:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,301 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:03,347 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,347 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989595667] [2021-10-13 07:45:03,348 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989595667] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,348 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,348 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:45:03,348 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460024229] [2021-10-13 07:45:03,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:03,349 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:03,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,350 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2021-10-13 07:45:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,394 INFO L93 Difference]: Finished difference Result 290 states and 424 transitions. [2021-10-13 07:45:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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 20 [2021-10-13 07:45:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,405 INFO L225 Difference]: With dead ends: 290 [2021-10-13 07:45:03,405 INFO L226 Difference]: Without dead ends: 171 [2021-10-13 07:45:03,406 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-10-13 07:45:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2021-10-13 07:45:03,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 153 states have (on average 1.4705882352941178) internal successors, (225), 154 states have internal predecessors, (225), 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) [2021-10-13 07:45:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2021-10-13 07:45:03,428 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 20 [2021-10-13 07:45:03,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,429 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2021-10-13 07:45:03,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 2 states have internal predecessors, (20), 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) [2021-10-13 07:45:03,429 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2021-10-13 07:45:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-10-13 07:45:03,436 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,436 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:03,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:45:03,438 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,439 INFO L82 PathProgramCache]: Analyzing trace with hash 723101864, now seen corresponding path program 1 times [2021-10-13 07:45:03,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,439 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869632297] [2021-10-13 07:45:03,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:03,560 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869632297] [2021-10-13 07:45:03,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869632297] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:45:03,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758463602] [2021-10-13 07:45:03,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:03,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:03,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,563 INFO L87 Difference]: Start difference. First operand 155 states and 225 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-10-13 07:45:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,607 INFO L93 Difference]: Finished difference Result 267 states and 386 transitions. [2021-10-13 07:45:03,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2021-10-13 07:45:03,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,610 INFO L225 Difference]: With dead ends: 267 [2021-10-13 07:45:03,610 INFO L226 Difference]: Without dead ends: 158 [2021-10-13 07:45:03,611 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2021-10-13 07:45:03,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 149. [2021-10-13 07:45:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.435374149659864) internal successors, (211), 148 states have internal predecessors, (211), 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) [2021-10-13 07:45:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2021-10-13 07:45:03,629 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 28 [2021-10-13 07:45:03,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,629 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2021-10-13 07:45:03,630 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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) [2021-10-13 07:45:03,630 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2021-10-13 07:45:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-10-13 07:45:03,631 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,632 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:03,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:45:03,632 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,633 INFO L82 PathProgramCache]: Analyzing trace with hash 89688681, now seen corresponding path program 1 times [2021-10-13 07:45:03,633 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,633 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654924576] [2021-10-13 07:45:03,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,634 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:03,679 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,679 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654924576] [2021-10-13 07:45:03,679 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654924576] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,680 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:45:03,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896170591] [2021-10-13 07:45:03,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:03,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:03,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,682 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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) [2021-10-13 07:45:03,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,704 INFO L93 Difference]: Finished difference Result 317 states and 444 transitions. [2021-10-13 07:45:03,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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 31 [2021-10-13 07:45:03,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,706 INFO L225 Difference]: With dead ends: 317 [2021-10-13 07:45:03,706 INFO L226 Difference]: Without dead ends: 180 [2021-10-13 07:45:03,707 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-10-13 07:45:03,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-10-13 07:45:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.3820224719101124) internal successors, (246), 179 states have internal predecessors, (246), 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) [2021-10-13 07:45:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 246 transitions. [2021-10-13 07:45:03,724 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 246 transitions. Word has length 31 [2021-10-13 07:45:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,725 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 246 transitions. [2021-10-13 07:45:03,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 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) [2021-10-13 07:45:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 246 transitions. [2021-10-13 07:45:03,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 07:45:03,727 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,727 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:45:03,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:45:03,728 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1251489132, now seen corresponding path program 1 times [2021-10-13 07:45:03,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251331294] [2021-10-13 07:45:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:45:03,801 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,802 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251331294] [2021-10-13 07:45:03,802 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251331294] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,802 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:45:03,803 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009832259] [2021-10-13 07:45:03,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:03,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,811 INFO L87 Difference]: Start difference. First operand 180 states and 246 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-10-13 07:45:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:03,846 INFO L93 Difference]: Finished difference Result 333 states and 459 transitions. [2021-10-13 07:45:03,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:03,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2021-10-13 07:45:03,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:03,852 INFO L225 Difference]: With dead ends: 333 [2021-10-13 07:45:03,852 INFO L226 Difference]: Without dead ends: 178 [2021-10-13 07:45:03,854 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2021-10-13 07:45:03,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2021-10-13 07:45:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.3218390804597702) internal successors, (230), 175 states have internal predecessors, (230), 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) [2021-10-13 07:45:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 230 transitions. [2021-10-13 07:45:03,872 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 230 transitions. Word has length 32 [2021-10-13 07:45:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:03,873 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 230 transitions. [2021-10-13 07:45:03,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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) [2021-10-13 07:45:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 230 transitions. [2021-10-13 07:45:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-10-13 07:45:03,881 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:03,882 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:45:03,882 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:45:03,882 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:03,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:03,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1596314379, now seen corresponding path program 1 times [2021-10-13 07:45:03,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:03,887 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563082585] [2021-10-13 07:45:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:03,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:03,975 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:03,976 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563082585] [2021-10-13 07:45:03,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563082585] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:03,976 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:03,977 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:45:03,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121947285] [2021-10-13 07:45:03,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:03,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:45:03,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:03,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:03,979 INFO L87 Difference]: Start difference. First operand 176 states and 230 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2021-10-13 07:45:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:04,005 INFO L93 Difference]: Finished difference Result 196 states and 254 transitions. [2021-10-13 07:45:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:04,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2021-10-13 07:45:04,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:04,008 INFO L225 Difference]: With dead ends: 196 [2021-10-13 07:45:04,008 INFO L226 Difference]: Without dead ends: 194 [2021-10-13 07:45:04,008 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:45:04,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-10-13 07:45:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 174. [2021-10-13 07:45:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 173 states have internal predecessors, (227), 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) [2021-10-13 07:45:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2021-10-13 07:45:04,028 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 32 [2021-10-13 07:45:04,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:04,030 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2021-10-13 07:45:04,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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) [2021-10-13 07:45:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2021-10-13 07:45:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-10-13 07:45:04,038 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:04,039 INFO L512 BasicCegarLoop]: trace histogram [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] [2021-10-13 07:45:04,039 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:45:04,041 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:04,041 INFO L82 PathProgramCache]: Analyzing trace with hash 2053850234, now seen corresponding path program 1 times [2021-10-13 07:45:04,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:45:04,042 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101523568] [2021-10-13 07:45:04,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:04,042 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:45:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:04,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:45:04,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101523568] [2021-10-13 07:45:04,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101523568] provided 0 perfect and 1 imperfect interpolant sequences [2021-10-13 07:45:04,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273270621] [2021-10-13 07:45:04,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:04,194 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:04,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:04,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:04,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-10-13 07:45:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:04,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-13 07:45:04,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:04,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:05,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273270621] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:05,025 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1665768242] [2021-10-13 07:45:05,048 INFO L159 IcfgInterpreter]: Started Sifa with 32 locations of interest [2021-10-13 07:45:05,048 INFO L166 IcfgInterpreter]: Building call graph [2021-10-13 07:45:05,054 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-13 07:45:05,061 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-13 07:45:05,061 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-13 07:45:05,134 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,140 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:05,141 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,141 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 49 [2021-10-13 07:45:05,142 WARN L197 QuantifierPusher]: Ignoring assumption. [2021-10-13 07:45:05,143 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,143 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-10-13 07:45:05,171 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 193 [2021-10-13 07:45:05,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:05,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:05,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-13 07:45:05,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2021-10-13 07:45:05,220 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,221 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:05,222 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,223 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-10-13 07:45:05,223 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-13 07:45:05,225 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:05,239 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,242 INFO L180 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-10-13 07:45:05,246 INFO L185 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 167 [2021-10-13 07:45:05,247 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-10-13 07:45:05,247 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:164, output treesize:167 [2021-10-13 07:45:05,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:05,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:05,463 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: No corresponding IProgramVar for |v_#valid_22| at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.constructTermVarsProc(BasicPredicateFactory.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:81) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.predicate(SymbolicTools.java:174) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:608) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:53) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:392) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-13 07:45:05,466 INFO L168 Benchmark]: Toolchain (without parser) took 4150.08 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 69.3 MB in the beginning and 82.5 MB in the end (delta: -13.2 MB). Peak memory consumption was 60.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,467 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 90.2 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:45:05,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.87 ms. Allocated memory is still 90.2 MB. Free memory was 69.3 MB in the beginning and 65.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.04 ms. Allocated memory is still 90.2 MB. Free memory was 65.0 MB in the beginning and 62.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,468 INFO L168 Benchmark]: Boogie Preprocessor took 45.38 ms. Allocated memory is still 90.2 MB. Free memory was 62.7 MB in the beginning and 61.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,469 INFO L168 Benchmark]: RCFGBuilder took 804.73 ms. Allocated memory is still 90.2 MB. Free memory was 61.2 MB in the beginning and 35.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,469 INFO L168 Benchmark]: TraceAbstraction took 2921.73 ms. Allocated memory is still 117.4 MB. Free memory was 94.2 MB in the beginning and 82.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:05,472 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.21 ms. Allocated memory is still 90.2 MB. Free memory is still 65.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 292.87 ms. Allocated memory is still 90.2 MB. Free memory was 69.3 MB in the beginning and 65.0 MB in the end (delta: 4.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.04 ms. Allocated memory is still 90.2 MB. Free memory was 65.0 MB in the beginning and 62.7 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.38 ms. Allocated memory is still 90.2 MB. Free memory was 62.7 MB in the beginning and 61.2 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 804.73 ms. Allocated memory is still 90.2 MB. Free memory was 61.2 MB in the beginning and 35.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2921.73 ms. Allocated memory is still 117.4 MB. Free memory was 94.2 MB in the beginning and 82.5 MB in the end (delta: 11.7 MB). Peak memory consumption was 57.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: No corresponding IProgramVar for |v_#valid_22| de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: No corresponding IProgramVar for |v_#valid_22|: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermVarsProc.computeTermVarsProc(TermVarsProc.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-10-13 07:45:05,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:45:08,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:45:08,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:45:08,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:45:08,125 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:45:08,126 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:45:08,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:45:08,131 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:45:08,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:45:08,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:45:08,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:45:08,136 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:45:08,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:45:08,138 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:45:08,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:45:08,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:45:08,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:45:08,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:45:08,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:45:08,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:45:08,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:45:08,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:45:08,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:45:08,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:45:08,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:45:08,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:45:08,172 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:45:08,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:45:08,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:45:08,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:45:08,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:45:08,183 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:45:08,184 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:45:08,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:45:08,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:45:08,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:45:08,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:45:08,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:45:08,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:45:08,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:45:08,192 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:45:08,193 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-13 07:45:08,247 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:45:08,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:45:08,248 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:45:08,248 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:45:08,248 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:45:08,249 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:45:08,249 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:45:08,249 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:45:08,249 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:45:08,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:45:08,250 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:45:08,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:45:08,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:45:08,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-13 07:45:08,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:45:08,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-13 07:45:08,252 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:45:08,252 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-13 07:45:08,252 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-13 07:45:08,252 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:45:08,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-13 07:45:08,253 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:45:08,253 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-13 07:45:08,253 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:45:08,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-13 07:45:08,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:45:08,254 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:08,254 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:45:08,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:45:08,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-13 07:45:08,255 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-13 07:45:08,255 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:08,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-13 07:45:08,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:45:08,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:45:08,256 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/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_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8 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 -> Taipan 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 -> a436e4bf9da4ee1e6356d8c8c6b3cd5e98b60423 [2021-10-13 07:45:08,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:45:08,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:45:08,731 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:45:08,733 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:45:08,734 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:45:08,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-13 07:45:08,798 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/15ca8e2ac/270a3a048a674c619a01fca7c796167c/FLAG57d9bfbc3 [2021-10-13 07:45:09,282 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:45:09,282 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2021-10-13 07:45:09,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/15ca8e2ac/270a3a048a674c619a01fca7c796167c/FLAG57d9bfbc3 [2021-10-13 07:45:09,653 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/data/15ca8e2ac/270a3a048a674c619a01fca7c796167c [2021-10-13 07:45:09,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:45:09,665 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:45:09,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:09,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:45:09,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:45:09,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:09" (1/1) ... [2021-10-13 07:45:09,674 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@258522c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:09, skipping insertion in model container [2021-10-13 07:45:09,674 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:45:09" (1/1) ... [2021-10-13 07:45:09,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:45:09,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:45:09,899 WARN L228 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_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-13 07:45:09,975 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:09,990 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:45:10,034 WARN L228 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_db647122-01a4-492f-94ca-c199ea6cbc6a/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[337,350] [2021-10-13 07:45:10,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:45:10,082 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:45:10,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10 WrapperNode [2021-10-13 07:45:10,082 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:45:10,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:10,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:45:10,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:45:10,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,099 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:45:10,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:45:10,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:45:10,128 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:45:10,137 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,137 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,168 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:45:10,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:45:10,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:45:10,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:45:10,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (1/1) ... [2021-10-13 07:45:10,224 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:45:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:10,251 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:45:10,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:45:10,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-13 07:45:10,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:45:10,298 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:45:10,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:45:10,767 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:45:10,768 INFO L299 CfgBuilder]: Removed 42 assume(true) statements. [2021-10-13 07:45:10,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:10 BoogieIcfgContainer [2021-10-13 07:45:10,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:45:10,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:45:10,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:45:10,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:45:10,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:45:09" (1/3) ... [2021-10-13 07:45:10,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313fe84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:10, skipping insertion in model container [2021-10-13 07:45:10,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:45:10" (2/3) ... [2021-10-13 07:45:10,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@313fe84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:45:10, skipping insertion in model container [2021-10-13 07:45:10,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:10" (3/3) ... [2021-10-13 07:45:10,778 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2021-10-13 07:45:10,783 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:45:10,783 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-13 07:45:10,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:45:10,843 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:45:10,843 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-13 07:45:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 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) [2021-10-13 07:45:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-10-13 07:45:10,879 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:10,880 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:10,880 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:10,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:10,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1325512836, now seen corresponding path program 1 times [2021-10-13 07:45:10,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:10,900 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483068831] [2021-10-13 07:45:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:10,901 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:10,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:10,905 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:10,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-13 07:45:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:11,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:11,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:11,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:11,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:11,487 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:11,487 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483068831] [2021-10-13 07:45:11,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483068831] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:11,488 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:11,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:11,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757755878] [2021-10-13 07:45:11,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:11,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:11,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:11,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:11,524 INFO L87 Difference]: Start difference. First operand has 76 states, 73 states have (on average 1.5890410958904109) internal successors, (116), 75 states have internal predecessors, (116), 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 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2021-10-13 07:45:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:11,676 INFO L93 Difference]: Finished difference Result 214 states and 326 transitions. [2021-10-13 07:45:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 34 [2021-10-13 07:45:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:11,696 INFO L225 Difference]: With dead ends: 214 [2021-10-13 07:45:11,697 INFO L226 Difference]: Without dead ends: 135 [2021-10-13 07:45:11,700 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:11,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2021-10-13 07:45:11,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 114. [2021-10-13 07:45:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 112 states have (on average 1.4285714285714286) internal successors, (160), 113 states have internal predecessors, (160), 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) [2021-10-13 07:45:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2021-10-13 07:45:11,794 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 34 [2021-10-13 07:45:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:11,795 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2021-10-13 07:45:11,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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) [2021-10-13 07:45:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2021-10-13 07:45:11,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 07:45:11,802 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:11,802 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:11,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:12,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:12,016 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash 317140105, now seen corresponding path program 1 times [2021-10-13 07:45:12,018 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:12,018 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197101315] [2021-10-13 07:45:12,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:12,019 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:12,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:12,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-13 07:45:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:12,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:12,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:12,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:12,415 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:12,415 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197101315] [2021-10-13 07:45:12,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197101315] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:12,417 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:12,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090990752] [2021-10-13 07:45:12,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:12,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:12,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:12,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:12,421 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-10-13 07:45:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:12,502 INFO L93 Difference]: Finished difference Result 323 states and 450 transitions. [2021-10-13 07:45:12,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:12,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-10-13 07:45:12,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:12,509 INFO L225 Difference]: With dead ends: 323 [2021-10-13 07:45:12,510 INFO L226 Difference]: Without dead ends: 215 [2021-10-13 07:45:12,514 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-10-13 07:45:12,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2021-10-13 07:45:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 209 states have (on average 1.3971291866028708) internal successors, (292), 210 states have internal predecessors, (292), 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) [2021-10-13 07:45:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 292 transitions. [2021-10-13 07:45:12,541 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 292 transitions. Word has length 35 [2021-10-13 07:45:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:12,541 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 292 transitions. [2021-10-13 07:45:12,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-10-13 07:45:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 292 transitions. [2021-10-13 07:45:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-10-13 07:45:12,545 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:12,545 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:12,562 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:12,758 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:12,758 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:12,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:12,759 INFO L82 PathProgramCache]: Analyzing trace with hash -658420813, now seen corresponding path program 1 times [2021-10-13 07:45:12,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:12,760 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273614430] [2021-10-13 07:45:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:12,761 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:12,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:12,762 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:12,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-13 07:45:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:12,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:12,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:12,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:13,093 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:13,094 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273614430] [2021-10-13 07:45:13,094 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273614430] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:13,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:13,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:13,095 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403234800] [2021-10-13 07:45:13,095 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:13,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:13,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:13,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:13,100 INFO L87 Difference]: Start difference. First operand 211 states and 292 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-10-13 07:45:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:13,153 INFO L93 Difference]: Finished difference Result 526 states and 727 transitions. [2021-10-13 07:45:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 35 [2021-10-13 07:45:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:13,157 INFO L225 Difference]: With dead ends: 526 [2021-10-13 07:45:13,157 INFO L226 Difference]: Without dead ends: 321 [2021-10-13 07:45:13,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:13,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-13 07:45:13,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 297. [2021-10-13 07:45:13,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 295 states have (on average 1.383050847457627) internal successors, (408), 296 states have internal predecessors, (408), 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) [2021-10-13 07:45:13,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 408 transitions. [2021-10-13 07:45:13,210 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 408 transitions. Word has length 35 [2021-10-13 07:45:13,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:13,211 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 408 transitions. [2021-10-13 07:45:13,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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) [2021-10-13 07:45:13,213 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 408 transitions. [2021-10-13 07:45:13,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-13 07:45:13,224 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:13,225 INFO L512 BasicCegarLoop]: 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] [2021-10-13 07:45:13,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:13,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:13,443 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1720921163, now seen corresponding path program 1 times [2021-10-13 07:45:13,444 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:13,444 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930825585] [2021-10-13 07:45:13,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:13,445 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:13,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:13,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:13,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-13 07:45:13,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:13,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:13,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:13,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:13,864 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:13,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930825585] [2021-10-13 07:45:13,866 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930825585] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:13,866 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:13,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:13,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568690721] [2021-10-13 07:45:13,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:13,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:13,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:13,870 INFO L87 Difference]: Start difference. First operand 297 states and 408 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-10-13 07:45:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:13,957 INFO L93 Difference]: Finished difference Result 912 states and 1235 transitions. [2021-10-13 07:45:13,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:13,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 48 [2021-10-13 07:45:13,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:13,962 INFO L225 Difference]: With dead ends: 912 [2021-10-13 07:45:13,962 INFO L226 Difference]: Without dead ends: 621 [2021-10-13 07:45:13,963 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:13,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-10-13 07:45:13,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 449. [2021-10-13 07:45:13,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 447 states have (on average 1.3243847874720358) internal successors, (592), 448 states have internal predecessors, (592), 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) [2021-10-13 07:45:13,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 592 transitions. [2021-10-13 07:45:13,994 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 592 transitions. Word has length 48 [2021-10-13 07:45:13,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:13,995 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 592 transitions. [2021-10-13 07:45:13,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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) [2021-10-13 07:45:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 592 transitions. [2021-10-13 07:45:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-13 07:45:13,996 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:13,997 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:14,012 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:14,208 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:14,208 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1954870014, now seen corresponding path program 1 times [2021-10-13 07:45:14,209 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:14,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1470620201] [2021-10-13 07:45:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:14,214 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:14,215 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:14,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-13 07:45:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:14,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:14,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:14,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:14,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:14,674 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:14,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1470620201] [2021-10-13 07:45:14,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1470620201] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:14,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:14,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:14,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846364372] [2021-10-13 07:45:14,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:14,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:14,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:14,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:14,681 INFO L87 Difference]: Start difference. First operand 449 states and 592 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2021-10-13 07:45:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:14,735 INFO L93 Difference]: Finished difference Result 914 states and 1200 transitions. [2021-10-13 07:45:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 52 [2021-10-13 07:45:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:14,746 INFO L225 Difference]: With dead ends: 914 [2021-10-13 07:45:14,746 INFO L226 Difference]: Without dead ends: 555 [2021-10-13 07:45:14,747 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:14,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2021-10-13 07:45:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2021-10-13 07:45:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 553 states have (on average 1.298372513562387) internal successors, (718), 554 states have internal predecessors, (718), 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) [2021-10-13 07:45:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 718 transitions. [2021-10-13 07:45:14,803 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 718 transitions. Word has length 52 [2021-10-13 07:45:14,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:14,804 INFO L470 AbstractCegarLoop]: Abstraction has 555 states and 718 transitions. [2021-10-13 07:45:14,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2021-10-13 07:45:14,806 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 718 transitions. [2021-10-13 07:45:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:45:14,808 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:14,808 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:14,826 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:15,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:15,020 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:15,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1072726839, now seen corresponding path program 1 times [2021-10-13 07:45:15,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:15,021 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1334130233] [2021-10-13 07:45:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:15,021 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:15,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:15,022 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:15,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-10-13 07:45:15,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:15,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:45:15,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:15,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:15,474 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:15,476 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1334130233] [2021-10-13 07:45:15,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1334130233] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:15,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:15,477 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 07:45:15,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189586301] [2021-10-13 07:45:15,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:45:15,478 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:15,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:45:15,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:45:15,479 INFO L87 Difference]: Start difference. First operand 555 states and 718 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2021-10-13 07:45:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:15,614 INFO L93 Difference]: Finished difference Result 1620 states and 2104 transitions. [2021-10-13 07:45:15,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:45:15,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2021-10-13 07:45:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:15,622 INFO L225 Difference]: With dead ends: 1620 [2021-10-13 07:45:15,622 INFO L226 Difference]: Without dead ends: 1203 [2021-10-13 07:45:15,624 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2021-10-13 07:45:15,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 579. [2021-10-13 07:45:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 577 states have (on average 1.2790294627383016) internal successors, (738), 578 states have internal predecessors, (738), 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) [2021-10-13 07:45:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 738 transitions. [2021-10-13 07:45:15,704 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 738 transitions. Word has length 53 [2021-10-13 07:45:15,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:15,704 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 738 transitions. [2021-10-13 07:45:15,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2021-10-13 07:45:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 738 transitions. [2021-10-13 07:45:15,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:45:15,706 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:15,706 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:15,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:15,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:15,922 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:15,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1443121595, now seen corresponding path program 1 times [2021-10-13 07:45:15,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:15,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138787206] [2021-10-13 07:45:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:15,923 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:15,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:15,924 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:15,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-10-13 07:45:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:16,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:45:16,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:16,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:16,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:16,385 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:16,385 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138787206] [2021-10-13 07:45:16,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138787206] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:16,386 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:16,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2021-10-13 07:45:16,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965731217] [2021-10-13 07:45:16,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:45:16,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:16,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:45:16,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:45:16,387 INFO L87 Difference]: Start difference. First operand 579 states and 738 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2021-10-13 07:45:16,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:16,558 INFO L93 Difference]: Finished difference Result 1476 states and 1885 transitions. [2021-10-13 07:45:16,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 07:45:16,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2021-10-13 07:45:16,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:16,565 INFO L225 Difference]: With dead ends: 1476 [2021-10-13 07:45:16,565 INFO L226 Difference]: Without dead ends: 911 [2021-10-13 07:45:16,566 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2021-10-13 07:45:16,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 480. [2021-10-13 07:45:16,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 478 states have (on average 1.2594142259414225) internal successors, (602), 479 states have internal predecessors, (602), 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) [2021-10-13 07:45:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 602 transitions. [2021-10-13 07:45:16,619 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 602 transitions. Word has length 53 [2021-10-13 07:45:16,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:16,620 INFO L470 AbstractCegarLoop]: Abstraction has 480 states and 602 transitions. [2021-10-13 07:45:16,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 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) [2021-10-13 07:45:16,620 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 602 transitions. [2021-10-13 07:45:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:45:16,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:16,622 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:16,635 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:16,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:16,837 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:16,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:16,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1577075519, now seen corresponding path program 1 times [2021-10-13 07:45:16,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:16,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615667680] [2021-10-13 07:45:16,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:16,838 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:16,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:16,839 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:16,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-10-13 07:45:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:17,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:17,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:45:17,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:45:17,244 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:17,244 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615667680] [2021-10-13 07:45:17,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1615667680] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:17,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:17,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:17,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861272890] [2021-10-13 07:45:17,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:17,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:17,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:17,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:17,251 INFO L87 Difference]: Start difference. First operand 480 states and 602 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2021-10-13 07:45:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:17,318 INFO L93 Difference]: Finished difference Result 862 states and 1087 transitions. [2021-10-13 07:45:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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 53 [2021-10-13 07:45:17,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:17,324 INFO L225 Difference]: With dead ends: 862 [2021-10-13 07:45:17,324 INFO L226 Difference]: Without dead ends: 478 [2021-10-13 07:45:17,326 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:17,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2021-10-13 07:45:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 437. [2021-10-13 07:45:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 435 states have (on average 1.232183908045977) internal successors, (536), 436 states have internal predecessors, (536), 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) [2021-10-13 07:45:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 536 transitions. [2021-10-13 07:45:17,369 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 536 transitions. Word has length 53 [2021-10-13 07:45:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:17,370 INFO L470 AbstractCegarLoop]: Abstraction has 437 states and 536 transitions. [2021-10-13 07:45:17,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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) [2021-10-13 07:45:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 536 transitions. [2021-10-13 07:45:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2021-10-13 07:45:17,372 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:17,372 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:17,390 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2021-10-13 07:45:17,583 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:17,587 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:17,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:17,587 INFO L82 PathProgramCache]: Analyzing trace with hash -179687388, now seen corresponding path program 1 times [2021-10-13 07:45:17,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:17,587 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032536675] [2021-10-13 07:45:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:17,588 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:17,589 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:17,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-10-13 07:45:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:17,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-13 07:45:17,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:17,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:18,110 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:18,110 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032536675] [2021-10-13 07:45:18,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032536675] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:18,110 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:18,111 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-10-13 07:45:18,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154747702] [2021-10-13 07:45:18,111 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:18,111 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:18,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:18,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:18,112 INFO L87 Difference]: Start difference. First operand 437 states and 536 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2021-10-13 07:45:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:18,174 INFO L93 Difference]: Finished difference Result 481 states and 588 transitions. [2021-10-13 07:45:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:18,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2021-10-13 07:45:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:18,178 INFO L225 Difference]: With dead ends: 481 [2021-10-13 07:45:18,178 INFO L226 Difference]: Without dead ends: 479 [2021-10-13 07:45:18,179 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:45:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2021-10-13 07:45:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 435. [2021-10-13 07:45:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 434 states have (on average 1.228110599078341) internal successors, (533), 434 states have internal predecessors, (533), 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) [2021-10-13 07:45:18,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 533 transitions. [2021-10-13 07:45:18,236 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 533 transitions. Word has length 53 [2021-10-13 07:45:18,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:18,237 INFO L470 AbstractCegarLoop]: Abstraction has 435 states and 533 transitions. [2021-10-13 07:45:18,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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) [2021-10-13 07:45:18,237 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 533 transitions. [2021-10-13 07:45:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-10-13 07:45:18,239 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:18,239 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:18,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:18,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:18,452 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:18,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:18,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1275353301, now seen corresponding path program 1 times [2021-10-13 07:45:18,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:18,453 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629630696] [2021-10-13 07:45:18,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:18,454 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:18,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:18,455 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:18,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-10-13 07:45:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:18,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:45:18,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:19,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:19,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:19,358 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:19,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629630696] [2021-10-13 07:45:19,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629630696] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:19,359 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542793688] [2021-10-13 07:45:19,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:19,359 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-10-13 07:45:19,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/cvc4 [2021-10-13 07:45:19,371 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-10-13 07:45:19,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2021-10-13 07:45:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:19,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjunts are in the unsatisfiable core [2021-10-13 07:45:19,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:20,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:20,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [542793688] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:20,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334866726] [2021-10-13 07:45:20,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:20,407 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-13 07:45:20,407 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:45:20,409 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-10-13 07:45:20,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-10-13 07:45:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:20,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-13 07:45:20,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:21,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:21,525 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334866726] provided 0 perfect and 2 imperfect interpolant sequences [2021-10-13 07:45:21,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 6 imperfect interpolant sequences. [2021-10-13 07:45:21,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5, 4, 5, 4] total 7 [2021-10-13 07:45:21,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121960134] [2021-10-13 07:45:21,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 07:45:21,528 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:21,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 07:45:21,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:21,531 INFO L87 Difference]: Start difference. First operand 435 states and 533 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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) [2021-10-13 07:45:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:21,701 INFO L93 Difference]: Finished difference Result 976 states and 1204 transitions. [2021-10-13 07:45:21,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:45:21,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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 54 [2021-10-13 07:45:21,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:21,708 INFO L225 Difference]: With dead ends: 976 [2021-10-13 07:45:21,709 INFO L226 Difference]: Without dead ends: 974 [2021-10-13 07:45:21,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.3ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:45:21,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-10-13 07:45:21,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 693. [2021-10-13 07:45:21,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.2369942196531791) internal successors, (856), 692 states have internal predecessors, (856), 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) [2021-10-13 07:45:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 856 transitions. [2021-10-13 07:45:21,807 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 856 transitions. Word has length 54 [2021-10-13 07:45:21,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:21,809 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 856 transitions. [2021-10-13 07:45:21,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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) [2021-10-13 07:45:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 856 transitions. [2021-10-13 07:45:21,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-10-13 07:45:21,811 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:21,812 INFO L512 BasicCegarLoop]: trace histogram [3, 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] [2021-10-13 07:45:21,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt (12)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:22,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2021-10-13 07:45:22,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:22,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/cvc4 --incremental --print-success --lang smt,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:22,415 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:22,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:22,415 INFO L82 PathProgramCache]: Analyzing trace with hash 602571322, now seen corresponding path program 2 times [2021-10-13 07:45:22,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:22,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022594504] [2021-10-13 07:45:22,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-10-13 07:45:22,416 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:22,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:22,418 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:22,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-10-13 07:45:22,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-10-13 07:45:22,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-10-13 07:45:22,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:22,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:22,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:45:23,119 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:23,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022594504] [2021-10-13 07:45:23,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022594504] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:23,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:23,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2021-10-13 07:45:23,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847355728] [2021-10-13 07:45:23,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:45:23,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:23,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:45:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:23,121 INFO L87 Difference]: Start difference. First operand 693 states and 856 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2021-10-13 07:45:23,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:23,234 INFO L93 Difference]: Finished difference Result 1169 states and 1453 transitions. [2021-10-13 07:45:23,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:45:23,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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 69 [2021-10-13 07:45:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:23,239 INFO L225 Difference]: With dead ends: 1169 [2021-10-13 07:45:23,239 INFO L226 Difference]: Without dead ends: 647 [2021-10-13 07:45:23,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:45:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2021-10-13 07:45:23,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 627. [2021-10-13 07:45:23,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 626 states have (on average 1.220447284345048) internal successors, (764), 626 states have internal predecessors, (764), 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) [2021-10-13 07:45:23,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 764 transitions. [2021-10-13 07:45:23,310 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 764 transitions. Word has length 69 [2021-10-13 07:45:23,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:23,311 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 764 transitions. [2021-10-13 07:45:23,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 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) [2021-10-13 07:45:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 764 transitions. [2021-10-13 07:45:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-10-13 07:45:23,313 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:45:23,314 INFO L512 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:45:23,330 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:23,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:23,527 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-13 07:45:23,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:45:23,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1099928721, now seen corresponding path program 1 times [2021-10-13 07:45:23,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-13 07:45:23,528 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096448327] [2021-10-13 07:45:23,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:45:23,529 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-13 07:45:23,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat [2021-10-13 07:45:23,530 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-13 07:45:23,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-10-13 07:45:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:45:23,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2021-10-13 07:45:23,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-13 07:45:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:45:24,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-13 07:45:24,348 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 07:45:24,348 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-13 07:45:24,348 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096448327] [2021-10-13 07:45:24,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096448327] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-13 07:45:24,349 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:45:24,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2021-10-13 07:45:24,349 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886004731] [2021-10-13 07:45:24,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:45:24,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-13 07:45:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:45:24,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:24,351 INFO L87 Difference]: Start difference. First operand 627 states and 764 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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) [2021-10-13 07:45:24,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:45:24,430 INFO L93 Difference]: Finished difference Result 899 states and 1091 transitions. [2021-10-13 07:45:24,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:45:24,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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 81 [2021-10-13 07:45:24,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:45:24,431 INFO L225 Difference]: With dead ends: 899 [2021-10-13 07:45:24,431 INFO L226 Difference]: Without dead ends: 0 [2021-10-13 07:45:24,432 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:45:24,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-13 07:45:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-13 07:45:24,433 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) [2021-10-13 07:45:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-13 07:45:24,433 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2021-10-13 07:45:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:45:24,434 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-13 07:45:24,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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) [2021-10-13 07:45:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-13 07:45:24,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-13 07:45:24,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:45:24,437 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-13 07:45:24,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-10-13 07:45:24,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/mathsat -unsat_core_generation=3 [2021-10-13 07:45:24,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-13 07:45:24,656 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:24,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,048 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,083 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,172 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,315 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,406 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,424 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,498 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,547 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,565 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,900 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:25,963 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:26,028 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:26,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:26,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-13 07:45:34,959 INFO L857 garLoopResultBuilder]: For program point L316(line 316) no Hoare annotation was computed. [2021-10-13 07:45:34,960 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-13 07:45:34,960 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-13 07:45:34,960 INFO L857 garLoopResultBuilder]: For program point L53(lines 53 62) no Hoare annotation was computed. [2021-10-13 07:45:34,960 INFO L857 garLoopResultBuilder]: For program point L53-2(lines 53 62) no Hoare annotation was computed. [2021-10-13 07:45:34,960 INFO L857 garLoopResultBuilder]: For program point L53-3(lines 53 62) no Hoare annotation was computed. [2021-10-13 07:45:34,961 INFO L857 garLoopResultBuilder]: For program point L53-5(lines 53 62) no Hoare annotation was computed. [2021-10-13 07:45:34,961 INFO L853 garLoopResultBuilder]: At program point L301(lines 290 303) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,961 INFO L857 garLoopResultBuilder]: For program point L268(lines 268 275) no Hoare annotation was computed. [2021-10-13 07:45:34,961 INFO L857 garLoopResultBuilder]: For program point L153(lines 152 187) no Hoare annotation was computed. [2021-10-13 07:45:34,961 INFO L857 garLoopResultBuilder]: For program point L54(lines 54 59) no Hoare annotation was computed. [2021-10-13 07:45:34,961 INFO L857 garLoopResultBuilder]: For program point L54-1(lines 54 59) no Hoare annotation was computed. [2021-10-13 07:45:34,962 INFO L853 garLoopResultBuilder]: At program point L302(lines 286 304) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,962 INFO L857 garLoopResultBuilder]: For program point L253(lines 253 260) no Hoare annotation was computed. [2021-10-13 07:45:34,962 INFO L857 garLoopResultBuilder]: For program point L220(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:45:34,962 INFO L857 garLoopResultBuilder]: For program point L220-1(lines 220 225) no Hoare annotation was computed. [2021-10-13 07:45:34,962 INFO L857 garLoopResultBuilder]: For program point L154-1(lines 154 164) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L322(lines 322 326) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L240(line 240) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L174(lines 174 186) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 149) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L175(lines 175 181) no Hoare annotation was computed. [2021-10-13 07:45:34,963 INFO L857 garLoopResultBuilder]: For program point L76(lines 76 80) no Hoare annotation was computed. [2021-10-13 07:45:34,964 INFO L853 garLoopResultBuilder]: At program point L109-1(lines 97 134) the Hoare annotation is: (let ((.cse5 (= ~c_dr_pc~0 (_ bv0 32))) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse4 (= ~p_last_write~0 ~c_last_read~0)) (.cse6 (= ~q_free~0 (_ bv1 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (= ~q_free~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (= (_ bv2 32) ~c_dr_st~0) .cse7) (and .cse0 .cse8 .cse9 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse9) (and .cse0 (= ~p_num_write~0 (_ bv1 32)) .cse1 .cse9 .cse7) (and .cse10 .cse0 .cse8 .cse9))) [2021-10-13 07:45:34,964 INFO L857 garLoopResultBuilder]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2021-10-13 07:45:34,964 INFO L857 garLoopResultBuilder]: For program point L76-3(lines 76 80) no Hoare annotation was computed. [2021-10-13 07:45:34,964 INFO L857 garLoopResultBuilder]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2021-10-13 07:45:34,964 INFO L857 garLoopResultBuilder]: For program point L110(lines 109 129) no Hoare annotation was computed. [2021-10-13 07:45:34,965 INFO L857 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2021-10-13 07:45:34,965 INFO L857 garLoopResultBuilder]: For program point L11-1(line 11) no Hoare annotation was computed. [2021-10-13 07:45:34,969 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-13 07:45:34,969 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 148) no Hoare annotation was computed. [2021-10-13 07:45:34,969 INFO L853 garLoopResultBuilder]: At program point L111(lines 97 134) the Hoare annotation is: (let ((.cse4 (= ~c_dr_pc~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~p_num_write~0 (_ bv0 32))) (.cse5 (= ~p_dw_pc~0 (_ bv0 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse6 (not (= ~c_dr_st~0 (_ bv0 32))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse6 .cse4 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse6 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and (= ~p_dw_pc~0 (_ bv1 32)) .cse0 .cse2 .cse6 (= ~p_num_write~0 ~c_num_read~0)))) [2021-10-13 07:45:34,970 INFO L853 garLoopResultBuilder]: At program point L45(lines 33 47) the Hoare annotation is: (let ((.cse0 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse4 (= ~p_last_write~0 ~q_buf_0~0)) (.cse7 (= ~p_num_write~0 (_ bv1 32))) (.cse8 (= ~c_num_read~0 (_ bv0 32))) (.cse5 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse6 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse2 (= ~c_dr_pc~0 (_ bv0 32))) (.cse3 (= ~p_dw_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= ~p_dw_pc~0 (_ bv1 32)) .cse4 .cse5 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse6) (and .cse4 .cse7 .cse8 .cse5 .cse0 .cse6 .cse1 .cse3) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse0 .cse2) (and .cse4 .cse7 .cse8 .cse5 .cse6 .cse1 .cse2 .cse3))) [2021-10-13 07:45:34,970 INFO L853 garLoopResultBuilder]: At program point L45-1(lines 33 47) the Hoare annotation is: (and (= ~p_dw_pc~0 (_ bv1 32)) (= ~p_last_write~0 ~q_buf_0~0) (not (= ~c_dr_st~0 (_ bv0 32))) (= ~p_dw_st~0 (_ bv2 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0)) [2021-10-13 07:45:34,970 INFO L853 garLoopResultBuilder]: At program point L12-1(lines 140 192) the Hoare annotation is: (let ((.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse6 (= ~p_dw_pc~0 (_ bv0 32))) (.cse8 (= ~p_dw_st~0 (_ bv2 32))) (.cse7 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse9 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse0 .cse8 .cse3 .cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse9) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse7 .cse0 (not (= ~c_dr_st~0 (_ bv0 32))) (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) .cse8) (and .cse7 .cse0 .cse3 .cse4 .cse5 .cse9))) [2021-10-13 07:45:34,970 INFO L857 garLoopResultBuilder]: For program point L244(lines 244 248) no Hoare annotation was computed. [2021-10-13 07:45:34,970 INFO L857 garLoopResultBuilder]: For program point L244-1(lines 239 279) no Hoare annotation was computed. [2021-10-13 07:45:34,971 INFO L853 garLoopResultBuilder]: At program point L145(lines 140 192) the Hoare annotation is: (and (= ~p_dw_pc~0 (_ bv1 32)) (= ~p_last_write~0 ~q_buf_0~0) (not (= ~c_dr_st~0 (_ bv0 32))) (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) (= ~q_free~0 (_ bv0 32)) (= ~p_dw_st~0 (_ bv2 32))) [2021-10-13 07:45:34,971 INFO L853 garLoopResultBuilder]: At program point L46(lines 30 48) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (= ~p_num_write~0 (_ bv1 32))) (.cse9 (= ~c_num_read~0 (_ bv0 32))) (.cse1 (not (= ~p_dw_st~0 (_ bv0 32)))) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse6 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse2 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse5 (= ~c_dr_pc~0 (_ bv0 32)))) (or (and (= ~p_dw_pc~0 (_ bv1 32)) .cse0 .cse1 .cse2 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse3) (and .cse2 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse0 .cse8 .cse9 .cse1 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse2 .cse5))) [2021-10-13 07:45:34,971 INFO L853 garLoopResultBuilder]: At program point L46-1(lines 30 48) the Hoare annotation is: (and (= ~p_dw_pc~0 (_ bv1 32)) (= ~p_last_write~0 ~q_buf_0~0) (not (= ~c_dr_st~0 (_ bv0 32))) (= ~p_dw_st~0 (_ bv2 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~q_free~0 (_ bv1 32)) (= ~p_num_write~0 ~c_num_read~0)) [2021-10-13 07:45:34,971 INFO L860 garLoopResultBuilder]: At program point L360(lines 351 362) the Hoare annotation is: true [2021-10-13 07:45:34,971 INFO L857 garLoopResultBuilder]: For program point L294(lines 294 299) no Hoare annotation was computed. [2021-10-13 07:45:34,972 INFO L853 garLoopResultBuilder]: At program point L228(lines 215 230) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,972 INFO L853 garLoopResultBuilder]: At program point L228-1(lines 215 230) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,972 INFO L860 garLoopResultBuilder]: At program point L328(lines 305 333) the Hoare annotation is: true [2021-10-13 07:45:34,972 INFO L853 garLoopResultBuilder]: At program point L229(lines 212 231) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,973 INFO L853 garLoopResultBuilder]: At program point L229-1(lines 212 231) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,973 INFO L853 garLoopResultBuilder]: At program point L64(lines 52 66) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~p_num_write~0 (_ bv1 32))) (.cse6 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse7 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse10 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse11 (= ~p_dw_pc~0 (_ bv0 32))) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse2 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse8 (= ~c_dr_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse3) (and .cse1 .cse4 .cse5 .cse6 (not (= ~p_dw_st~0 (_ bv0 32))) .cse3 .cse7 .cse8 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3 .cse7 .cse9 .cse10 .cse11) (and .cse1 .cse4 .cse6 .cse2 .cse3 .cse7 .cse9 .cse10 .cse11) (and .cse5 .cse2 .cse8))) [2021-10-13 07:45:34,973 INFO L853 garLoopResultBuilder]: At program point L64-1(lines 52 66) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~q_free~0 (_ bv1 32))) (.cse5 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 (_ bv0 32)) .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 (_ bv2 32)) .cse3 .cse4 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse5))) [2021-10-13 07:45:34,973 INFO L857 garLoopResultBuilder]: For program point L98(lines 98 106) no Hoare annotation was computed. [2021-10-13 07:45:34,973 INFO L853 garLoopResultBuilder]: At program point L65(lines 49 67) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse4 (= ~p_num_write~0 (_ bv1 32))) (.cse6 (= ~c_num_read~0 (_ bv0 32))) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse8 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse10 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse11 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse12 (= ~p_dw_pc~0 (_ bv0 32))) (.cse5 (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32))) (.cse7 (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32))) (.cse2 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse9 (= ~c_dr_pc~0 (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse3) (and .cse1 .cse4 .cse5 .cse6 (not (= ~p_dw_st~0 (_ bv0 32))) .cse7 .cse3 .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse1 .cse5 .cse7 .cse2 .cse3 .cse8 .cse10 .cse11 .cse12) (and .cse0 .cse1 .cse5 .cse7 .cse2 .cse3) (and .cse1 .cse4 .cse6 .cse2 .cse3 .cse8 .cse10 .cse11 .cse12) (and .cse5 .cse7 .cse2 .cse9))) [2021-10-13 07:45:34,974 INFO L853 garLoopResultBuilder]: At program point L65-1(lines 49 67) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse4 (= ~q_free~0 (_ bv1 32))) (.cse5 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ~p_dw_st~0 (_ bv0 32)) .cse4 .cse5) (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 (_ bv2 32)) .cse3 .cse4 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse5))) [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2021-10-13 07:45:34,974 INFO L853 garLoopResultBuilder]: At program point L280(lines 232 285) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,974 INFO L853 garLoopResultBuilder]: At program point L264(lines 239 279) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point L198(lines 198 202) no Hoare annotation was computed. [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point L198-2(lines 197 210) no Hoare annotation was computed. [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point L34(lines 34 43) no Hoare annotation was computed. [2021-10-13 07:45:34,974 INFO L857 garLoopResultBuilder]: For program point L34-2(lines 34 43) no Hoare annotation was computed. [2021-10-13 07:45:34,975 INFO L857 garLoopResultBuilder]: For program point L34-3(lines 34 43) no Hoare annotation was computed. [2021-10-13 07:45:34,975 INFO L857 garLoopResultBuilder]: For program point L34-5(lines 34 43) no Hoare annotation was computed. [2021-10-13 07:45:34,975 INFO L853 garLoopResultBuilder]: At program point L348(lines 334 350) the Hoare annotation is: (and (= ~p_last_write~0 ~q_buf_0~0) (= ~c_num_read~0 (_ bv0 32)) (= ~p_num_write~0 (_ bv0 32)) (= ~p_last_write~0 ~c_last_read~0) (= ~p_dw_st~0 (_ bv0 32)) (= ~c_dr_pc~0 (_ bv0 32)) (= ~q_free~0 (_ bv1 32)) (= ~p_dw_pc~0 (_ bv0 32))) [2021-10-13 07:45:34,975 INFO L853 garLoopResultBuilder]: At program point L315-1(lines 194 327) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,975 INFO L853 garLoopResultBuilder]: At program point L249(lines 239 279) the Hoare annotation is: (let ((.cse9 (= ~c_dr_pc~0 (_ bv0 32))) (.cse4 (= ~p_dw_st~0 (_ bv0 32))) (.cse11 (= ~q_free~0 (_ bv0 32))) (.cse1 (= ~c_num_read~0 (_ bv0 32))) (.cse2 (= ~p_num_write~0 (_ bv0 32))) (.cse3 (= ~p_last_write~0 ~c_last_read~0)) (.cse5 (= ~q_free~0 (_ bv1 32))) (.cse6 (= (_ bv2 32) ~c_dr_st~0)) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse10 (= ~p_dw_pc~0 (_ bv1 32))) (.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse8 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse12 (= ~p_dw_st~0 (_ bv2 32))) (.cse13 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse8 .cse9 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32))) (and .cse8 .cse9 .cse5 .cse7) (and .cse10 .cse0 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse9 .cse5 .cse7) (and .cse10 .cse0 .cse8 .cse4 .cse13) (and .cse10 .cse0 .cse8 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse12 .cse3 .cse5 .cse6 .cse7) (and .cse10 .cse0 .cse8 .cse12 .cse13))) [2021-10-13 07:45:34,975 INFO L857 garLoopResultBuilder]: For program point L216(lines 216 226) no Hoare annotation was computed. [2021-10-13 07:45:34,976 INFO L857 garLoopResultBuilder]: For program point L216-1(lines 216 226) no Hoare annotation was computed. [2021-10-13 07:45:34,976 INFO L857 garLoopResultBuilder]: For program point L84(lines 84 88) no Hoare annotation was computed. [2021-10-13 07:45:34,976 INFO L853 garLoopResultBuilder]: At program point L84-2(lines 68 92) the Hoare annotation is: (let ((.cse8 (= ~p_dw_pc~0 (_ bv1 32))) (.cse2 (= ~p_last_write~0 ~q_buf_0~0)) (.cse0 (not (= ~c_dr_st~0 (_ bv0 32)))) (.cse3 (= ~q_free~0 (_ bv0 32))) (.cse4 (= ULTIMATE.start_is_do_write_p_triggered_~__retres1~0 (_ bv0 32))) (.cse5 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32))) (.cse6 (= |ULTIMATE.start_is_do_write_p_triggered_#res| (_ bv0 32))) (.cse7 (= ~p_dw_pc~0 (_ bv0 32))) (.cse1 (= ULTIMATE.start_immediate_notify_threads_~tmp___0~0 (_ bv0 32)))) (or (and (= ULTIMATE.start_is_do_read_c_triggered_~__retres1~1 (_ bv0 32)) (= |ULTIMATE.start_is_do_read_c_triggered_#res| (_ bv0 32)) .cse0 (= ~c_dr_pc~0 (_ bv0 32)) .cse1) (and .cse2 (= ~p_num_write~0 (_ bv1 32)) (= ~c_num_read~0 (_ bv0 32)) .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse2 (= ~p_num_write~0 (bvadd ~c_num_read~0 (_ bv1 32))) .cse3) (and .cse8 .cse2 .cse0 .cse3 .cse1) (and .cse2 .cse0 .cse3 .cse4 .cse5 .cse6 .cse7 .cse1))) [2021-10-13 07:45:34,976 INFO L857 garLoopResultBuilder]: For program point L84-3(lines 84 88) no Hoare annotation was computed. [2021-10-13 07:45:34,976 INFO L853 garLoopResultBuilder]: At program point L84-5(lines 68 92) the Hoare annotation is: (let ((.cse0 (= ~p_dw_pc~0 (_ bv1 32))) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~p_last_write~0 ~c_last_read~0)) (.cse3 (= ~q_free~0 (_ bv1 32))) (.cse4 (= ~p_num_write~0 ~c_num_read~0))) (or (and .cse0 .cse1 (= ~p_dw_st~0 (_ bv2 32)) .cse2 .cse3 (= ULTIMATE.start_immediate_notify_threads_~tmp~0 (_ bv0 32)) .cse4) (and .cse0 .cse1 .cse2 (= ~p_dw_st~0 (_ bv0 32)) .cse3 .cse4))) [2021-10-13 07:45:34,977 INFO L857 garLoopResultBuilder]: For program point L101(lines 101 105) no Hoare annotation was computed. [2021-10-13 07:45:34,977 INFO L857 garLoopResultBuilder]: For program point L35(lines 35 40) no Hoare annotation was computed. [2021-10-13 07:45:34,977 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 40) no Hoare annotation was computed. [2021-10-13 07:45:34,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:45:35,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:45:35 BoogieIcfgContainer [2021-10-13 07:45:35,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:45:35,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:45:35,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:45:35,095 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:45:35,096 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:45:10" (3/4) ... [2021-10-13 07:45:35,101 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-13 07:45:35,125 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-13 07:45:35,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-13 07:45:35,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:45:35,127 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-13 07:45:35,158 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,159 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,160 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) [2021-10-13 07:45:35,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || (((p_last_write == q_buf_0 && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || ((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && q_free == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) [2021-10-13 07:45:35,161 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32)) || (((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && !(c_dr_st == 0bv32)) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == c_num_read) [2021-10-13 07:45:35,162 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(c_dr_st == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) [2021-10-13 07:45:35,163 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || ((((!(c_dr_st == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) [2021-10-13 07:45:35,163 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || ((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32)) || (((((((p_last_write == q_buf_0 && __retres1 == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((__retres1 == 0bv32 && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) [2021-10-13 07:45:35,164 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || (((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && __retres1 == 0bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) [2021-10-13 07:45:35,164 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && tmp___0 == 0bv32)) || (((((((p_last_write == q_buf_0 && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && tmp___0 == 0bv32) [2021-10-13 07:45:35,199 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:45:35,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:45:35,201 INFO L168 Benchmark]: Toolchain (without parser) took 25534.62 ms. Allocated memory was 69.2 MB in the beginning and 121.6 MB in the end (delta: 52.4 MB). Free memory was 53.4 MB in the beginning and 27.1 MB in the end (delta: 26.3 MB). Peak memory consumption was 78.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,202 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 69.2 MB. Free memory is still 51.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:45:35,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.39 ms. Allocated memory is still 69.2 MB. Free memory was 53.3 MB in the beginning and 52.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.85 ms. Allocated memory is still 69.2 MB. Free memory was 52.1 MB in the beginning and 50.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,203 INFO L168 Benchmark]: Boogie Preprocessor took 88.03 ms. Allocated memory is still 69.2 MB. Free memory was 50.0 MB in the beginning and 48.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:45:35,204 INFO L168 Benchmark]: RCFGBuilder took 553.89 ms. Allocated memory is still 69.2 MB. Free memory was 48.5 MB in the beginning and 33.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,204 INFO L168 Benchmark]: TraceAbstraction took 24322.86 ms. Allocated memory was 69.2 MB in the beginning and 121.6 MB in the end (delta: 52.4 MB). Free memory was 33.3 MB in the beginning and 33.4 MB in the end (delta: -145.0 kB). Peak memory consumption was 65.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,205 INFO L168 Benchmark]: Witness Printer took 104.65 ms. Allocated memory is still 121.6 MB. Free memory was 33.4 MB in the beginning and 27.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:45:35,207 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.26 ms. Allocated memory is still 69.2 MB. Free memory is still 51.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 415.39 ms. Allocated memory is still 69.2 MB. Free memory was 53.3 MB in the beginning and 52.1 MB in the end (delta: 1.2 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.85 ms. Allocated memory is still 69.2 MB. Free memory was 52.1 MB in the beginning and 50.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 88.03 ms. Allocated memory is still 69.2 MB. Free memory was 50.0 MB in the beginning and 48.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 553.89 ms. Allocated memory is still 69.2 MB. Free memory was 48.5 MB in the beginning and 33.8 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 24322.86 ms. Allocated memory was 69.2 MB in the beginning and 121.6 MB in the end (delta: 52.4 MB). Free memory was 33.3 MB in the beginning and 33.4 MB in the end (delta: -145.0 kB). Peak memory consumption was 65.3 MB. Max. memory is 16.1 GB. * Witness Printer took 104.65 ms. Allocated memory is still 121.6 MB. Free memory was 33.4 MB in the beginning and 27.1 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 11]: 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, 76 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 24149.7ms, OverallIterations: 12, TraceHistogramMax: 3, EmptinessCheckTime: 45.0ms, AutomataDifference: 1375.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 10308.0ms, InitialAbstractionConstructionTime: 24.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1528 SDtfs, 1613 SDslu, 2124 SDs, 0 SdLazy, 179 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 271.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1437 GetRequests, 1409 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 144.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=693occurred in iteration=10, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 636.5ms AutomataMinimizationTime, 12 MinimizatonAttempts, 1662 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 27 LocationsWithAnnotation, 27 PreInvPairs, 237 NumberOfFragments, 3194 HoareAnnotationTreeSize, 27 FomulaSimplifications, 39213 FormulaSimplificationTreeSizeReduction, 1397.2ms HoareSimplificationTime, 27 FomulaSimplificationsInter, 14403 FormulaSimplificationTreeSizeReductionInter, 8896.1ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 201.6ms SsaConstructionTime, 533.5ms SatisfiabilityAnalysisTime, 5357.2ms InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1428 ConstructedInterpolants, 0 QuantifiedInterpolants, 3334 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1596 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 134/146 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 2 specifications checked. All of them hold - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: (((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) || ((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && tmp == 0bv32) && p_num_write == c_num_read)) || ((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && tmp == 0bv32) && p_num_write == c_num_read) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) - InvariantResult [Line: 334]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || ((((!(c_dr_st == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) - InvariantResult [Line: 286]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && p_num_write == c_num_read - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 194]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || (((p_last_write == q_buf_0 && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || ((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && q_free == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && p_num_write == c_num_read - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || ((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32)) || (((((((p_last_write == q_buf_0 && __retres1 == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((__retres1 == 0bv32 && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || ((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32)) || (((((p_last_write == q_buf_0 && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && p_num_write == 0bv32) && !(c_dr_st == 0bv32)) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == c_num_read) - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) || (((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && tmp == 0bv32) && p_num_write == c_num_read) - InvariantResult [Line: 290]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 215]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 140]: Loop Invariant Derived loop invariant: ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: ((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && p_num_write == c_num_read) || (((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && tmp == 0bv32) && p_num_write == c_num_read) - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: (((((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && tmp___0 == 0bv32)) || (((((((p_last_write == q_buf_0 && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32) && tmp___0 == 0bv32) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 239]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 212]: Loop Invariant Derived loop invariant: (((((((((((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32) || ((((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) && tmp___0 == 0bv32)) || (((!(c_dr_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_last_write == c_last_read) && p_dw_st == 0bv32) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && c_dr_pc == 0bv32) && q_free == 1bv32) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 0bv32) && p_num_write == c_num_read)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && p_dw_st == 2bv32)) || (((((((p_last_write == q_buf_0 && c_num_read == 0bv32) && p_num_write == 0bv32) && p_dw_st == 2bv32) && p_last_write == c_last_read) && q_free == 1bv32) && 2bv32 == c_dr_st) && p_dw_pc == 0bv32)) || ((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_dw_st == 2bv32) && p_num_write == c_num_read) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((((!(c_dr_st == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32)) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32)) || (((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && p_dw_pc == 0bv32) - InvariantResult [Line: 305]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: ((((((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && !(c_dr_st == 0bv32)) && p_num_write == ~bvadd64(c_num_read, 1bv32)) && q_free == 0bv32) || (((((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && __retres1 == 0bv32) && c_num_read == 0bv32) && !(p_dw_st == 0bv32)) && \result == 0bv32) && q_free == 0bv32) && __retres1 == 0bv32) && c_dr_pc == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || ((((((((p_last_write == q_buf_0 && __retres1 == 0bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((((p_dw_pc == 1bv32 && p_last_write == q_buf_0) && __retres1 == 0bv32) && \result == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32)) || ((((((((p_last_write == q_buf_0 && p_num_write == 1bv32) && c_num_read == 0bv32) && !(c_dr_st == 0bv32)) && q_free == 0bv32) && __retres1 == 0bv32) && tmp == 0bv32) && \result == 0bv32) && p_dw_pc == 0bv32)) || (((__retres1 == 0bv32 && \result == 0bv32) && !(c_dr_st == 0bv32)) && c_dr_pc == 0bv32) RESULT: Ultimate proved your program to be correct! [2021-10-13 07:45:35,296 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_db647122-01a4-492f-94ca-c199ea6cbc6a/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...