./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:17,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:17,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:17,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:17,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:17,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:17,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:17,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:17,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:17,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:17,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:17,208 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:17,208 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:17,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:17,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:17,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:17,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:17,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:17,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:17,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:17,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:17,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:17,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:17,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:17,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:17,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:17,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:17,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:17,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:17,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:17,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:17,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:17,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:17,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:17,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:17,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:17,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:17,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:17,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:17,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:17,257 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:17,259 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:51:17,301 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:17,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:17,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:17,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:17,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:17,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:17,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:17,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:17,306 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:17,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:17,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:17,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:17,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:17,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:17,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:17,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:17,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:17,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:17,310 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:17,310 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:17,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:17,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:17,311 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:17,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:17,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:17,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:17,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:17,312 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:17,313 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:17,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:17,313 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:17,313 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:17,314 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:17,314 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_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2022-11-02 20:51:17,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:17,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:17,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:17,645 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:17,646 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:17,647 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-02 20:51:17,738 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/data/c8b3f6cc5/4732d90f28d7422eb02c5712fd687f72/FLAG448fb95d4 [2022-11-02 20:51:18,362 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:18,363 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/sv-benchmarks/c/pthread/queue_ok.i [2022-11-02 20:51:18,376 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/data/c8b3f6cc5/4732d90f28d7422eb02c5712fd687f72/FLAG448fb95d4 [2022-11-02 20:51:18,608 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/data/c8b3f6cc5/4732d90f28d7422eb02c5712fd687f72 [2022-11-02 20:51:18,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:18,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:18,614 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:18,614 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:18,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:18,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:18" (1/1) ... [2022-11-02 20:51:18,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69074d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:18, skipping insertion in model container [2022-11-02 20:51:18,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:18" (1/1) ... [2022-11-02 20:51:18,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:18,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:19,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-02 20:51:19,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-02 20:51:19,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:19,205 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:19,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-02 20:51:19,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-02 20:51:19,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:19,324 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:19,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19 WrapperNode [2022-11-02 20:51:19,325 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:19,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:19,327 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:19,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:19,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,374 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,427 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 204 [2022-11-02 20:51:19,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:19,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:19,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:19,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:19,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,486 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,488 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,491 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:19,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:19,492 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:19,492 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:19,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (1/1) ... [2022-11-02 20:51:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:19,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:19,533 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:19,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-02 20:51:19,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-02 20:51:19,570 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-02 20:51:19,570 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-02 20:51:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:51:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:51:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:51:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:51:19,571 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-02 20:51:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:19,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:19,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:19,574 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-02 20:51:19,717 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:19,719 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:20,171 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:20,181 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:20,181 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:51:20,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:20 BoogieIcfgContainer [2022-11-02 20:51:20,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:20,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:20,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:20,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:20,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:18" (1/3) ... [2022-11-02 20:51:20,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb6482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:20, skipping insertion in model container [2022-11-02 20:51:20,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:19" (2/3) ... [2022-11-02 20:51:20,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57fb6482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:20, skipping insertion in model container [2022-11-02 20:51:20,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:20" (3/3) ... [2022-11-02 20:51:20,198 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-02 20:51:20,207 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-02 20:51:20,217 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:20,218 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:51:20,218 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-02 20:51:20,327 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-02 20:51:20,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 231 transitions, 478 flow [2022-11-02 20:51:20,499 INFO L130 PetriNetUnfolder]: 13/229 cut-off events. [2022-11-02 20:51:20,500 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:51:20,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 13/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 372 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-02 20:51:20,506 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 231 transitions, 478 flow [2022-11-02 20:51:20,513 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 219 transitions, 447 flow [2022-11-02 20:51:20,523 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:20,530 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@e3966fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:20,530 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-02 20:51:20,544 INFO L130 PetriNetUnfolder]: 1/64 cut-off events. [2022-11-02 20:51:20,545 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-02 20:51:20,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:20,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:20,546 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:20,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:20,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1145000913, now seen corresponding path program 1 times [2022-11-02 20:51:20,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:20,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013685418] [2022-11-02 20:51:20,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:20,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:20,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:20,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013685418] [2022-11-02 20:51:20,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013685418] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:20,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:20,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:51:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761572751] [2022-11-02 20:51:20,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:20,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:51:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:20,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:51:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:51:20,955 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 231 [2022-11-02 20:51:20,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 219 transitions, 447 flow. Second operand has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:20,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:20,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 231 [2022-11-02 20:51:20,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:21,095 INFO L130 PetriNetUnfolder]: 9/210 cut-off events. [2022-11-02 20:51:21,095 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-02 20:51:21,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 210 events. 9/210 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 272 event pairs, 0 based on Foata normal form. 5/205 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-11-02 20:51:21,103 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 3 selfloop transitions, 0 changer transitions 0/210 dead transitions. [2022-11-02 20:51:21,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 210 transitions, 435 flow [2022-11-02 20:51:21,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:51:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-02 20:51:21,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 447 transitions. [2022-11-02 20:51:21,127 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9675324675324676 [2022-11-02 20:51:21,128 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 447 transitions. [2022-11-02 20:51:21,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 447 transitions. [2022-11-02 20:51:21,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:21,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 447 transitions. [2022-11-02 20:51:21,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 223.5) internal successors, (447), 2 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,159 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,162 INFO L175 Difference]: Start difference. First operand has 213 places, 219 transitions, 447 flow. Second operand 2 states and 447 transitions. [2022-11-02 20:51:21,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 210 transitions, 435 flow [2022-11-02 20:51:21,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 210 transitions, 430 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-02 20:51:21,172 INFO L231 Difference]: Finished difference. Result has 206 places, 210 transitions, 424 flow [2022-11-02 20:51:21,174 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=424, PETRI_PLACES=206, PETRI_TRANSITIONS=210} [2022-11-02 20:51:21,178 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -7 predicate places. [2022-11-02 20:51:21,178 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 210 transitions, 424 flow [2022-11-02 20:51:21,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 220.5) internal successors, (441), 2 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:21,179 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:21,179 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:21,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:21,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:21,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:21,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1194749697, now seen corresponding path program 1 times [2022-11-02 20:51:21,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:21,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662516243] [2022-11-02 20:51:21,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:21,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:22,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:22,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662516243] [2022-11-02 20:51:22,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662516243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:22,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:22,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 20:51:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947930391] [2022-11-02 20:51:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:22,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:51:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:22,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:51:22,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:51:22,486 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 231 [2022-11-02 20:51:22,489 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 210 transitions, 424 flow. Second operand has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:22,489 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:22,495 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 231 [2022-11-02 20:51:22,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:23,615 INFO L130 PetriNetUnfolder]: 611/2582 cut-off events. [2022-11-02 20:51:23,616 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-02 20:51:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3514 conditions, 2582 events. 611/2582 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 20434 event pairs, 459 based on Foata normal form. 0/2410 useless extension candidates. Maximal degree in co-relation 3511. Up to 882 conditions per place. [2022-11-02 20:51:23,636 INFO L137 encePairwiseOnDemand]: 218/231 looper letters, 42 selfloop transitions, 12 changer transitions 0/206 dead transitions. [2022-11-02 20:51:23,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 206 transitions, 524 flow [2022-11-02 20:51:23,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:51:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-02 20:51:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2213 transitions. [2022-11-02 20:51:23,644 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.736929736929737 [2022-11-02 20:51:23,644 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2213 transitions. [2022-11-02 20:51:23,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2213 transitions. [2022-11-02 20:51:23,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:23,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2213 transitions. [2022-11-02 20:51:23,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 170.23076923076923) internal successors, (2213), 13 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,662 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,663 INFO L175 Difference]: Start difference. First operand has 206 places, 210 transitions, 424 flow. Second operand 13 states and 2213 transitions. [2022-11-02 20:51:23,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 206 transitions, 524 flow [2022-11-02 20:51:23,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 206 transitions, 524 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-02 20:51:23,674 INFO L231 Difference]: Finished difference. Result has 215 places, 206 transitions, 440 flow [2022-11-02 20:51:23,675 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=440, PETRI_PLACES=215, PETRI_TRANSITIONS=206} [2022-11-02 20:51:23,676 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 2 predicate places. [2022-11-02 20:51:23,676 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 206 transitions, 440 flow [2022-11-02 20:51:23,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 169.25) internal successors, (2031), 12 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:23,678 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:23,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:23,679 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:23,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash -933293975, now seen corresponding path program 1 times [2022-11-02 20:51:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:23,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656141804] [2022-11-02 20:51:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:23,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:23,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:23,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656141804] [2022-11-02 20:51:23,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656141804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:23,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:23,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295605964] [2022-11-02 20:51:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:23,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:23,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:23,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:23,969 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 231 [2022-11-02 20:51:23,971 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 206 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:23,971 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:23,971 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 231 [2022-11-02 20:51:23,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:24,036 INFO L130 PetriNetUnfolder]: 16/307 cut-off events. [2022-11-02 20:51:24,037 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-02 20:51:24,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 307 events. 16/307 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 688 event pairs, 2 based on Foata normal form. 0/291 useless extension candidates. Maximal degree in co-relation 346. Up to 12 conditions per place. [2022-11-02 20:51:24,039 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 7 selfloop transitions, 2 changer transitions 5/209 dead transitions. [2022-11-02 20:51:24,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 209 transitions, 473 flow [2022-11-02 20:51:24,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:24,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-11-02 20:51:24,043 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-11-02 20:51:24,043 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:24,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,050 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,050 INFO L175 Difference]: Start difference. First operand has 215 places, 206 transitions, 440 flow. Second operand 3 states and 655 transitions. [2022-11-02 20:51:24,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 209 transitions, 473 flow [2022-11-02 20:51:24,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 209 transitions, 450 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-02 20:51:24,056 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 419 flow [2022-11-02 20:51:24,056 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-02 20:51:24,059 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-11-02 20:51:24,059 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 419 flow [2022-11-02 20:51:24,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,060 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:24,060 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:24,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:24,061 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:24,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:24,061 INFO L85 PathProgramCache]: Analyzing trace with hash 464408434, now seen corresponding path program 1 times [2022-11-02 20:51:24,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:24,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551472420] [2022-11-02 20:51:24,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:24,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:24,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551472420] [2022-11-02 20:51:24,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551472420] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:24,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:24,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:24,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499742141] [2022-11-02 20:51:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:24,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:24,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:24,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:24,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:24,202 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 231 [2022-11-02 20:51:24,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 419 flow. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,204 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:24,204 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 231 [2022-11-02 20:51:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:24,293 INFO L130 PetriNetUnfolder]: 20/336 cut-off events. [2022-11-02 20:51:24,294 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-02 20:51:24,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 336 events. 20/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 671 event pairs, 6 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 401. Up to 24 conditions per place. [2022-11-02 20:51:24,296 INFO L137 encePairwiseOnDemand]: 228/231 looper letters, 13 selfloop transitions, 2 changer transitions 1/208 dead transitions. [2022-11-02 20:51:24,296 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 208 transitions, 461 flow [2022-11-02 20:51:24,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:24,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:24,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2022-11-02 20:51:24,299 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9451659451659452 [2022-11-02 20:51:24,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:24,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2022-11-02 20:51:24,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,309 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,310 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 419 flow. Second operand 3 states and 655 transitions. [2022-11-02 20:51:24,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 208 transitions, 461 flow [2022-11-02 20:51:24,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 208 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-02 20:51:24,314 INFO L231 Difference]: Finished difference. Result has 207 places, 203 transitions, 425 flow [2022-11-02 20:51:24,315 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=425, PETRI_PLACES=207, PETRI_TRANSITIONS=203} [2022-11-02 20:51:24,318 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, -6 predicate places. [2022-11-02 20:51:24,318 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 203 transitions, 425 flow [2022-11-02 20:51:24,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:24,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:24,319 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:24,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:24,320 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:24,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:24,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1789731816, now seen corresponding path program 1 times [2022-11-02 20:51:24,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:24,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772597272] [2022-11-02 20:51:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:24,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772597272] [2022-11-02 20:51:24,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772597272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683696881] [2022-11-02 20:51:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:24,536 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:24,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:51:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:24,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 20:51:24,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:24,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:25,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:25,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683696881] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:25,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:25,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-02 20:51:25,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514840197] [2022-11-02 20:51:25,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:51:25,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:51:25,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:25,009 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:51:25,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 203 transitions, 425 flow. Second operand has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:25,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:51:25,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:25,182 INFO L130 PetriNetUnfolder]: 30/423 cut-off events. [2022-11-02 20:51:25,182 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-02 20:51:25,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 423 events. 30/423 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 684 event pairs, 4 based on Foata normal form. 4/416 useless extension candidates. Maximal degree in co-relation 537. Up to 19 conditions per place. [2022-11-02 20:51:25,186 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 20 selfloop transitions, 9 changer transitions 0/220 dead transitions. [2022-11-02 20:51:25,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 220 transitions, 533 flow [2022-11-02 20:51:25,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:51:25,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-02 20:51:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1939 transitions. [2022-11-02 20:51:25,191 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9326599326599326 [2022-11-02 20:51:25,191 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1939 transitions. [2022-11-02 20:51:25,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1939 transitions. [2022-11-02 20:51:25,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:25,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1939 transitions. [2022-11-02 20:51:25,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 215.44444444444446) internal successors, (1939), 9 states have internal predecessors, (1939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,203 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,203 INFO L175 Difference]: Start difference. First operand has 207 places, 203 transitions, 425 flow. Second operand 9 states and 1939 transitions. [2022-11-02 20:51:25,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 220 transitions, 533 flow [2022-11-02 20:51:25,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 220 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:25,209 INFO L231 Difference]: Finished difference. Result has 216 places, 209 transitions, 473 flow [2022-11-02 20:51:25,210 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=473, PETRI_PLACES=216, PETRI_TRANSITIONS=209} [2022-11-02 20:51:25,213 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 3 predicate places. [2022-11-02 20:51:25,214 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 209 transitions, 473 flow [2022-11-02 20:51:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 214.2) internal successors, (2142), 10 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:25,218 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:25,260 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:25,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:25,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:25,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,448 INFO L85 PathProgramCache]: Analyzing trace with hash -146638564, now seen corresponding path program 2 times [2022-11-02 20:51:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90119185] [2022-11-02 20:51:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:25,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-11-02 20:51:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90119185] [2022-11-02 20:51:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90119185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:25,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:25,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:51:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662887420] [2022-11-02 20:51:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:25,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:25,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:25,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:25,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:51:25,796 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 231 [2022-11-02 20:51:25,797 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 209 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,797 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:25,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 231 [2022-11-02 20:51:25,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:25,950 INFO L130 PetriNetUnfolder]: 25/611 cut-off events. [2022-11-02 20:51:25,950 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-02 20:51:25,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733 conditions, 611 events. 25/611 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1286 event pairs, 3 based on Foata normal form. 2/596 useless extension candidates. Maximal degree in co-relation 725. Up to 19 conditions per place. [2022-11-02 20:51:25,953 INFO L137 encePairwiseOnDemand]: 227/231 looper letters, 12 selfloop transitions, 3 changer transitions 3/211 dead transitions. [2022-11-02 20:51:25,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 512 flow [2022-11-02 20:51:25,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-02 20:51:25,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 645 transitions. [2022-11-02 20:51:25,957 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9307359307359307 [2022-11-02 20:51:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 645 transitions. [2022-11-02 20:51:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 645 transitions. [2022-11-02 20:51:25,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:25,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 645 transitions. [2022-11-02 20:51:25,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.0) internal successors, (645), 3 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,962 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,962 INFO L175 Difference]: Start difference. First operand has 216 places, 209 transitions, 473 flow. Second operand 3 states and 645 transitions. [2022-11-02 20:51:25,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 512 flow [2022-11-02 20:51:25,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 506 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:25,971 INFO L231 Difference]: Finished difference. Result has 217 places, 206 transitions, 467 flow [2022-11-02 20:51:25,972 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-11-02 20:51:25,975 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 4 predicate places. [2022-11-02 20:51:25,975 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 467 flow [2022-11-02 20:51:25,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:25,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:25,976 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:25,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:25,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:25,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1143464642, now seen corresponding path program 1 times [2022-11-02 20:51:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:25,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260149023] [2022-11-02 20:51:25,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:25,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:26,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:26,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260149023] [2022-11-02 20:51:26,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260149023] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:26,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655018002] [2022-11-02 20:51:26,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:26,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:26,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:26,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:26,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:51:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:26,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:51:26,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:26,757 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:26,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:27,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655018002] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:27,005 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:27,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-02 20:51:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966319179] [2022-11-02 20:51:27,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:51:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:27,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:51:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:51:27,014 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:51:27,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 467 flow. Second operand has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:27,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:51:27,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:27,456 INFO L130 PetriNetUnfolder]: 58/747 cut-off events. [2022-11-02 20:51:27,456 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-02 20:51:27,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 747 events. 58/747 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1390 event pairs, 4 based on Foata normal form. 8/736 useless extension candidates. Maximal degree in co-relation 1047. Up to 39 conditions per place. [2022-11-02 20:51:27,461 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 40 selfloop transitions, 21 changer transitions 1/249 dead transitions. [2022-11-02 20:51:27,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 249 transitions, 765 flow [2022-11-02 20:51:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:51:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-02 20:51:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4517 transitions. [2022-11-02 20:51:27,473 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9311482168625026 [2022-11-02 20:51:27,473 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4517 transitions. [2022-11-02 20:51:27,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4517 transitions. [2022-11-02 20:51:27,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:27,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4517 transitions. [2022-11-02 20:51:27,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 215.0952380952381) internal successors, (4517), 21 states have internal predecessors, (4517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,503 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 231.0) internal successors, (5082), 22 states have internal predecessors, (5082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,503 INFO L175 Difference]: Start difference. First operand has 217 places, 206 transitions, 467 flow. Second operand 21 states and 4517 transitions. [2022-11-02 20:51:27,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 249 transitions, 765 flow [2022-11-02 20:51:27,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 249 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-02 20:51:27,511 INFO L231 Difference]: Finished difference. Result has 238 places, 218 transitions, 592 flow [2022-11-02 20:51:27,512 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=592, PETRI_PLACES=238, PETRI_TRANSITIONS=218} [2022-11-02 20:51:27,512 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 25 predicate places. [2022-11-02 20:51:27,513 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 218 transitions, 592 flow [2022-11-02 20:51:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 214.33333333333334) internal successors, (3858), 18 states have internal predecessors, (3858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:27,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:27,515 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:27,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:27,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:27,731 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:27,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:27,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1330324832, now seen corresponding path program 2 times [2022-11-02 20:51:27,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:27,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334668] [2022-11-02 20:51:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:27,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:27,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334668] [2022-11-02 20:51:28,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334668] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:28,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539465208] [2022-11-02 20:51:28,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:51:28,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:28,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:28,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:28,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:51:28,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:51:28,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:51:28,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 769 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:51:28,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:29,344 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:29,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:29,975 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 0 proven. 658 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:29,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539465208] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:29,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:29,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-02 20:51:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019813278] [2022-11-02 20:51:29,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:29,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:51:29,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:51:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:51:29,993 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:51:30,016 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 218 transitions, 592 flow. Second operand has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:30,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:30,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:51:30,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:51:31,162 INFO L130 PetriNetUnfolder]: 114/1393 cut-off events. [2022-11-02 20:51:31,163 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-11-02 20:51:31,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1393 events. 114/1393 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2795 event pairs, 4 based on Foata normal form. 16/1374 useless extension candidates. Maximal degree in co-relation 2155. Up to 79 conditions per place. [2022-11-02 20:51:31,172 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 80 selfloop transitions, 45 changer transitions 0/312 dead transitions. [2022-11-02 20:51:31,173 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 312 transitions, 1330 flow [2022-11-02 20:51:31,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-02 20:51:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-02 20:51:31,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9673 transitions. [2022-11-02 20:51:31,194 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9305435305435306 [2022-11-02 20:51:31,194 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9673 transitions. [2022-11-02 20:51:31,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9673 transitions. [2022-11-02 20:51:31,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:51:31,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9673 transitions. [2022-11-02 20:51:31,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 214.95555555555555) internal successors, (9673), 45 states have internal predecessors, (9673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,284 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 231.0) internal successors, (10626), 46 states have internal predecessors, (10626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,284 INFO L175 Difference]: Start difference. First operand has 238 places, 218 transitions, 592 flow. Second operand 45 states and 9673 transitions. [2022-11-02 20:51:31,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 312 transitions, 1330 flow [2022-11-02 20:51:31,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 312 transitions, 1290 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-02 20:51:31,296 INFO L231 Difference]: Finished difference. Result has 284 places, 243 transitions, 870 flow [2022-11-02 20:51:31,296 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=870, PETRI_PLACES=284, PETRI_TRANSITIONS=243} [2022-11-02 20:51:31,297 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 71 predicate places. [2022-11-02 20:51:31,297 INFO L495 AbstractCegarLoop]: Abstraction has has 284 places, 243 transitions, 870 flow [2022-11-02 20:51:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 214.41176470588235) internal successors, (7290), 34 states have internal predecessors, (7290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:31,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:51:31,301 INFO L208 CegarLoopForPetriNet]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:31,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:31,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:31,515 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:51:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:31,516 INFO L85 PathProgramCache]: Analyzing trace with hash 681727648, now seen corresponding path program 3 times [2022-11-02 20:51:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:31,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23165127] [2022-11-02 20:51:31,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:31,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:31,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:34,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:34,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23165127] [2022-11-02 20:51:34,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23165127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:34,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481315458] [2022-11-02 20:51:34,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:51:34,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:34,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:34,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:34,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:51:34,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:51:34,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:51:34,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:51:34,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:36,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:51:36,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:36,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:51:37,058 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:51:37,071 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-02 20:51:37,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-02 20:51:37,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:51:37,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:51:37,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:51:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 455 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 0 not checked. [2022-11-02 20:51:37,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:51:45,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_775 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|) (+ 84 |c_~#queue~0.offset|)) 20)) is different from false [2022-11-02 20:51:45,572 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:45,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:51:45,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:51:45,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:51:45,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-02 20:51:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 377 proven. 319 refuted. 0 times theorem prover too weak. 2496 trivial. 78 not checked. [2022-11-02 20:51:46,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481315458] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:51:46,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:51:46,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 12, 12] total 53 [2022-11-02 20:51:46,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628411269] [2022-11-02 20:51:46,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:51:46,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-02 20:51:46,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:46,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-02 20:51:46,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2291, Unknown=1, NotChecked=100, Total=2756 [2022-11-02 20:51:46,658 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-11-02 20:51:46,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 243 transitions, 870 flow. Second operand has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:51:46,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:51:46,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-11-02 20:51:46,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:00,915 INFO L130 PetriNetUnfolder]: 2125/7558 cut-off events. [2022-11-02 20:52:00,915 INFO L131 PetriNetUnfolder]: For 2826/2826 co-relation queries the response was YES. [2022-11-02 20:52:00,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7558 events. 2125/7558 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40055 event pairs, 33 based on Foata normal form. 8/7466 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-11-02 20:52:00,988 INFO L137 encePairwiseOnDemand]: 210/231 looper letters, 871 selfloop transitions, 372 changer transitions 0/1379 dead transitions. [2022-11-02 20:52:00,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1379 transitions, 6630 flow [2022-11-02 20:52:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2022-11-02 20:52:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2022-11-02 20:52:01,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 30418 transitions. [2022-11-02 20:52:01,042 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.727511898782617 [2022-11-02 20:52:01,043 INFO L72 ComplementDD]: Start complementDD. Operand 181 states and 30418 transitions. [2022-11-02 20:52:01,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 181 states and 30418 transitions. [2022-11-02 20:52:01,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:01,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 181 states and 30418 transitions. [2022-11-02 20:52:01,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 182 states, 181 states have (on average 168.05524861878453) internal successors, (30418), 181 states have internal predecessors, (30418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:01,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:01,211 INFO L81 ComplementDD]: Finished complementDD. Result has 182 states, 182 states have (on average 231.0) internal successors, (42042), 182 states have internal predecessors, (42042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:01,212 INFO L175 Difference]: Start difference. First operand has 284 places, 243 transitions, 870 flow. Second operand 181 states and 30418 transitions. [2022-11-02 20:52:01,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1379 transitions, 6630 flow [2022-11-02 20:52:01,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 1379 transitions, 6515 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-11-02 20:52:01,258 INFO L231 Difference]: Finished difference. Result has 515 places, 648 transitions, 3382 flow [2022-11-02 20:52:01,259 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=181, PETRI_FLOW=3382, PETRI_PLACES=515, PETRI_TRANSITIONS=648} [2022-11-02 20:52:01,260 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 302 predicate places. [2022-11-02 20:52:01,260 INFO L495 AbstractCegarLoop]: Abstraction has has 515 places, 648 transitions, 3382 flow [2022-11-02 20:52:01,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 168.9245283018868) internal successors, (8953), 53 states have internal predecessors, (8953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:01,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:01,263 INFO L208 CegarLoopForPetriNet]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:01,303 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:01,479 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:52:01,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1049680381, now seen corresponding path program 1 times [2022-11-02 20:52:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721851484] [2022-11-02 20:52:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:01,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:03,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721851484] [2022-11-02 20:52:03,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721851484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:03,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572336899] [2022-11-02 20:52:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:03,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:03,998 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:04,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:52:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 1380 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:52:04,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:05,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 3694 backedges. 0 proven. 3694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:06,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572336899] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:06,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:06,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-11-02 20:52:06,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804797239] [2022-11-02 20:52:06,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:52:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:52:06,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-02 20:52:06,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 231 [2022-11-02 20:52:06,447 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 648 transitions, 3382 flow. Second operand has 43 states, 43 states have (on average 214.53488372093022) internal successors, (9225), 43 states have internal predecessors, (9225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:06,447 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:06,447 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 231 [2022-11-02 20:52:06,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:10,359 INFO L130 PetriNetUnfolder]: 589/5096 cut-off events. [2022-11-02 20:52:10,359 INFO L131 PetriNetUnfolder]: For 64988/64988 co-relation queries the response was YES. [2022-11-02 20:52:10,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16043 conditions, 5096 events. 589/5096 cut-off events. For 64988/64988 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 22773 event pairs, 7 based on Foata normal form. 24/5112 useless extension candidates. Maximal degree in co-relation 15950. Up to 316 conditions per place. [2022-11-02 20:52:10,424 INFO L137 encePairwiseOnDemand]: 225/231 looper letters, 105 selfloop transitions, 110 changer transitions 0/756 dead transitions. [2022-11-02 20:52:10,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 756 transitions, 4444 flow [2022-11-02 20:52:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-02 20:52:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-11-02 20:52:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12889 transitions. [2022-11-02 20:52:10,439 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.92994227994228 [2022-11-02 20:52:10,439 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12889 transitions. [2022-11-02 20:52:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12889 transitions. [2022-11-02 20:52:10,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:10,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12889 transitions. [2022-11-02 20:52:10,465 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 214.81666666666666) internal successors, (12889), 60 states have internal predecessors, (12889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 231.0) internal successors, (14091), 61 states have internal predecessors, (14091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,481 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 231.0) internal successors, (14091), 61 states have internal predecessors, (14091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,481 INFO L175 Difference]: Start difference. First operand has 515 places, 648 transitions, 3382 flow. Second operand 60 states and 12889 transitions. [2022-11-02 20:52:10,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 756 transitions, 4444 flow [2022-11-02 20:52:10,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 756 transitions, 4264 flow, removed 4 selfloop flow, removed 45 redundant places. [2022-11-02 20:52:10,694 INFO L231 Difference]: Finished difference. Result has 534 places, 663 transitions, 3640 flow [2022-11-02 20:52:10,695 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3202, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3640, PETRI_PLACES=534, PETRI_TRANSITIONS=663} [2022-11-02 20:52:10,695 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 321 predicate places. [2022-11-02 20:52:10,696 INFO L495 AbstractCegarLoop]: Abstraction has has 534 places, 663 transitions, 3640 flow [2022-11-02 20:52:10,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 214.53488372093022) internal successors, (9225), 43 states have internal predecessors, (9225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:10,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:10,698 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:10,722 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:10,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:52:10,899 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:52:10,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1622382637, now seen corresponding path program 2 times [2022-11-02 20:52:10,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:10,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036417007] [2022-11-02 20:52:10,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:10,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5856 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 5475 trivial. 0 not checked. [2022-11-02 20:52:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036417007] [2022-11-02 20:52:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036417007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:15,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:15,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-02 20:52:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227374643] [2022-11-02 20:52:15,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:15,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:52:15,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:15,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:52:15,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:52:15,782 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-11-02 20:52:15,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 663 transitions, 3640 flow. Second operand has 17 states, 17 states have (on average 164.8235294117647) internal successors, (2802), 17 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:15,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:15,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-11-02 20:52:15,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:21,608 INFO L130 PetriNetUnfolder]: 2093/8378 cut-off events. [2022-11-02 20:52:21,609 INFO L131 PetriNetUnfolder]: For 90164/90164 co-relation queries the response was YES. [2022-11-02 20:52:21,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27693 conditions, 8378 events. 2093/8378 cut-off events. For 90164/90164 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 43669 event pairs, 1290 based on Foata normal form. 4/8347 useless extension candidates. Maximal degree in co-relation 27596. Up to 4581 conditions per place. [2022-11-02 20:52:21,712 INFO L137 encePairwiseOnDemand]: 214/231 looper letters, 405 selfloop transitions, 22 changer transitions 0/676 dead transitions. [2022-11-02 20:52:21,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 676 transitions, 4649 flow [2022-11-02 20:52:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:52:21,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-02 20:52:21,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2499 transitions. [2022-11-02 20:52:21,718 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7212121212121212 [2022-11-02 20:52:21,718 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2499 transitions. [2022-11-02 20:52:21,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2499 transitions. [2022-11-02 20:52:21,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:52:21,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2499 transitions. [2022-11-02 20:52:21,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 166.6) internal successors, (2499), 15 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:21,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:21,731 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 231.0) internal successors, (3696), 16 states have internal predecessors, (3696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:21,731 INFO L175 Difference]: Start difference. First operand has 534 places, 663 transitions, 3640 flow. Second operand 15 states and 2499 transitions. [2022-11-02 20:52:21,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 676 transitions, 4649 flow [2022-11-02 20:52:22,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 498 places, 676 transitions, 4413 flow, removed 21 selfloop flow, removed 49 redundant places. [2022-11-02 20:52:22,094 INFO L231 Difference]: Finished difference. Result has 504 places, 667 transitions, 3625 flow [2022-11-02 20:52:22,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3372, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=637, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3625, PETRI_PLACES=504, PETRI_TRANSITIONS=667} [2022-11-02 20:52:22,096 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 291 predicate places. [2022-11-02 20:52:22,097 INFO L495 AbstractCegarLoop]: Abstraction has has 504 places, 667 transitions, 3625 flow [2022-11-02 20:52:22,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 164.8235294117647) internal successors, (2802), 17 states have internal predecessors, (2802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:22,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:52:22,098 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:22,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:52:22,099 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:52:22,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:22,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2047461956, now seen corresponding path program 3 times [2022-11-02 20:52:22,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:22,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420693056] [2022-11-02 20:52:22,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1644 proven. 623 refuted. 0 times theorem prover too weak. 3623 trivial. 0 not checked. [2022-11-02 20:52:35,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:35,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420693056] [2022-11-02 20:52:35,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420693056] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:35,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623780947] [2022-11-02 20:52:35,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:52:35,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:35,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:35,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:35,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:52:36,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-02 20:52:36,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:52:36,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-02 20:52:36,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:39,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:52:39,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:39,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:52:39,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:39,753 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-02 20:52:39,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-02 20:52:39,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:39,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:52:40,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-02 20:52:40,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:40,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:52:40,529 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:52:40,544 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-02 20:52:40,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-02 20:52:40,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:52:40,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:52:40,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:52:40,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1132 proven. 440 refuted. 0 times theorem prover too weak. 4318 trivial. 0 not checked. [2022-11-02 20:52:40,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:52:41,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1666 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse1)) 20))) is different from false [2022-11-02 20:52:41,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1666 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse1)) 20))) is different from false [2022-11-02 20:52:41,109 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1666 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse1)) 20))) is different from false [2022-11-02 20:52:41,122 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1666 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse1)) 20))) is different from false [2022-11-02 20:52:41,372 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662) .cse4 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse2)) 20)))))) is different from false [2022-11-02 20:52:41,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1660)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse1)))) (= 20 .cse4))))) is different from false [2022-11-02 20:52:41,474 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse0 .cse1))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse4 (store .cse0 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (let ((.cse5 (select .cse4 .cse1))) (or (not (= 20 (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662) .cse1 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse2 (+ (* 4 (select .cse2 .cse3)) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse3)))) (= .cse5 20)))))))) is different from false [2022-11-02 20:52:41,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse1 .cse2))) (not (= (let ((.cse4 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse4)) 20))))))) is different from false [2022-11-02 20:52:41,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse1 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse4 (store .cse1 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) v_ArrVal_1666)) .cse2) 20))))))) is different from false [2022-11-02 20:52:41,817 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1666)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse5 .cse1))) (= 20 .cse4))))))) is different from false [2022-11-02 20:52:41,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:41,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 234 treesize of output 164 [2022-11-02 20:52:41,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:41,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 262 [2022-11-02 20:52:41,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 188 [2022-11-02 20:52:41,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 256 [2022-11-02 20:52:42,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:52:42,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:52:42,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 147 [2022-11-02 20:52:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 463 proven. 419 refuted. 68 times theorem prover too weak. 4318 trivial. 622 not checked. [2022-11-02 20:52:43,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623780947] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:52:43,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:52:43,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 24] total 62 [2022-11-02 20:52:43,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773602479] [2022-11-02 20:52:43,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:52:43,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-02 20:52:43,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:43,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-02 20:52:43,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2272, Unknown=21, NotChecked=1090, Total=3782 [2022-11-02 20:52:43,800 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 231 [2022-11-02 20:52:43,807 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 504 places, 667 transitions, 3625 flow. Second operand has 62 states, 62 states have (on average 169.16129032258064) internal successors, (10488), 62 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:52:43,807 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:52:43,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 231 [2022-11-02 20:52:43,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:52:44,935 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1666)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse5 .cse1))) (= 20 .cse4))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:52:45,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select .cse0 .cse4))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= (select .cse0 84) 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (let ((.cse1 (select .cse5 .cse4))) (or (= 20 .cse1) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| .cse2)) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse5 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662) .cse4 (+ .cse1 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse3 (+ |c_~#queue~0.offset| (* (select .cse3 .cse4) 4)) v_ArrVal_1666)) .cse4) 20)))))) (<= .cse2 1) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:52:45,963 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|)) (.cse4 (+ 84 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse5 (store .cse1 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse0 (select .cse5 .cse2))) (or (= 20 .cse0) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse1 .cse2))) (not (= (select (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1662) .cse2 (+ .cse0 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse3 (+ (* (select .cse3 .cse4) 4) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse4) 20)))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse1 84) 1) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse4) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:52:47,980 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse6 .cse4)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| .cse0)) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse3 (store .cse6 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (let ((.cse5 (select .cse3 .cse4))) (or (not (= 20 (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1662) .cse4 (+ .cse5 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse2))) (= .cse5 20))))))) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= .cse0 1) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse2) 1) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:52:51,201 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1658 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse2 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse5 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (let ((.cse4 (select .cse3 .cse1))) (or (not (= (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_1662) .cse1 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1666)) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse5 .cse1))) (= 20 .cse4))))))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (<= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse1) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:09,953 INFO L130 PetriNetUnfolder]: 7007/28534 cut-off events. [2022-11-02 20:53:09,953 INFO L131 PetriNetUnfolder]: For 459487/459519 co-relation queries the response was YES. [2022-11-02 20:53:10,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94845 conditions, 28534 events. 7007/28534 cut-off events. For 459487/459519 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 221428 event pairs, 1183 based on Foata normal form. 237/28495 useless extension candidates. Maximal degree in co-relation 94745. Up to 4128 conditions per place. [2022-11-02 20:53:10,375 INFO L137 encePairwiseOnDemand]: 206/231 looper letters, 693 selfloop transitions, 914 changer transitions 0/1858 dead transitions. [2022-11-02 20:53:10,375 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 1858 transitions, 12835 flow [2022-11-02 20:53:10,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-02 20:53:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2022-11-02 20:53:10,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 7279 transitions. [2022-11-02 20:53:10,388 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7502576788291074 [2022-11-02 20:53:10,388 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 7279 transitions. [2022-11-02 20:53:10,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 7279 transitions. [2022-11-02 20:53:10,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:53:10,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 7279 transitions. [2022-11-02 20:53:10,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 173.3095238095238) internal successors, (7279), 42 states have internal predecessors, (7279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:10,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 231.0) internal successors, (9933), 43 states have internal predecessors, (9933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:10,424 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 231.0) internal successors, (9933), 43 states have internal predecessors, (9933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:10,425 INFO L175 Difference]: Start difference. First operand has 504 places, 667 transitions, 3625 flow. Second operand 42 states and 7279 transitions. [2022-11-02 20:53:10,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 1858 transitions, 12835 flow [2022-11-02 20:53:11,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 1858 transitions, 12682 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-11-02 20:53:11,561 INFO L231 Difference]: Finished difference. Result has 572 places, 1448 transitions, 11266 flow [2022-11-02 20:53:11,562 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3474, PETRI_DIFFERENCE_MINUEND_PLACES=497, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=11266, PETRI_PLACES=572, PETRI_TRANSITIONS=1448} [2022-11-02 20:53:11,563 INFO L287 CegarLoopForPetriNet]: 213 programPoint places, 359 predicate places. [2022-11-02 20:53:11,563 INFO L495 AbstractCegarLoop]: Abstraction has has 572 places, 1448 transitions, 11266 flow [2022-11-02 20:53:11,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 169.16129032258064) internal successors, (10488), 62 states have internal predecessors, (10488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:11,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-11-02 20:53:11,566 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:11,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:11,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:53:11,779 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-02 20:53:11,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash -4882471, now seen corresponding path program 1 times [2022-11-02 20:53:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:11,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778041377] [2022-11-02 20:53:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3911 proven. 262 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2022-11-02 20:53:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:27,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778041377] [2022-11-02 20:53:27,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778041377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:27,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827105795] [2022-11-02 20:53:27,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:27,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:27,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:27,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:27,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b112b2f-784c-48c1-883d-1505670b6749/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:53:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 1655 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:53:28,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:28,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:53:28,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:28,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:28,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:53:28,893 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-02 20:53:28,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-02 20:53:28,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:28,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:53:29,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-02 20:53:29,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:29,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:29,412 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-11-02 20:53:29,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 30 [2022-11-02 20:53:29,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-02 20:53:29,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 20:53:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1932 proven. 72 refuted. 0 times theorem prover too weak. 3886 trivial. 0 not checked. [2022-11-02 20:53:29,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:29,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1)) 20))) is different from false [2022-11-02 20:53:29,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1)) 20))) is different from false [2022-11-02 20:53:29,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* 4 (select .cse0 .cse1))) v_ArrVal_2056)) .cse1)) 20))) is different from false [2022-11-02 20:53:29,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_2056)) .cse1))))) is different from false [2022-11-02 20:53:29,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int))) (not (= 20 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1))))) is different from false [2022-11-02 20:53:29,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1)) 20))) is different from false [2022-11-02 20:53:29,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse4 .cse3)))))) is different from false [2022-11-02 20:53:30,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse3)) 20))))) is different from false [2022-11-02 20:53:30,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1) 20))))) is different from false [2022-11-02 20:53:30,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2056)) .cse1) 20)))))) is different from false [2022-11-02 20:53:30,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:30,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 145 [2022-11-02 20:53:30,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:30,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 225 [2022-11-02 20:53:30,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 242 treesize of output 226 [2022-11-02 20:53:30,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 233 treesize of output 209 [2022-11-02 20:53:30,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-02 20:53:30,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:30,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 104 [2022-11-02 20:53:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 1871 proven. 43 refuted. 0 times theorem prover too weak. 3886 trivial. 90 not checked. [2022-11-02 20:53:30,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827105795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:30,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:30,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 19, 22] total 68 [2022-11-02 20:53:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395283757] [2022-11-02 20:53:30,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:30,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-02 20:53:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-02 20:53:30,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2930, Unknown=10, NotChecked=1210, Total=4556 [2022-11-02 20:53:30,785 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 231 [2022-11-02 20:53:30,792 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 1448 transitions, 11266 flow. Second operand has 68 states, 68 states have (on average 165.3235294117647) internal successors, (11242), 68 states have internal predecessors, (11242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:30,792 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-02 20:53:30,792 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 231 [2022-11-02 20:53:30,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-02 20:53:32,118 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= |c_ULTIMATE.start_init_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_ULTIMATE.start_init_~q#1.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= |c_ULTIMATE.start_empty_#in~q#1.offset| 0) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse1 .cse0))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse0 (+ (select .cse4 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) v_ArrVal_2056)) .cse0) 20)))))) (= |c_ULTIMATE.start_empty_~q#1.offset| 0) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:32,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse1 .cse0))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse0 (+ (select .cse4 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) v_ArrVal_2056)) .cse0) 20)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:33,109 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (and (= .cse0 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| .cse0)) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse2) 20)))) (= (select .cse4 84) 1) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:53:33,593 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select .cse4 .cse2))) (and (= .cse0 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| .cse0)) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse2 (+ (select .cse3 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse2) 20)))) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:53:34,195 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse3) 20))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse3) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (= (select .cse0 84) 1) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:36,305 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (+ 84 |c_~#queue~0.offset|)) (.cse1 (select .cse5 .cse4))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= .cse1 1) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse0) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| .cse1)))) (<= |c_~#stored_elements~0.base| 6)))) is different from false [2022-11-02 20:53:36,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse3) 20))))) (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse3) 1) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= 7 |c_~#queue~0.base|) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:39,072 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= 7 |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse0) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse0) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse4 .cse3)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:43,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| |c_~#queue~0.offset|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse1 .cse0))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse0 (+ (select .cse4 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) v_ArrVal_2056)) .cse0) 20)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:43,885 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (and (= (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) 1) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= 7 |c_~#queue~0.base|) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse1 (select .cse3 |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse1 .cse0))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse0 (+ (select .cse4 .cse0) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse0) 4)) v_ArrVal_2056)) .cse0) 20)))))) (<= |c_~#stored_elements~0.base| 6))) is different from false [2022-11-02 20:53:44,534 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 1) (= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|) 84) 1) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2048 (Array Int Int)) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2048))) (let ((.cse0 (select .cse3 |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse1) 4)) v_ArrVal_2056)) .cse1) 20))))))) is different from false [2022-11-02 20:53:59,091 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1) 20))))) (not (= (select .cse0 84) 20)))) is different from false [2022-11-02 20:53:59,713 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (and (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (select (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse3 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_~#queue~0.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2052) .cse1 (+ (select .cse3 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1) 20))))) (= (select .cse0 84) 1))) is different from false [2022-11-02 20:54:00,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse3)) 20))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|) (= (select .cse0 84) 1))) is different from false [2022-11-02 20:54:01,518 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (and (forall ((v_ArrVal_2052 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| (select .cse0 .cse1))) (not (= (let ((.cse3 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2050))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2052) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse3)) 20))))) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (not (= (select .cse0 84) 20)) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| 0) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| |c_~#queue~0.base|))) is different from false [2022-11-02 20:54:03,527 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse5 .cse4))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (= .cse0 1) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (let ((.cse2 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050))) (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse2)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| .cse0))))))) is different from false [2022-11-02 20:54:05,644 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse4 .cse3))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#stored_elements~0.base|)) (= |c_~#queue~0.offset| 0) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.base| |c_~#queue~0.base|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| Int)) (or (forall ((v_ArrVal_2052 Int) (v_ArrVal_2056 Int) (v_ArrVal_2055 (Array Int Int)) (v_ArrVal_2050 Int)) (not (= (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2050))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2055) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_2056)) .cse1)) 20))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_251| .cse5)))) (not (= .cse5 20))))) is different from false