./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/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_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh --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 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 07:29:30,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:29:30,182 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:29:30,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:29:30,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:29:30,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:29:30,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:29:30,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:29:30,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:29:30,200 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:29:30,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:29:30,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:29:30,202 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:29:30,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:29:30,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:29:30,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:29:30,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:29:30,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:29:30,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:29:30,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:29:30,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:29:30,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:29:30,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:29:30,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:29:30,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:29:30,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:29:30,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:29:30,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:29:30,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:29:30,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:29:30,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:29:30,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:29:30,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:29:30,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:29:30,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:29:30,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:29:30,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:29:30,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:29:30,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:29:30,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:29:30,220 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:29:30,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 07:29:30,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:29:30,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:29:30,235 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:29:30,235 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:29:30,235 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:29:30,235 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:29:30,236 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:29:30,236 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:29:30,236 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:29:30,236 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:29:30,236 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:29:30,236 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:29:30,237 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:29:30,237 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:29:30,237 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:29:30,237 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:29:30,237 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:29:30,237 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:29:30,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:29:30,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:29:30,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:29:30,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:29:30,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 07:29:30,239 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:29:30,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 07:29:30,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:29:30,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:29:30,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:29:30,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:29:30,240 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 07:29:30,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:29:30,242 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/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_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh 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 -> 1924d97c04cfa5367e34b409aac63a4fd986c243eb4aa0af30578d8598fbdf71 [2022-12-14 07:29:30,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:29:30,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:29:30,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:29:30,458 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:29:30,458 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:29:30,459 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-12-14 07:29:32,963 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:29:33,142 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:29:33,143 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c [2022-12-14 07:29:33,150 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/data/af9129f20/54e36e2890904dc38d0520c96342fdcd/FLAGc8bbd45a1 [2022-12-14 07:29:33,546 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/data/af9129f20/54e36e2890904dc38d0520c96342fdcd [2022-12-14 07:29:33,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:29:33,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:29:33,549 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:29:33,549 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:29:33,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:29:33,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a95eaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33, skipping insertion in model container [2022-12-14 07:29:33,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:29:33,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:29:33,679 WARN L237 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_451f0041-4cae-4968-a0f3-96462ace1f53/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-12-14 07:29:33,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:29:33,715 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:29:33,723 WARN L237 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_451f0041-4cae-4968-a0f3-96462ace1f53/sv-benchmarks/c/systemc/pc_sfifo_1.cil-2.c[642,655] [2022-12-14 07:29:33,736 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:29:33,747 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:29:33,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33 WrapperNode [2022-12-14 07:29:33,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:29:33,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:29:33,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:29:33,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:29:33,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,774 INFO L138 Inliner]: procedures = 24, calls = 22, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 202 [2022-12-14 07:29:33,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:29:33,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:29:33,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:29:33,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:29:33,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:29:33,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:29:33,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:29:33,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:29:33,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (1/1) ... [2022-12-14 07:29:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:29:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:33,819 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:29:33,822 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:29:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:29:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-12-14 07:29:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-12-14 07:29:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:29:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure error [2022-12-14 07:29:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2022-12-14 07:29:33,857 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-12-14 07:29:33,857 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-12-14 07:29:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:29:33,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:29:33,926 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:29:33,927 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:29:34,102 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:29:34,192 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:29:34,192 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-14 07:29:34,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:34 BoogieIcfgContainer [2022-12-14 07:29:34,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:29:34,197 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:29:34,197 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:29:34,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:29:34,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:29:33" (1/3) ... [2022-12-14 07:29:34,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410ab7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:34, skipping insertion in model container [2022-12-14 07:29:34,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:29:33" (2/3) ... [2022-12-14 07:29:34,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@410ab7f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:29:34, skipping insertion in model container [2022-12-14 07:29:34,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:34" (3/3) ... [2022-12-14 07:29:34,204 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2.c [2022-12-14 07:29:34,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:29:34,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 07:29:34,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:29:34,268 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3d7fc58c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:29:34,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 07:29:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 40 states have (on average 1.575) internal successors, (63), 43 states have internal predecessors, (63), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-14 07:29:34,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-14 07:29:34,277 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:34,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:29:34,278 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash -216375634, now seen corresponding path program 1 times [2022-12-14 07:29:34,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:34,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349521776] [2022-12-14 07:29:34,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:34,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:34,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:29:34,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:34,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349521776] [2022-12-14 07:29:34,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349521776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:34,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:34,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:29:34,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798502632] [2022-12-14 07:29:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:34,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:34,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:34,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:34,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,556 INFO L87 Difference]: Start difference. First operand has 51 states, 40 states have (on average 1.575) internal successors, (63), 43 states have internal predecessors, (63), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:34,631 INFO L93 Difference]: Finished difference Result 140 states and 208 transitions. [2022-12-14 07:29:34,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:34,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-12-14 07:29:34,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:34,638 INFO L225 Difference]: With dead ends: 140 [2022-12-14 07:29:34,638 INFO L226 Difference]: Without dead ends: 86 [2022-12-14 07:29:34,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,642 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:34,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 128 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:34,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-12-14 07:29:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-12-14 07:29:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 69 states have internal predecessors, (97), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-12-14 07:29:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 113 transitions. [2022-12-14 07:29:34,673 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 113 transitions. Word has length 27 [2022-12-14 07:29:34,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:34,673 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 113 transitions. [2022-12-14 07:29:34,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 113 transitions. [2022-12-14 07:29:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-14 07:29:34,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:34,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:29:34,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:29:34,675 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:34,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1389714114, now seen corresponding path program 1 times [2022-12-14 07:29:34,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:34,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244163108] [2022-12-14 07:29:34,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:34,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:34,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:29:34,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:34,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244163108] [2022-12-14 07:29:34,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244163108] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:34,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:34,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:29:34,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309874422] [2022-12-14 07:29:34,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:34,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:34,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:34,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:34,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,734 INFO L87 Difference]: Start difference. First operand 82 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:34,781 INFO L93 Difference]: Finished difference Result 238 states and 330 transitions. [2022-12-14 07:29:34,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:34,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-12-14 07:29:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:34,784 INFO L225 Difference]: With dead ends: 238 [2022-12-14 07:29:34,784 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 07:29:34,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,786 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:34,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 114 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:34,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 07:29:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-12-14 07:29:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 128 states have (on average 1.390625) internal successors, (178), 129 states have internal predecessors, (178), 16 states have call successors, (16), 9 states have call predecessors, (16), 8 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 07:29:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 208 transitions. [2022-12-14 07:29:34,806 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 208 transitions. Word has length 28 [2022-12-14 07:29:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:34,806 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 208 transitions. [2022-12-14 07:29:34,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,807 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 208 transitions. [2022-12-14 07:29:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 07:29:34,808 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:34,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:29:34,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:29:34,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:34,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1269386223, now seen corresponding path program 1 times [2022-12-14 07:29:34,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:34,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904618008] [2022-12-14 07:29:34,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:34,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:29:34,859 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:34,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904618008] [2022-12-14 07:29:34,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904618008] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:34,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:34,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:29:34,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002250396] [2022-12-14 07:29:34,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:34,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:34,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:34,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:34,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,861 INFO L87 Difference]: Start difference. First operand 153 states and 208 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:34,916 INFO L93 Difference]: Finished difference Result 393 states and 536 transitions. [2022-12-14 07:29:34,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:34,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-12-14 07:29:34,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:34,919 INFO L225 Difference]: With dead ends: 393 [2022-12-14 07:29:34,919 INFO L226 Difference]: Without dead ends: 241 [2022-12-14 07:29:34,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:34,921 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:34,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 113 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:34,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-12-14 07:29:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 227. [2022-12-14 07:29:34,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 191 states have (on average 1.3769633507853403) internal successors, (263), 194 states have internal predecessors, (263), 22 states have call successors, (22), 14 states have call predecessors, (22), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:29:34,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 305 transitions. [2022-12-14 07:29:34,952 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 305 transitions. Word has length 29 [2022-12-14 07:29:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:34,952 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 305 transitions. [2022-12-14 07:29:34,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-14 07:29:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 305 transitions. [2022-12-14 07:29:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-12-14 07:29:34,954 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:34,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:29:34,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:29:34,955 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:34,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 226736750, now seen corresponding path program 1 times [2022-12-14 07:29:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:34,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909950110] [2022-12-14 07:29:34,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:35,031 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:29:35,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:35,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909950110] [2022-12-14 07:29:35,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909950110] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:35,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:35,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:29:35,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996821688] [2022-12-14 07:29:35,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:35,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:35,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:35,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:35,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:35,034 INFO L87 Difference]: Start difference. First operand 227 states and 305 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:35,074 INFO L93 Difference]: Finished difference Result 390 states and 523 transitions. [2022-12-14 07:29:35,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:35,075 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), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2022-12-14 07:29:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:35,077 INFO L225 Difference]: With dead ends: 390 [2022-12-14 07:29:35,077 INFO L226 Difference]: Without dead ends: 232 [2022-12-14 07:29:35,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:35,080 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 32 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:35,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 145 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-12-14 07:29:35,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2022-12-14 07:29:35,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 185 states have (on average 1.345945945945946) internal successors, (249), 188 states have internal predecessors, (249), 22 states have call successors, (22), 14 states have call predecessors, (22), 13 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-12-14 07:29:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 291 transitions. [2022-12-14 07:29:35,110 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 291 transitions. Word has length 42 [2022-12-14 07:29:35,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:35,111 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 291 transitions. [2022-12-14 07:29:35,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 291 transitions. [2022-12-14 07:29:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-14 07:29:35,113 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:35,113 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:35,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:29:35,113 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:35,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:35,114 INFO L85 PathProgramCache]: Analyzing trace with hash -858400330, now seen corresponding path program 1 times [2022-12-14 07:29:35,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:35,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576076545] [2022-12-14 07:29:35,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:35,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:35,157 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 07:29:35,157 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:35,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576076545] [2022-12-14 07:29:35,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576076545] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:35,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:35,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:29:35,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495641386] [2022-12-14 07:29:35,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:35,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:35,160 INFO L87 Difference]: Start difference. First operand 221 states and 291 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:29:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:35,201 INFO L93 Difference]: Finished difference Result 470 states and 615 transitions. [2022-12-14 07:29:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:35,202 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), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-12-14 07:29:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:35,204 INFO L225 Difference]: With dead ends: 470 [2022-12-14 07:29:35,204 INFO L226 Difference]: Without dead ends: 267 [2022-12-14 07:29:35,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:29:35,206 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:35,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 112 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-12-14 07:29:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2022-12-14 07:29:35,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 224 states have (on average 1.3035714285714286) internal successors, (292), 227 states have internal predecessors, (292), 26 states have call successors, (26), 17 states have call predecessors, (26), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 07:29:35,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 342 transitions. [2022-12-14 07:29:35,226 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 342 transitions. Word has length 45 [2022-12-14 07:29:35,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:35,227 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 342 transitions. [2022-12-14 07:29:35,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:29:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 342 transitions. [2022-12-14 07:29:35,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-14 07:29:35,229 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:35,229 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:35,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:29:35,229 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:35,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:35,230 INFO L85 PathProgramCache]: Analyzing trace with hash 617778564, now seen corresponding path program 1 times [2022-12-14 07:29:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:35,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179411922] [2022-12-14 07:29:35,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:35,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:29:35,300 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:35,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179411922] [2022-12-14 07:29:35,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179411922] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:35,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:35,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:29:35,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857102825] [2022-12-14 07:29:35,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:35,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:29:35,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:35,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:29:35,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:29:35,303 INFO L87 Difference]: Start difference. First operand 267 states and 342 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:35,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:35,360 INFO L93 Difference]: Finished difference Result 307 states and 389 transitions. [2022-12-14 07:29:35,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:29:35,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 46 [2022-12-14 07:29:35,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:35,362 INFO L225 Difference]: With dead ends: 307 [2022-12-14 07:29:35,362 INFO L226 Difference]: Without dead ends: 304 [2022-12-14 07:29:35,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:29:35,364 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 114 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:35,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 110 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:35,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-12-14 07:29:35,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 266. [2022-12-14 07:29:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 224 states have (on average 1.2946428571428572) internal successors, (290), 226 states have internal predecessors, (290), 25 states have call successors, (25), 17 states have call predecessors, (25), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-12-14 07:29:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 339 transitions. [2022-12-14 07:29:35,385 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 339 transitions. Word has length 46 [2022-12-14 07:29:35,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:35,386 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 339 transitions. [2022-12-14 07:29:35,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 339 transitions. [2022-12-14 07:29:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-14 07:29:35,387 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:35,387 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:35,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:29:35,388 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:35,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:35,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1970942969, now seen corresponding path program 1 times [2022-12-14 07:29:35,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:35,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666025602] [2022-12-14 07:29:35,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:35,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:35,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:29:35,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:35,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666025602] [2022-12-14 07:29:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666025602] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:29:35,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390134962] [2022-12-14 07:29:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:35,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:35,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:35,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:29:35,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 07:29:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:35,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 07:29:35,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:29:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:29:35,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:29:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 07:29:35,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390134962] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:29:35,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [495558799] [2022-12-14 07:29:35,908 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-12-14 07:29:35,908 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:29:35,912 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:29:35,917 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:29:35,917 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:29:36,963 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 66 for LOIs [2022-12-14 07:29:36,970 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 147 for LOIs [2022-12-14 07:29:37,533 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:29:42,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [495558799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:42,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:29:42,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [4, 4, 4] total 31 [2022-12-14 07:29:42,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038023856] [2022-12-14 07:29:42,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:42,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 07:29:42,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:42,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 07:29:42,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=812, Unknown=0, NotChecked=0, Total=930 [2022-12-14 07:29:42,086 INFO L87 Difference]: Start difference. First operand 266 states and 339 transitions. Second operand has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:44,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:44,441 INFO L93 Difference]: Finished difference Result 572 states and 729 transitions. [2022-12-14 07:29:44,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-14 07:29:44,442 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2022-12-14 07:29:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:44,443 INFO L225 Difference]: With dead ends: 572 [2022-12-14 07:29:44,443 INFO L226 Difference]: Without dead ends: 307 [2022-12-14 07:29:44,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 108 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 07:29:44,444 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 28 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:44,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 432 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-12-14 07:29:44,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-14 07:29:44,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 294. [2022-12-14 07:29:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 249 states have (on average 1.2690763052208835) internal successors, (316), 251 states have internal predecessors, (316), 26 states have call successors, (26), 19 states have call predecessors, (26), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-12-14 07:29:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 367 transitions. [2022-12-14 07:29:44,462 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 367 transitions. Word has length 47 [2022-12-14 07:29:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:44,462 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 367 transitions. [2022-12-14 07:29:44,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 21 states have internal predecessors, (34), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 367 transitions. [2022-12-14 07:29:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-14 07:29:44,463 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:44,463 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:44,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:29:44,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:44,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:44,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:44,667 INFO L85 PathProgramCache]: Analyzing trace with hash -473088383, now seen corresponding path program 1 times [2022-12-14 07:29:44,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:44,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255982557] [2022-12-14 07:29:44,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:29:44,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:44,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255982557] [2022-12-14 07:29:44,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255982557] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:29:44,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558641599] [2022-12-14 07:29:44,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:44,789 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:29:44,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 07:29:44,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:44,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 07:29:44,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:29:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 07:29:44,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:29:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-14 07:29:45,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558641599] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:29:45,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [404463348] [2022-12-14 07:29:45,036 INFO L159 IcfgInterpreter]: Started Sifa with 39 locations of interest [2022-12-14 07:29:45,037 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:29:45,037 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:29:45,037 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:29:45,037 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:29:46,116 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 49 for LOIs [2022-12-14 07:29:46,121 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 147 for LOIs [2022-12-14 07:29:46,440 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:29:51,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [404463348] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:51,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:29:51,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [5, 4, 4] total 36 [2022-12-14 07:29:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44680501] [2022-12-14 07:29:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:51,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 07:29:51,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 07:29:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 07:29:51,479 INFO L87 Difference]: Start difference. First operand 294 states and 367 transitions. Second operand has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:55,936 INFO L93 Difference]: Finished difference Result 548 states and 695 transitions. [2022-12-14 07:29:55,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-14 07:29:55,937 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-12-14 07:29:55,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:55,940 INFO L225 Difference]: With dead ends: 548 [2022-12-14 07:29:55,940 INFO L226 Difference]: Without dead ends: 320 [2022-12-14 07:29:55,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 131 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2022-12-14 07:29:55,942 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1535 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:55,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 592 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1535 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-12-14 07:29:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-12-14 07:29:55,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 249. [2022-12-14 07:29:55,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 211 states have (on average 1.2654028436018958) internal successors, (267), 213 states have internal predecessors, (267), 22 states have call successors, (22), 16 states have call predecessors, (22), 15 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2022-12-14 07:29:55,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 310 transitions. [2022-12-14 07:29:55,978 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 310 transitions. Word has length 55 [2022-12-14 07:29:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:55,978 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 310 transitions. [2022-12-14 07:29:55,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 23 states have (on average 1.565217391304348) internal successors, (36), 23 states have internal predecessors, (36), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 07:29:55,979 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 310 transitions. [2022-12-14 07:29:55,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-12-14 07:29:55,980 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:55,980 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:55,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 07:29:56,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:56,182 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:56,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 627845419, now seen corresponding path program 1 times [2022-12-14 07:29:56,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:56,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438009676] [2022-12-14 07:29:56,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 07:29:56,315 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438009676] [2022-12-14 07:29:56,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438009676] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:29:56,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2038957916] [2022-12-14 07:29:56,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:56,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:56,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:56,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:29:56,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 07:29:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:56,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-14 07:29:56,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:29:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 07:29:56,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:29:56,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2038957916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:56,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:29:56,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-12-14 07:29:56,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508783819] [2022-12-14 07:29:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:56,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:56,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:29:56,385 INFO L87 Difference]: Start difference. First operand 249 states and 310 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:29:56,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:56,421 INFO L93 Difference]: Finished difference Result 425 states and 525 transitions. [2022-12-14 07:29:56,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:56,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 56 [2022-12-14 07:29:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:56,422 INFO L225 Difference]: With dead ends: 425 [2022-12-14 07:29:56,422 INFO L226 Difference]: Without dead ends: 181 [2022-12-14 07:29:56,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:29:56,423 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:56,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:56,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-12-14 07:29:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-12-14 07:29:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 153 states have (on average 1.2026143790849673) internal successors, (184), 154 states have internal predecessors, (184), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-12-14 07:29:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 215 transitions. [2022-12-14 07:29:56,439 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 215 transitions. Word has length 56 [2022-12-14 07:29:56,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:56,439 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 215 transitions. [2022-12-14 07:29:56,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:29:56,439 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 215 transitions. [2022-12-14 07:29:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 07:29:56,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:56,440 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:56,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 07:29:56,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:56,641 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:56,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:56,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1218544060, now seen corresponding path program 1 times [2022-12-14 07:29:56,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:56,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969924246] [2022-12-14 07:29:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:56,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 07:29:56,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969924246] [2022-12-14 07:29:56,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969924246] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:29:56,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742931762] [2022-12-14 07:29:56,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:56,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:56,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:56,672 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:29:56,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 07:29:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:56,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:29:56,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:29:56,745 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-14 07:29:56,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:29:56,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742931762] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:56,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 07:29:56,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-12-14 07:29:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739223540] [2022-12-14 07:29:56,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:56,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:29:56,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:29:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:29:56,747 INFO L87 Difference]: Start difference. First operand 181 states and 215 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:29:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:56,775 INFO L93 Difference]: Finished difference Result 283 states and 346 transitions. [2022-12-14 07:29:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:29:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2022-12-14 07:29:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:56,776 INFO L225 Difference]: With dead ends: 283 [2022-12-14 07:29:56,776 INFO L226 Difference]: Without dead ends: 168 [2022-12-14 07:29:56,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:29:56,777 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 40 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:56,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 122 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-12-14 07:29:56,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2022-12-14 07:29:56,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 140 states have (on average 1.1714285714285715) internal successors, (164), 140 states have internal predecessors, (164), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 07:29:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2022-12-14 07:29:56,792 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 60 [2022-12-14 07:29:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:56,792 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2022-12-14 07:29:56,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:29:56,793 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2022-12-14 07:29:56,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 07:29:56,793 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:56,794 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:56,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 07:29:56,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 07:29:56,995 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1645674494, now seen corresponding path program 1 times [2022-12-14 07:29:56,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:56,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717898388] [2022-12-14 07:29:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:56,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-12-14 07:29:57,120 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:57,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717898388] [2022-12-14 07:29:57,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717898388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:29:57,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:29:57,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:29:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844415222] [2022-12-14 07:29:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:29:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:29:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:29:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:29:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:29:57,124 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:29:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:29:57,193 INFO L93 Difference]: Finished difference Result 264 states and 315 transitions. [2022-12-14 07:29:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:29:57,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2022-12-14 07:29:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:29:57,194 INFO L225 Difference]: With dead ends: 264 [2022-12-14 07:29:57,194 INFO L226 Difference]: Without dead ends: 164 [2022-12-14 07:29:57,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:29:57,195 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 61 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:29:57,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 115 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:29:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-14 07:29:57,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-12-14 07:29:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 138 states have (on average 1.1521739130434783) internal successors, (159), 138 states have internal predecessors, (159), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-12-14 07:29:57,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2022-12-14 07:29:57,216 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 60 [2022-12-14 07:29:57,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:29:57,216 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2022-12-14 07:29:57,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-14 07:29:57,216 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2022-12-14 07:29:57,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-14 07:29:57,217 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:29:57,217 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 07:29:57,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:29:57,218 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:29:57,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:29:57,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1911972061, now seen corresponding path program 1 times [2022-12-14 07:29:57,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:29:57,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485586375] [2022-12-14 07:29:57,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:57,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:29:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:57,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:29:57,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:29:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485586375] [2022-12-14 07:29:57,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485586375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 07:29:57,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906047917] [2022-12-14 07:29:57,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:29:57,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:29:57,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:29:57,312 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 07:29:57,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 07:29:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:29:57,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-14 07:29:57,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:29:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 07:29:57,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 07:29:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-14 07:29:57,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906047917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 07:29:57,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [350876112] [2022-12-14 07:29:57,592 INFO L159 IcfgInterpreter]: Started Sifa with 42 locations of interest [2022-12-14 07:29:57,592 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 07:29:57,593 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 07:29:57,593 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 07:29:57,593 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 07:30:00,463 INFO L197 IcfgInterpreter]: Interpreting procedure error with input of size 55 for LOIs [2022-12-14 07:30:00,471 INFO L197 IcfgInterpreter]: Interpreting procedure exists_runnable_thread with input of size 75 for LOIs [2022-12-14 07:30:00,479 INFO L197 IcfgInterpreter]: Interpreting procedure immediate_notify_threads with input of size 45 for LOIs [2022-12-14 07:30:00,554 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 07:30:04,969 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '10527#(and (<= 0 ~p_dw_pc~0) (= ~q_free~0 1) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (= ~c_dr_pc~0 1) (= ~c_num_read~0 1) (not (= ~c_num_read~0 ~p_num_write~0)) (= ~q_write_ev~0 2) (= ~c_last_read~0 ~q_buf_0~0) (= ~q_read_ev~0 2) (= ~p_dw_i~0 1) (= |#NULL.offset| 0) (= ~c_last_read~0 ~p_last_write~0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-12-14 07:30:04,970 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 07:30:04,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 07:30:04,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-14 07:30:04,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588177374] [2022-12-14 07:30:04,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 07:30:04,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-14 07:30:04,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:30:04,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-14 07:30:04,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:30:04,971 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 07:30:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:30:05,064 INFO L93 Difference]: Finished difference Result 347 states and 398 transitions. [2022-12-14 07:30:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:30:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 61 [2022-12-14 07:30:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:30:05,065 INFO L225 Difference]: With dead ends: 347 [2022-12-14 07:30:05,066 INFO L226 Difference]: Without dead ends: 344 [2022-12-14 07:30:05,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 142 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 464 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 07:30:05,066 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 136 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:30:05,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 387 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:30:05,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-12-14 07:30:05,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 220. [2022-12-14 07:30:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 185 states have (on average 1.162162162162162) internal successors, (215), 186 states have internal predecessors, (215), 20 states have call successors, (20), 15 states have call predecessors, (20), 14 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-12-14 07:30:05,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 254 transitions. [2022-12-14 07:30:05,086 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 254 transitions. Word has length 61 [2022-12-14 07:30:05,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:30:05,086 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 254 transitions. [2022-12-14 07:30:05,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 6 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-14 07:30:05,086 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 254 transitions. [2022-12-14 07:30:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-14 07:30:05,086 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:30:05,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:30:05,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 07:30:05,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 07:30:05,287 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 07:30:05,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:30:05,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1016024744, now seen corresponding path program 2 times [2022-12-14 07:30:05,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:30:05,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392435915] [2022-12-14 07:30:05,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:30:05,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:30:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:30:05,310 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-14 07:30:05,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:30:05,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392435915] [2022-12-14 07:30:05,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392435915] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:30:05,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:30:05,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:30:05,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127650221] [2022-12-14 07:30:05,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:30:05,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:30:05,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:30:05,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:30:05,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:30:05,312 INFO L87 Difference]: Start difference. First operand 220 states and 254 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:30:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:30:05,353 INFO L93 Difference]: Finished difference Result 344 states and 397 transitions. [2022-12-14 07:30:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:30:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 74 [2022-12-14 07:30:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:30:05,354 INFO L225 Difference]: With dead ends: 344 [2022-12-14 07:30:05,354 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 07:30:05,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:30:05,356 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 07:30:05,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 112 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 07:30:05,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 07:30:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 07:30:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:30:05,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 07:30:05,357 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2022-12-14 07:30:05,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:30:05,357 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 07:30:05,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-14 07:30:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 07:30:05,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 07:30:05,360 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 07:30:05,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:30:05,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 07:30:11,102 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 67) no Hoare annotation was computed. [2022-12-14 07:30:11,102 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 51) no Hoare annotation was computed. [2022-12-14 07:30:11,102 INFO L899 garLoopResultBuilder]: For program point immediate_notify_threadsEXIT(lines 76 100) no Hoare annotation was computed. [2022-12-14 07:30:11,103 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 76 100) the Hoare annotation is: (let ((.cse23 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse23 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse10 (not (= (select |#valid| 0) 0))) (.cse11 (not (= (select .cse23 1) 0))) (.cse12 (not (= (select |#valid| 1) 1))) (.cse13 (not (= 19 (select |#length| 2)))) (.cse15 (not (= |#NULL.base| 0))) (.cse17 (not (= ~p_dw_i~0 1))) (.cse18 (not (= (select |#valid| 2) 1))) (.cse20 (not (<= ~p_last_write~0 2147483647))) (.cse22 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse16 (not (= ~q_write_ev~0 2))) (.cse19 (not (= ~q_free~0 1))) (.cse14 (<= 2 ~p_dw_st~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |old(~p_dw_st~0)| 2)) .cse11 (not (= ~p_dw_pc~0 1)) .cse12 .cse13 (and (<= ~p_dw_st~0 2) (<= 1 ~c_dr_st~0) (<= ~c_dr_st~0 1) .cse14) (not (= ~c_num_read~0 1)) .cse15 (not (= ~c_last_read~0 ~q_buf_0~0)) .cse16 .cse17 (not (<= 1 |old(~c_dr_st~0)|)) .cse18 .cse19 .cse20 .cse21 (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 .cse22 .cse10 .cse11 (not (<= ~c_last_read~0 0)) .cse12 .cse13 (not (<= ~q_free~0 0)) .cse15 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse17 .cse18 (and (<= ~c_dr_st~0 0) (<= 1 ~p_dw_st~0) (<= 0 ~c_dr_st~0) (<= ~p_dw_st~0 1)) (not (<= 0 ~q_free~0)) .cse20 (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|))) (or (not (<= 2 |old(~p_dw_st~0)|)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse22 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_dr_pc~0 1)) .cse16 .cse19 .cse14 .cse21)))) [2022-12-14 07:30:11,103 INFO L899 garLoopResultBuilder]: For program point L42-2(lines 42 51) no Hoare annotation was computed. [2022-12-14 07:30:11,103 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-12-14 07:30:11,103 INFO L899 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-12-14 07:30:11,104 INFO L895 garLoopResultBuilder]: At program point L53(lines 41 55) the Hoare annotation is: (let ((.cse23 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse23 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse11 (not (= (select |#valid| 0) 0))) (.cse12 (not (= (select .cse23 1) 0))) (.cse13 (not (= (select |#valid| 1) 1))) (.cse14 (not (= 19 (select |#length| 2)))) (.cse15 (not (= |#NULL.base| 0))) (.cse16 (not (= ~p_dw_i~0 1))) (.cse17 (not (= (select |#valid| 2) 1))) (.cse18 (not (<= ~p_last_write~0 2147483647))) (.cse10 (not (= ~p_last_write~0 ~q_buf_0~0))) (.cse19 (not (= ~q_write_ev~0 2))) (.cse20 (not (= ~q_free~0 1))) (.cse22 (<= 2 ~p_dw_st~0)) (.cse21 (not (= ~c_last_read~0 ~p_last_write~0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 .cse10 .cse11 .cse12 (not (<= ~c_last_read~0 0)) .cse13 .cse14 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (<= 1 ~p_dw_st~0) (= ~c_dr_st~0 |old(~c_dr_st~0)|) (<= ~p_dw_st~0 1)) (not (<= ~q_free~0 0)) .cse15 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse16 .cse17 (not (<= 0 ~q_free~0)) .cse18 (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|))) (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse11 (not (= |old(~p_dw_st~0)| 2)) .cse12 (not (= ~p_dw_pc~0 1)) .cse13 .cse14 (not (= ~c_num_read~0 1)) .cse15 (not (= ~c_last_read~0 ~q_buf_0~0)) .cse19 .cse16 (not (<= 1 |old(~c_dr_st~0)|)) .cse17 .cse20 .cse18 .cse21 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 1) (<= ~p_dw_st~0 2) (<= 1 ~c_dr_st~0) (<= ~c_dr_st~0 1) .cse22) (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or (not (<= 2 |old(~p_dw_st~0)|)) (not (<= ~c_num_read~0 ~p_num_write~0)) .cse10 (not (<= ~p_num_write~0 ~c_num_read~0)) (not (= ~c_dr_pc~0 1)) .cse19 .cse20 .cse22 .cse21)))) [2022-12-14 07:30:11,104 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 48) no Hoare annotation was computed. [2022-12-14 07:30:11,105 INFO L895 garLoopResultBuilder]: At program point L72(lines 60 74) the Hoare annotation is: (let ((.cse21 (select |#memory_int| 1))) (let ((.cse0 (not (= ~a_t~0 0))) (.cse1 (not (= (select .cse21 0) 48))) (.cse2 (not (= |#NULL.offset| 0))) (.cse3 (not (= ~p_num_write~0 1))) (.cse4 (not (= 2 (select |#length| 1)))) (.cse5 (not (= ~c_dr_pc~0 0))) (.cse6 (not (< 0 |#StackHeapBarrier|))) (.cse7 (not (= (select |#valid| 3) 1))) (.cse8 (not (<= 0 (+ ~q_buf_0~0 2147483648)))) (.cse9 (not (= (select |#length| 3) 12))) (.cse10 (not (= (select |#valid| 0) 0))) (.cse11 (not (= (select .cse21 1) 0))) (.cse12 (not (= (select |#valid| 1) 1))) (.cse13 (not (= 19 (select |#length| 2)))) (.cse14 (not (= |#NULL.base| 0))) (.cse15 (not (= ~p_dw_i~0 1))) (.cse16 (not (= (select |#valid| 2) 1))) (.cse17 (not (<= ~p_last_write~0 2147483647))) (.cse18 (= ~c_dr_st~0 |old(~c_dr_st~0)|)) (.cse19 (= |immediate_notify_threads_is_do_read_c_triggered_~__retres1~1#1| 0)) (.cse20 (= |immediate_notify_threads_is_do_write_p_triggered_#res#1| |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1|))) (and (or .cse0 (not (= ~q_read_ev~0 1)) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not (= |old(~p_dw_st~0)| 2)) .cse11 (not (= ~p_dw_pc~0 1)) .cse12 .cse13 (not (= ~c_num_read~0 1)) .cse14 (not (= ~c_last_read~0 ~q_buf_0~0)) (not (= ~q_write_ev~0 2)) .cse15 (not (<= 1 |old(~c_dr_st~0)|)) .cse16 (not (= ~q_free~0 1)) .cse17 (and (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 1) (= |immediate_notify_threads_~tmp~0#1| |immediate_notify_threads_is_do_write_p_triggered_#res#1|) .cse18 .cse19 .cse20 (= ~p_dw_st~0 0)) (not (= ~c_last_read~0 ~p_last_write~0)) (not (<= |old(~c_dr_st~0)| 1)) (not (= 1 ~c_dr_i~0))) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (not (<= 1 ~c_dr_i~0)) .cse8 (not (= ~p_dw_pc~0 0)) .cse9 (not (= ~p_last_write~0 ~q_buf_0~0)) .cse10 .cse11 (not (<= ~c_last_read~0 0)) .cse12 .cse13 (not (<= ~q_free~0 0)) .cse14 (not (<= ~c_dr_i~0 1)) (not (<= ~c_num_read~0 0)) (not (<= 0 ~c_num_read~0)) (not (= |old(~p_dw_st~0)| 1)) (not (= ~q_write_ev~0 1)) .cse15 .cse16 (not (<= 0 ~q_free~0)) .cse17 (and (= |old(~p_dw_st~0)| ~p_dw_st~0) (= |immediate_notify_threads_is_do_write_p_triggered_~__retres1~0#1| 0) (= |immediate_notify_threads_~tmp~0#1| 0) .cse18 .cse19 .cse20) (not (<= 0 ~c_last_read~0)) (not (= ~q_read_ev~0 2)) (not (<= |old(~c_dr_st~0)| 0)) (not (<= 0 |old(~c_dr_st~0)|)))))) [2022-12-14 07:30:11,105 INFO L899 garLoopResultBuilder]: For program point exists_runnable_threadEXIT(lines 220 239) no Hoare annotation was computed. [2022-12-14 07:30:11,105 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 220 239) the Hoare annotation is: true [2022-12-14 07:30:11,105 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-12-14 07:30:11,105 INFO L895 garLoopResultBuilder]: At program point L192-1(lines 160 195) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_write_ev~0 2))) (or (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) (= ~q_free~0 1) (<= ~p_num_write~0 ~c_num_read~0) .cse1 (= ~c_last_read~0 ~p_last_write~0)) (let ((.cse2 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~c_num_read~0 0) (not (= |ULTIMATE.start_eval_~tmp___0~1#1| 0)) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (<= 0 (+ |ULTIMATE.start_eval_~tmp___0~1#1| 2147483648)) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= ~q_free~0 0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |ULTIMATE.start_eval_~tmp___0~1#1| 2147483647) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse1 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) (= ~c_dr_st~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))))) [2022-12-14 07:30:11,105 INFO L899 garLoopResultBuilder]: For program point L250(line 250) no Hoare annotation was computed. [2022-12-14 07:30:11,105 INFO L899 garLoopResultBuilder]: For program point L118(lines 117 137) no Hoare annotation was computed. [2022-12-14 07:30:11,106 INFO L895 garLoopResultBuilder]: At program point L300(line 300) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-12-14 07:30:11,106 INFO L895 garLoopResultBuilder]: At program point L300-1(line 300) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-12-14 07:30:11,106 INFO L895 garLoopResultBuilder]: At program point do_write_p_returnLabel#1(lines 101 143) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse2 (= ~q_write_ev~0 2))) (or (let ((.cse3 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (= ~c_dr_pc~0 1) .cse2 (<= .cse3 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse3))) (let ((.cse4 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse2 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))))) [2022-12-14 07:30:11,106 INFO L895 garLoopResultBuilder]: At program point L152(lines 152 156) the Hoare annotation is: (let ((.cse0 (+ ~c_num_read~0 1))) (and (= ~p_last_write~0 ~q_buf_0~0) (= ~q_free~0 0) (= ~c_dr_pc~0 1) (= ~q_write_ev~0 2) (<= .cse0 ~p_num_write~0) (<= 2 ~p_dw_st~0) (<= ~p_num_write~0 .cse0))) [2022-12-14 07:30:11,107 INFO L895 garLoopResultBuilder]: At program point L119(lines 119 127) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_write_ev~0 2))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~p_last_write~0 0) (= ~q_free~0 1) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= ~q_read_ev~0 2) .cse1 (= ~p_dw_st~0 1) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (<= 2 ~q_read_ev~0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse1))) [2022-12-14 07:30:11,107 INFO L902 garLoopResultBuilder]: At program point start_simulation_returnLabel#1(lines 313 341) the Hoare annotation is: true [2022-12-14 07:30:11,107 INFO L899 garLoopResultBuilder]: For program point L276(lines 276 283) no Hoare annotation was computed. [2022-12-14 07:30:11,107 INFO L899 garLoopResultBuilder]: For program point L161(lines 160 195) no Hoare annotation was computed. [2022-12-14 07:30:11,107 INFO L895 garLoopResultBuilder]: At program point do_read_c_returnLabel#1(lines 145 201) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1))) (or (and .cse0 .cse1 .cse2 (<= 2 ~p_dw_st~0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) (= ~q_write_ev~0 2)))) [2022-12-14 07:30:11,107 INFO L899 garLoopResultBuilder]: For program point L252(lines 252 256) no Hoare annotation was computed. [2022-12-14 07:30:11,107 INFO L899 garLoopResultBuilder]: For program point L252-1(lines 247 287) no Hoare annotation was computed. [2022-12-14 07:30:11,107 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2022-12-14 07:30:11,107 INFO L899 garLoopResultBuilder]: For program point L261(lines 261 268) no Hoare annotation was computed. [2022-12-14 07:30:11,108 INFO L899 garLoopResultBuilder]: For program point L162-1(lines 162 172) no Hoare annotation was computed. [2022-12-14 07:30:11,108 INFO L895 garLoopResultBuilder]: At program point L187(line 187) the Hoare annotation is: false [2022-12-14 07:30:11,108 INFO L895 garLoopResultBuilder]: At program point L179(line 179) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 1)) (.cse2 (= ~q_write_ev~0 2)) (.cse3 (= ~c_last_read~0 ~p_last_write~0))) (or (let ((.cse4 (select |#memory_int| 1))) (and (= (select |#length| 3) 12) (not (= |ULTIMATE.start_eval_~tmp___0~1#1| 0)) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= |ULTIMATE.start_do_read_c_~a~0#1| ~q_buf_0~0) (<= 0 (+ |ULTIMATE.start_eval_~tmp___0~1#1| 2147483648)) .cse1 (= ~q_read_ev~0 1) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= ~c_num_read~0 1) (<= |ULTIMATE.start_eval_~tmp___0~1#1| 2147483647) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_pc~0 1) .cse2 (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= 2 ~p_dw_st~0) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) .cse3 (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse4 0) 48) (= (select .cse4 1) 0) (= ~c_dr_st~0 1) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (and .cse0 (<= ~c_num_read~0 ~p_num_write~0) .cse1 (<= ~p_num_write~0 ~c_num_read~0) (= ~c_dr_pc~0 1) .cse2 .cse3 (<= 2 ~p_dw_st~0)))) [2022-12-14 07:30:11,108 INFO L899 garLoopResultBuilder]: For program point L179-1(line 179) no Hoare annotation was computed. [2022-12-14 07:30:11,108 INFO L895 garLoopResultBuilder]: At program point eval_returnLabel#1(lines 240 293) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse5 (= ~c_dr_pc~0 1)) (.cse4 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) (= ~c_last_read~0 0) (<= 0 ~p_num_write~0) (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse4 (<= ~q_free~0 1) (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) (<= 2 ~q_read_ev~0) (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse5 .cse4) (let ((.cse6 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse5 .cse4 (<= .cse6 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse6))))) [2022-12-14 07:30:11,109 INFO L899 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-12-14 07:30:11,109 INFO L895 garLoopResultBuilder]: At program point L272(lines 247 287) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse4 (<= 0 ~p_dw_pc~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (<= ~q_read_ev~0 2)) (.cse7 (<= ~q_free~0 1)) (.cse8 (<= 2 ~q_read_ev~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (select |#memory_int| 1))) (and (<= ~p_last_write~0 0) (<= 1 ~p_dw_i~0) (<= 1 ~q_free~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= (select |#length| 3) 12) (<= ~p_num_write~0 0) (<= ~c_dr_st~0 0) (<= 0 ~q_buf_0~0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= 0 ~p_last_write~0) (<= ~p_dw_pc~0 0) (<= ~c_dr_i~0 1) .cse4 .cse5 (<= ~a_t~0 0) (<= 2 ~q_write_ev~0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= 0 ~c_dr_st~0) .cse6 .cse7 (<= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 ~a_t~0) (<= |#NULL.base| 0) (= (select |#valid| 0) 0) .cse8 (= (select |#valid| 2) 1) (<= ~c_dr_pc~0 0) (= (select .cse9 0) 48) (<= 0 |#NULL.offset|) (= (select .cse9 1) 0) (<= 0 ~c_num_read~0) (<= ~q_buf_0~0 0) (<= 0 ~c_last_read~0) (< 0 |#StackHeapBarrier|))) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 .cse4 (= ~c_last_read~0 0) .cse5 (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) .cse6 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse7 (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) .cse8 (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse10 .cse11 (<= .cse12 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse12))))) [2022-12-14 07:30:11,109 INFO L899 garLoopResultBuilder]: For program point L330(lines 330 334) no Hoare annotation was computed. [2022-12-14 07:30:11,109 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 07:30:11,110 INFO L895 garLoopResultBuilder]: At program point L248(line 248) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse2 (= ~q_free~0 1)) (.cse4 (<= 0 ~p_dw_pc~0)) (.cse5 (<= 0 ~p_num_write~0)) (.cse6 (<= ~q_read_ev~0 2)) (.cse7 (<= ~q_free~0 1)) (.cse8 (<= 2 ~q_read_ev~0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse10 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2)) (.cse3 (<= 2 ~p_dw_st~0))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse9 (select |#memory_int| 1))) (and (<= ~p_last_write~0 0) (<= 1 ~p_dw_i~0) (<= 1 ~q_free~0) (<= 1 |ULTIMATE.start_start_simulation_~kernel_st~0#1|) (= (select |#length| 3) 12) (<= ~p_num_write~0 0) (<= ~c_dr_st~0 0) (<= 0 ~q_buf_0~0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= 1 ~c_dr_i~0) (<= 0 ~c_dr_pc~0) (<= ~c_num_read~0 0) (<= ~c_last_read~0 0) (<= 0 ~p_last_write~0) (<= ~p_dw_pc~0 0) (<= ~c_dr_i~0 1) .cse4 .cse5 (<= ~a_t~0 0) (<= 2 ~q_write_ev~0) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= |#NULL.offset| 0) (<= ~p_dw_i~0 1) (<= 0 ~c_dr_st~0) .cse6 .cse7 (<= ~q_write_ev~0 2) (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (<= 0 ~a_t~0) (<= |#NULL.base| 0) (= (select |#valid| 0) 0) .cse8 (= (select |#valid| 2) 1) (<= ~c_dr_pc~0 0) (= (select .cse9 0) 48) (<= 0 |#NULL.offset|) (= (select .cse9 1) 0) (<= 0 ~c_num_read~0) (<= ~q_buf_0~0 0) (<= 0 ~c_last_read~0) (< 0 |#StackHeapBarrier|))) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse10 .cse11) (and (<= 0 ~q_free~0) (= ~c_num_read~0 0) (<= ~p_dw_pc~0 1) .cse1 .cse4 (= ~c_last_read~0 0) .cse5 (= 1 ~c_dr_i~0) (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) .cse6 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse7 (= ~c_dr_pc~0 0) (= ~p_dw_i~0 1) .cse8 (= |#NULL.offset| 0) (<= ~p_last_write~0 2147483647) (= ~a_t~0 0) .cse3 (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0)) (let ((.cse12 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse10 .cse11 (<= .cse12 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse12))))) [2022-12-14 07:30:11,110 INFO L899 garLoopResultBuilder]: For program point L182(lines 182 194) no Hoare annotation was computed. [2022-12-14 07:30:11,110 INFO L899 garLoopResultBuilder]: For program point L149(lines 149 157) no Hoare annotation was computed. [2022-12-14 07:30:11,110 INFO L899 garLoopResultBuilder]: For program point L257(lines 247 287) no Hoare annotation was computed. [2022-12-14 07:30:11,110 INFO L895 garLoopResultBuilder]: At program point L323-2(lines 323 335) the Hoare annotation is: (let ((.cse0 (= ~c_dr_st~0 2)) (.cse13 (= ~c_dr_pc~0 1)) (.cse3 (<= 2 ~p_dw_st~0)) (.cse4 (= ~c_num_read~0 0)) (.cse1 (= ~p_last_write~0 ~q_buf_0~0)) (.cse2 (= ~q_free~0 1)) (.cse5 (= ~c_last_read~0 0)) (.cse6 (= 1 ~c_dr_i~0)) (.cse7 (= ~q_write_ev~0 2)) (.cse8 (= ~c_dr_pc~0 0)) (.cse9 (= ~p_dw_i~0 1)) (.cse10 (= |#NULL.offset| 0)) (.cse11 (= ~a_t~0 0)) (.cse12 (= |#NULL.base| 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 0 ~q_free~0) .cse4 (<= ~p_dw_pc~0 1) .cse1 (<= 0 ~p_dw_pc~0) .cse5 (<= 0 ~p_num_write~0) .cse6 (<= ~p_dw_st~0 2) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) (<= ~p_num_write~0 1) (<= ~q_read_ev~0 2) (<= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (<= 0 (+ ~q_buf_0~0 2147483648)) .cse7 (<= ~q_free~0 1) .cse8 .cse9 (<= 2 ~q_read_ev~0) .cse10 (<= ~p_last_write~0 2147483647) (<= 0 |ULTIMATE.start_eval_~tmp___1~0#1|) .cse11 .cse3 (<= 0 |#StackHeapBarrier|) .cse12) (and .cse0 .cse1 (<= ~c_num_read~0 ~p_num_write~0) .cse2 (<= ~p_num_write~0 ~c_num_read~0) .cse13 .cse7) (let ((.cse14 (+ ~c_num_read~0 1))) (and .cse1 (= ~q_free~0 0) .cse13 .cse7 (<= .cse14 ~p_num_write~0) .cse3 (<= ~p_num_write~0 .cse14))) (let ((.cse15 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= ~p_num_write~0 0) (= (select |#length| 3) 12) .cse4 .cse1 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 0) (= ~q_write_ev~0 ~q_read_ev~0) .cse2 .cse5 .cse6 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) .cse7 (= ~p_dw_st~0 0) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) .cse8 .cse9 (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) .cse10 (= ~c_last_read~0 ~p_last_write~0) .cse11 (= (select .cse15 0) 48) (= (select .cse15 1) 0) (< 0 |#StackHeapBarrier|) .cse12)))) [2022-12-14 07:30:11,111 INFO L899 garLoopResultBuilder]: For program point L183(lines 183 189) no Hoare annotation was computed. [2022-12-14 07:30:11,111 INFO L895 garLoopResultBuilder]: At program point L117-1(lines 117 137) the Hoare annotation is: (let ((.cse30 (select |#memory_int| 1))) (let ((.cse5 (= ~q_free~0 1)) (.cse0 (= ~p_dw_pc~0 0)) (.cse1 (= (select |#length| 3) 12)) (.cse2 (= ~c_num_read~0 0)) (.cse4 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647)) (.cse6 (= ~c_last_read~0 0)) (.cse7 (= 1 ~c_dr_i~0)) (.cse8 (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1)) (.cse9 (= 2 (select |#length| 1))) (.cse10 (= (select |#valid| 3) 1)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= 19 (select |#length| 2))) (.cse14 (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648))) (.cse15 (= ~c_dr_pc~0 0)) (.cse16 (not (= |ULTIMATE.start_eval_~tmp~1#1| 0))) (.cse17 (= ~p_dw_i~0 1)) (.cse18 (= (select |#valid| 0) 0)) (.cse19 (= (select |#valid| 2) 1)) (.cse20 (= |#NULL.offset| 0)) (.cse21 (= ~a_t~0 0)) (.cse22 (= |ULTIMATE.start_eval_~tmp___1~0#1| 1)) (.cse23 (= (select .cse30 0) 48)) (.cse24 (= (select .cse30 1) 0)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0)) (.cse3 (= ~p_last_write~0 ~q_buf_0~0)) (.cse28 (= ~q_free~0 0)) (.cse27 (= ~c_dr_pc~0 1)) (.cse11 (= ~q_write_ev~0 2))) (or (and .cse0 (= ~c_dr_st~0 0) (= ~p_num_write~0 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (<= ~q_read_ev~0 2) .cse11 (= ~p_dw_st~0 1) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 2 ~q_read_ev~0) .cse19 .cse20 (= ~c_last_read~0 ~p_last_write~0) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (and (= ~c_dr_st~0 2) .cse3 (<= ~c_num_read~0 ~p_num_write~0) .cse5 (<= ~p_num_write~0 ~c_num_read~0) .cse27 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 ~p_dw_st~0) .cse6 .cse7 (<= ~p_dw_st~0 2) .cse8 .cse28 .cse9 .cse10 (<= 0 (+ ~q_buf_0~0 2147483648)) .cse11 .cse12 .cse13 (= ~q_read_ev~0 2) .cse14 .cse15 .cse16 .cse17 .cse18 (= ~p_num_write~0 1) .cse19 .cse20 (<= ~p_last_write~0 2147483647) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26) (let ((.cse29 (+ ~c_num_read~0 1))) (and .cse3 .cse28 .cse27 .cse11 (<= .cse29 ~p_num_write~0) (<= ~p_num_write~0 .cse29)))))) [2022-12-14 07:30:11,111 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 113) no Hoare annotation was computed. [2022-12-14 07:30:11,111 INFO L895 garLoopResultBuilder]: At program point L134(line 134) the Hoare annotation is: (let ((.cse0 (= ~p_last_write~0 ~q_buf_0~0)) (.cse1 (= ~q_free~0 0)) (.cse3 (= ~q_write_ev~0 1))) (or (let ((.cse2 (select |#memory_int| 1))) (and (= ~p_dw_pc~0 0) (= ~c_dr_st~0 0) (= (select |#length| 3) 12) (= ~c_num_read~0 0) (<= ~q_buf_0~0 2147483647) .cse0 (<= |ULTIMATE.start_eval_~tmp~1#1| 2147483647) (= ~c_last_read~0 0) (= 1 ~c_dr_i~0) (= |ULTIMATE.start_start_simulation_~kernel_st~0#1| 1) .cse1 (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (<= 0 (+ ~q_buf_0~0 2147483648)) (= ~p_dw_st~0 1) (= (select |#valid| 1) 1) (= 19 (select |#length| 2)) (= ~q_read_ev~0 2) (<= 0 (+ |ULTIMATE.start_eval_~tmp~1#1| 2147483648)) (= ~c_dr_pc~0 0) (not (= |ULTIMATE.start_eval_~tmp~1#1| 0)) (= ~p_dw_i~0 1) (= (select |#valid| 0) 0) (= ~p_num_write~0 1) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= ~a_t~0 0) (= |ULTIMATE.start_eval_~tmp___1~0#1| 1) (= (select .cse2 0) 48) (= (select .cse2 1) 0) .cse3 (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) (let ((.cse4 (+ ~c_num_read~0 1))) (and .cse0 .cse1 (= ~c_dr_pc~0 1) (<= .cse4 ~p_num_write~0) (<= ~p_num_write~0 .cse4) .cse3)))) [2022-12-14 07:30:11,111 INFO L899 garLoopResultBuilder]: For program point L134-1(line 134) no Hoare annotation was computed. [2022-12-14 07:30:11,112 INFO L899 garLoopResultBuilder]: For program point errorEXIT(lines 15 22) no Hoare annotation was computed. [2022-12-14 07:30:11,112 INFO L902 garLoopResultBuilder]: At program point ERROR(lines 15 22) the Hoare annotation is: true [2022-12-14 07:30:11,112 INFO L899 garLoopResultBuilder]: For program point errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2022-12-14 07:30:11,115 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:30:11,116 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:30:11,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:30:11 BoogieIcfgContainer [2022-12-14 07:30:11,151 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:30:11,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:30:11,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:30:11,152 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:30:11,152 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:29:34" (3/4) ... [2022-12-14 07:30:11,155 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 07:30:11,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure immediate_notify_threads [2022-12-14 07:30:11,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure exists_runnable_thread [2022-12-14 07:30:11,161 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2022-12-14 07:30:11,166 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-12-14 07:30:11,167 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-12-14 07:30:11,167 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-14 07:30:11,167 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 07:30:11,193 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || (((__retres1 == 0 && 1 <= p_dw_st) && c_dr_st == \old(c_dr_st)) && p_dw_st <= 1)) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) && (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || !(c_last_read == p_last_write)) || ((((__retres1 == 1 && p_dw_st <= 2) && 1 <= c_dr_st) && c_dr_st <= 1) && 2 <= p_dw_st)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i))) && ((((((((!(2 <= \old(p_dw_st)) || !(c_num_read <= p_num_write)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc == 1)) || !(q_write_ev == 2)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write)) [2022-12-14 07:30:11,193 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || (((((__retres1 == 1 && tmp == \result) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1) && p_dw_st == 0)) || !(c_last_read == p_last_write)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i)) && (((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || (((((\old(p_dw_st) == p_dw_st && __retres1 == 0) && tmp == 0) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) [2022-12-14 07:30:11,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 07:30:11,218 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:30:11,218 INFO L158 Benchmark]: Toolchain (without parser) took 37669.76ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 134.0MB in the beginning and 110.4MB in the end (delta: 23.6MB). Peak memory consumption was 152.1MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,218 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 111.1MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:30:11,219 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.18ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 122.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.58ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,219 INFO L158 Benchmark]: Boogie Preprocessor took 17.55ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,220 INFO L158 Benchmark]: RCFGBuilder took 401.88ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 96.0MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,220 INFO L158 Benchmark]: TraceAbstraction took 36954.04ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 95.3MB in the beginning and 115.6MB in the end (delta: -20.3MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,220 INFO L158 Benchmark]: Witness Printer took 65.93ms. Allocated memory is still 293.6MB. Free memory was 115.6MB in the beginning and 110.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 07:30:11,222 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.15ms. Allocated memory is still 111.1MB. Free memory is still 84.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.18ms. Allocated memory is still 167.8MB. Free memory was 134.0MB in the beginning and 122.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.58ms. Allocated memory is still 167.8MB. Free memory was 122.1MB in the beginning and 120.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.55ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 118.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.88ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 96.0MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36954.04ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 95.3MB in the beginning and 115.6MB in the end (delta: -20.3MB). Peak memory consumption was 137.6MB. Max. memory is 16.1GB. * Witness Printer took 65.93ms. Allocated memory is still 293.6MB. Free memory was 115.6MB in the beginning and 110.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: 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 4 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 703 mSDsluCounter, 2606 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1664 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2957 IncrementalHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 942 mSDtfsCounter, 2957 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 671 GetRequests, 517 SyntacticMatches, 16 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=294occurred in iteration=7, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 281 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 339 PreInvPairs, 411 NumberOfFragments, 3468 HoareAnnotationTreeSize, 339 FomulaSimplifications, 482 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 23 FomulaSimplificationsInter, 14990 FormulaSimplificationTreeSizeReductionInter, 5.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 909 NumberOfCodeBlocks, 909 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1051 ConstructedInterpolants, 0 QuantifiedInterpolants, 3340 SizeOfPredicates, 6 NumberOfNonLiveVariables, 1147 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 229/304 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: OVERALL_TIME: 3.0s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 6, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 90, DAG_INTERPRETER_EARLY_EXITS: 7, TOOLS_POST_APPLICATIONS: 135, TOOLS_POST_TIME: 1.5s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 0.4s, TOOLS_POST_RETURN_APPLICATIONS: 30, TOOLS_POST_RETURN_TIME: 0.5s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 192, TOOLS_QUANTIFIERELIM_TIME: 2.3s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 281, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 36, DOMAIN_JOIN_TIME: 0.4s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 3, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 10, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 90, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 7, LOOP_SUMMARIZER_CACHE_MISSES: 7, LOOP_SUMMARIZER_OVERALL_TIME: 0.9s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.9s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 10, CALL_SUMMARIZER_APPLICATIONS: 30, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 2061, DAG_COMPRESSION_RETAINED_NODES: 238, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 119]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && p_last_write == 0) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_read_ev <= 2) && q_write_ev == 2) && p_dw_st == 1) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && #NULL == 0) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) - InvariantResult [Line: 145]: Loop Invariant Derived loop invariant: (((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || (((__retres1 == 0 && 1 <= p_dw_st) && c_dr_st == \old(c_dr_st)) && p_dw_st <= 1)) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) && (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || !(c_last_read == p_last_write)) || ((((__retres1 == 1 && p_dw_st <= 2) && 1 <= c_dr_st) && c_dr_st <= 1) && 2 <= p_dw_st)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i))) && ((((((((!(2 <= \old(p_dw_st)) || !(c_num_read <= p_num_write)) || !(p_last_write == q_buf_0)) || !(p_num_write <= c_num_read)) || !(c_dr_pc == 1)) || !(q_write_ev == 2)) || !(q_free == 1)) || 2 <= p_dw_st) || !(c_last_read == p_last_write)) - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1)) || (((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && kernel_st == 0) && q_write_ev == q_read_ev) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_write_ev == 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && c_dr_pc == 0) && p_dw_i == 1) && \valid[0] == 0) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((!(a_t == 0) || !(q_read_ev == 1)) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(0 <= q_buf_0 + 2147483648)) || !(unknown-#length-unknown[3] == 12)) || !(\valid[0] == 0)) || !(\old(p_dw_st) == 2)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(p_dw_pc == 1)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(c_num_read == 1)) || !(#NULL == 0)) || !(c_last_read == q_buf_0)) || !(q_write_ev == 2)) || !(p_dw_i == 1)) || !(1 <= \old(c_dr_st))) || !(\valid[2] == 1)) || !(q_free == 1)) || !(p_last_write <= 2147483647)) || (((((__retres1 == 1 && tmp == \result) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1) && p_dw_st == 0)) || !(c_last_read == p_last_write)) || !(\old(c_dr_st) <= 1)) || !(1 == c_dr_i)) && (((((((((((((((((((((((((((((((((!(a_t == 0) || !(unknown-#memory_int-unknown[1][0] == 48)) || !(#NULL == 0)) || !(p_num_write == 1)) || !(2 == unknown-#length-unknown[1])) || !(c_dr_pc == 0)) || !(0 < unknown-#StackHeapBarrier-unknown)) || !(\valid[3] == 1)) || !(1 <= c_dr_i)) || !(0 <= q_buf_0 + 2147483648)) || !(p_dw_pc == 0)) || !(unknown-#length-unknown[3] == 12)) || !(p_last_write == q_buf_0)) || !(\valid[0] == 0)) || !(unknown-#memory_int-unknown[1][1] == 0)) || !(c_last_read <= 0)) || !(\valid[1] == 1)) || !(19 == unknown-#length-unknown[2])) || !(q_free <= 0)) || !(#NULL == 0)) || !(c_dr_i <= 1)) || !(c_num_read <= 0)) || !(0 <= c_num_read)) || !(\old(p_dw_st) == 1)) || !(q_write_ev == 1)) || !(p_dw_i == 1)) || !(\valid[2] == 1)) || !(0 <= q_free)) || !(p_last_write <= 2147483647)) || (((((\old(p_dw_st) == p_dw_st && __retres1 == 0) && tmp == 0) && c_dr_st == \old(c_dr_st)) && __retres1 == 0) && \result == __retres1)) || !(0 <= c_last_read)) || !(q_read_ev == 2)) || !(\old(c_dr_st) <= 0)) || !(0 <= \old(c_dr_st))) - InvariantResult [Line: 247]: Loop Invariant Derived loop invariant: ((((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || ((((((((((((((((((((((((((((((((((((((((((((p_last_write <= 0 && 1 <= p_dw_i) && 1 <= q_free) && 1 <= kernel_st) && unknown-#length-unknown[3] == 12) && p_num_write <= 0) && c_dr_st <= 0) && 0 <= q_buf_0) && 0 <= #NULL) && kernel_st <= 1) && 1 <= c_dr_i) && 0 <= c_dr_pc) && c_num_read <= 0) && c_last_read <= 0) && 0 <= p_last_write) && p_dw_pc <= 0) && c_dr_i <= 1) && 0 <= p_dw_pc) && 0 <= p_num_write) && a_t <= 0) && 2 <= q_write_ev) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && #NULL <= 0) && p_dw_i <= 1) && 0 <= c_dr_st) && q_read_ev <= 2) && q_free <= 1) && q_write_ev <= 2) && p_dw_st == 0) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= a_t) && #NULL <= 0) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && c_dr_pc <= 0) && unknown-#memory_int-unknown[1][0] == 48) && 0 <= #NULL) && unknown-#memory_int-unknown[1][1] == 0) && 0 <= c_num_read) && q_buf_0 <= 0) && 0 <= c_last_read) && 0 < unknown-#StackHeapBarrier-unknown)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || (((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((p_dw_pc == 0 && c_dr_st == 0) && p_num_write == 0) && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && q_free == 1) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && q_read_ev <= 2) && q_write_ev == 2) && p_dw_st == 1) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && 2 <= q_read_ev) && \valid[2] == 1) && #NULL == 0) && c_last_read == p_last_write) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((((((((((((((((((((((((((((p_dw_pc == 0 && unknown-#length-unknown[3] == 12) && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && 0 <= p_dw_st) && c_last_read == 0) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || (((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0 && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && q_write_ev == 2) && c_last_read == p_last_write) || (((((((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && c_num_read == 0) && !(tmp___0 == 0)) && p_last_write == q_buf_0) && tmp <= 2147483647) && 0 <= tmp___0 + 2147483648) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && tmp___0 <= 2147483647) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && 2 == p_dw_st) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && c_dr_st == 1) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 300]: Loop Invariant Derived loop invariant: (((((c_dr_st == 2 && p_last_write == q_buf_0) && q_free == 1) && 2 <= p_dw_st) || (((((((((((((((((((((((((0 <= q_free && c_num_read == 0) && p_dw_pc <= 1) && p_last_write == q_buf_0) && 0 <= p_dw_pc) && c_last_read == 0) && 0 <= p_num_write) && 1 == c_dr_i) && p_dw_st <= 2) && kernel_st == 1) && p_num_write <= 1) && q_read_ev <= 2) && tmp___1 <= 1) && 0 <= q_buf_0 + 2147483648) && q_write_ev == 2) && q_free <= 1) && c_dr_pc == 0) && p_dw_i == 1) && 2 <= q_read_ev) && #NULL == 0) && p_last_write <= 2147483647) && 0 <= tmp___1) && a_t == 0) && 2 <= p_dw_st) && 0 <= unknown-#StackHeapBarrier-unknown) && #NULL == 0)) || ((((((c_dr_st == 2 && p_last_write == q_buf_0) && c_num_read <= p_num_write) && q_free == 1) && p_num_write <= c_num_read) && c_dr_pc == 1) && q_write_ev == 2)) || ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: ((((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1) || (((((((((((((((((((((((((((((((unknown-#length-unknown[3] == 12 && c_num_read == 0) && p_last_write == q_buf_0) && tmp <= 2147483647) && c_last_read == 0) && 1 == c_dr_i) && kernel_st == 1) && q_free == 0) && 2 == unknown-#length-unknown[1]) && \valid[3] == 1) && 0 <= q_buf_0 + 2147483648) && p_dw_pc == 1) && q_write_ev == 2) && \valid[1] == 1) && 19 == unknown-#length-unknown[2]) && q_read_ev == 2) && 0 <= tmp + 2147483648) && c_dr_pc == 0) && !(tmp == 0)) && 2 == p_dw_st) && p_dw_i == 1) && \valid[0] == 0) && p_num_write == 1) && \valid[2] == 1) && #NULL == 0) && p_last_write <= 2147483647) && a_t == 0) && tmp___1 == 1) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#memory_int-unknown[1][1] == 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((p_last_write == q_buf_0 && q_free == 0) && c_dr_pc == 1) && q_write_ev == 2) && c_num_read + 1 <= p_num_write) && 2 <= p_dw_st) && p_num_write <= c_num_read + 1 - InvariantResult [Line: 220]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-12-14 07:30:11,251 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_451f0041-4cae-4968-a0f3-96462ace1f53/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE