./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 6b4ec56b 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_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN --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-6b4ec56 [2022-11-20 12:32:27,636 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:32:27,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:32:27,662 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:32:27,662 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:32:27,664 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:32:27,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:32:27,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:32:27,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:32:27,671 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:32:27,672 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:32:27,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:32:27,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:32:27,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:32:27,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:32:27,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:32:27,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:32:27,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:32:27,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:32:27,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:32:27,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:32:27,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:32:27,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:32:27,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:32:27,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:32:27,702 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:32:27,702 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:32:27,704 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:32:27,704 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:32:27,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:32:27,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:32:27,715 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:32:27,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:32:27,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:32:27,722 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:32:27,722 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:32:27,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:32:27,724 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:32:27,724 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:32:27,728 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:32:27,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:32:27,730 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 12:32:27,784 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:32:27,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:32:27,785 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:32:27,786 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:32:27,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 12:32:27,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 12:32:27,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:32:27,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:32:27,788 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:32:27,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:32:27,790 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 12:32:27,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:32:27,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 12:32:27,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:32:27,791 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 12:32:27,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 12:32:27,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 12:32:27,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 12:32:27,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:32:27,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:32:27,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 12:32:27,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:32:27,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:32:27,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 12:32:27,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:32:27,794 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:32:27,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 12:32:27,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 12:32:27,795 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:32:27,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 12:32:27,795 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 12:32:27,795 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 12:32:27,796 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 12:32:27,796 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_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/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_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN 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-20 12:32:28,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:32:28,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:32:28,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:32:28,151 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:32:28,151 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:32:28,153 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 12:32:31,953 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:32:32,303 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:32:32,304 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/sv-benchmarks/c/pthread/queue_ok.i [2022-11-20 12:32:32,326 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/data/4565f3f04/87f5037cf3db45dc839e0ac7ece093d2/FLAG5105e211f [2022-11-20 12:32:32,345 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/data/4565f3f04/87f5037cf3db45dc839e0ac7ece093d2 [2022-11-20 12:32:32,348 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:32:32,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:32:32,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:32:32,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:32:32,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:32:32,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:32:32" (1/1) ... [2022-11-20 12:32:32,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ef762fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:32, skipping insertion in model container [2022-11-20 12:32:32,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:32:32" (1/1) ... [2022-11-20 12:32:32,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:32:32,428 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:32:33,161 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 12:32:33,175 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 12:32:33,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:32:33,203 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:32:33,301 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-20 12:32:33,310 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-20 12:32:33,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:32:33,400 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:32:33,400 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33 WrapperNode [2022-11-20 12:32:33,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:32:33,402 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:32:33,402 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:32:33,402 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:32:33,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,434 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,473 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-20 12:32:33,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:32:33,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:32:33,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:32:33,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:32:33,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,495 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,495 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,509 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,514 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,517 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,519 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:32:33,524 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:32:33,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:32:33,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:32:33,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (1/1) ... [2022-11-20 12:32:33,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 12:32:33,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:33,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 12:32:33,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 12:32:33,619 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-20 12:32:33,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-20 12:32:33,620 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-20 12:32:33,620 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-20 12:32:33,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 12:32:33,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 12:32:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 12:32:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 12:32:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-20 12:32:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 12:32:33,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 12:32:33,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:32:33,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:32:33,624 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 12:32:33,814 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:32:33,817 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:32:34,454 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:32:34,467 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:32:34,468 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-20 12:32:34,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:32:34 BoogieIcfgContainer [2022-11-20 12:32:34,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:32:34,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 12:32:34,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 12:32:34,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 12:32:34,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:32:32" (1/3) ... [2022-11-20 12:32:34,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45490913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:32:34, skipping insertion in model container [2022-11-20 12:32:34,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:32:33" (2/3) ... [2022-11-20 12:32:34,512 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45490913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:32:34, skipping insertion in model container [2022-11-20 12:32:34,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:32:34" (3/3) ... [2022-11-20 12:32:34,514 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-20 12:32:34,527 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 12:32:34,538 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 12:32:34,538 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-20 12:32:34,539 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 12:32:34,703 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 12:32:34,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-20 12:32:34,894 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-20 12:32:34,894 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:32:34,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 227 events. 13/227 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 367 event pairs, 0 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 146. Up to 3 conditions per place. [2022-11-20 12:32:34,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 229 transitions, 474 flow [2022-11-20 12:32:34,916 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 217 transitions, 443 flow [2022-11-20 12:32:34,930 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 12:32:34,939 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;@413a7ff4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 12:32:34,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-20 12:32:34,960 INFO L130 PetriNetUnfolder]: 1/62 cut-off events. [2022-11-20 12:32:34,960 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-20 12:32:34,960 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:34,961 INFO L209 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] [2022-11-20 12:32:34,962 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-20 12:32:34,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:34,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1859650148, now seen corresponding path program 1 times [2022-11-20 12:32:34,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:34,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064300766] [2022-11-20 12:32:34,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:34,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:35,401 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-20 12:32:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:35,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064300766] [2022-11-20 12:32:35,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064300766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:32:35,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:32:35,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 12:32:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201851642] [2022-11-20 12:32:35,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:32:35,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 12:32:35,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:35,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 12:32:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 12:32:35,475 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 229 [2022-11-20 12:32:35,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 217 transitions, 443 flow. Second operand has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 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-20 12:32:35,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:35,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 229 [2022-11-20 12:32:35,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:35,583 INFO L130 PetriNetUnfolder]: 9/208 cut-off events. [2022-11-20 12:32:35,583 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-20 12:32:35,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 208 events. 9/208 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 276 event pairs, 0 based on Foata normal form. 5/203 useless extension candidates. Maximal degree in co-relation 143. Up to 4 conditions per place. [2022-11-20 12:32:35,588 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 3 selfloop transitions, 0 changer transitions 0/208 dead transitions. [2022-11-20 12:32:35,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 208 transitions, 431 flow [2022-11-20 12:32:35,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 12:32:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 12:32:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 443 transitions. [2022-11-20 12:32:35,607 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9672489082969432 [2022-11-20 12:32:35,608 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 443 transitions. [2022-11-20 12:32:35,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 443 transitions. [2022-11-20 12:32:35,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:35,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 443 transitions. [2022-11-20 12:32:35,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 221.5) internal successors, (443), 2 states have internal predecessors, (443), 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-20 12:32:35,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-20 12:32:35,629 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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-20 12:32:35,631 INFO L175 Difference]: Start difference. First operand has 211 places, 217 transitions, 443 flow. Second operand 2 states and 443 transitions. [2022-11-20 12:32:35,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 208 transitions, 431 flow [2022-11-20 12:32:35,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-20 12:32:35,644 INFO L231 Difference]: Finished difference. Result has 204 places, 208 transitions, 420 flow [2022-11-20 12:32:35,647 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=420, PETRI_PLACES=204, PETRI_TRANSITIONS=208} [2022-11-20 12:32:35,652 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -7 predicate places. [2022-11-20 12:32:35,652 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 208 transitions, 420 flow [2022-11-20 12:32:35,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 218.5) internal successors, (437), 2 states have internal predecessors, (437), 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-20 12:32:35,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:35,654 INFO L209 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] [2022-11-20 12:32:35,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 12:32:35,654 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-20 12:32:35,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1551671927, now seen corresponding path program 1 times [2022-11-20 12:32:35,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:35,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845469361] [2022-11-20 12:32:35,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:35,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:37,295 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-20 12:32:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:37,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845469361] [2022-11-20 12:32:37,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845469361] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:32:37,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:32:37,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 12:32:37,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536143748] [2022-11-20 12:32:37,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:32:37,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 12:32:37,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:37,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 12:32:37,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-20 12:32:37,307 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 229 [2022-11-20 12:32:37,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 208 transitions, 420 flow. Second operand has 12 states, 12 states have (on average 167.25) internal successors, (2007), 12 states have internal predecessors, (2007), 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-20 12:32:37,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:37,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 229 [2022-11-20 12:32:37,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:38,717 INFO L130 PetriNetUnfolder]: 611/2580 cut-off events. [2022-11-20 12:32:38,718 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-20 12:32:38,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 2580 events. 611/2580 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 20510 event pairs, 459 based on Foata normal form. 0/2409 useless extension candidates. Maximal degree in co-relation 3509. Up to 882 conditions per place. [2022-11-20 12:32:38,744 INFO L137 encePairwiseOnDemand]: 216/229 looper letters, 42 selfloop transitions, 12 changer transitions 0/204 dead transitions. [2022-11-20 12:32:38,744 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 204 transitions, 520 flow [2022-11-20 12:32:38,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 12:32:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 12:32:38,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2187 transitions. [2022-11-20 12:32:38,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7346321800470272 [2022-11-20 12:32:38,757 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2187 transitions. [2022-11-20 12:32:38,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2187 transitions. [2022-11-20 12:32:38,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:38,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2187 transitions. [2022-11-20 12:32:38,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 168.23076923076923) internal successors, (2187), 13 states have internal predecessors, (2187), 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-20 12:32:38,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 229.0) internal successors, (3206), 14 states have internal predecessors, (3206), 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-20 12:32:38,781 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 229.0) internal successors, (3206), 14 states have internal predecessors, (3206), 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-20 12:32:38,781 INFO L175 Difference]: Start difference. First operand has 204 places, 208 transitions, 420 flow. Second operand 13 states and 2187 transitions. [2022-11-20 12:32:38,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 204 transitions, 520 flow [2022-11-20 12:32:38,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 204 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 12:32:38,795 INFO L231 Difference]: Finished difference. Result has 213 places, 204 transitions, 436 flow [2022-11-20 12:32:38,796 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=436, PETRI_PLACES=213, PETRI_TRANSITIONS=204} [2022-11-20 12:32:38,797 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 2 predicate places. [2022-11-20 12:32:38,798 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 204 transitions, 436 flow [2022-11-20 12:32:38,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 167.25) internal successors, (2007), 12 states have internal predecessors, (2007), 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-20 12:32:38,800 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:38,801 INFO L209 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] [2022-11-20 12:32:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 12:32:38,802 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-20 12:32:38,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:38,804 INFO L85 PathProgramCache]: Analyzing trace with hash 63645862, now seen corresponding path program 1 times [2022-11-20 12:32:38,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:38,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48146587] [2022-11-20 12:32:38,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:38,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:39,134 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-20 12:32:39,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:39,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48146587] [2022-11-20 12:32:39,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48146587] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:32:39,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:32:39,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:32:39,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184155246] [2022-11-20 12:32:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:32:39,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:32:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:39,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:32:39,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:32:39,144 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 229 [2022-11-20 12:32:39,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 204 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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-20 12:32:39,146 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:39,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 229 [2022-11-20 12:32:39,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:39,228 INFO L130 PetriNetUnfolder]: 16/305 cut-off events. [2022-11-20 12:32:39,228 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-20 12:32:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 305 events. 16/305 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 690 event pairs, 2 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 344. Up to 12 conditions per place. [2022-11-20 12:32:39,230 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 7 selfloop transitions, 2 changer transitions 5/207 dead transitions. [2022-11-20 12:32:39,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 207 transitions, 469 flow [2022-11-20 12:32:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:32:39,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:32:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-11-20 12:32:39,234 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446870451237264 [2022-11-20 12:32:39,234 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:39,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-20 12:32:39,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:39,242 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:39,243 INFO L175 Difference]: Start difference. First operand has 213 places, 204 transitions, 436 flow. Second operand 3 states and 649 transitions. [2022-11-20 12:32:39,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 207 transitions, 469 flow [2022-11-20 12:32:39,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 207 transitions, 446 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-20 12:32:39,250 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 415 flow [2022-11-20 12:32:39,251 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=415, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2022-11-20 12:32:39,254 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -6 predicate places. [2022-11-20 12:32:39,254 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 415 flow [2022-11-20 12:32:39,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 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-20 12:32:39,255 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:39,256 INFO L209 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] [2022-11-20 12:32:39,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 12:32:39,256 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-20 12:32:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1324891375, now seen corresponding path program 1 times [2022-11-20 12:32:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:39,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555844018] [2022-11-20 12:32:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:39,439 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-20 12:32:39,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:39,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555844018] [2022-11-20 12:32:39,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555844018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:32:39,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:32:39,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:32:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163360170] [2022-11-20 12:32:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:32:39,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:32:39,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:39,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:32:39,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:32:39,452 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 229 [2022-11-20 12:32:39,454 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 415 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-20 12:32:39,454 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:39,454 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 229 [2022-11-20 12:32:39,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:39,539 INFO L130 PetriNetUnfolder]: 20/334 cut-off events. [2022-11-20 12:32:39,539 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 12:32:39,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 334 events. 20/334 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 674 event pairs, 6 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 399. Up to 24 conditions per place. [2022-11-20 12:32:39,541 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 13 selfloop transitions, 2 changer transitions 1/206 dead transitions. [2022-11-20 12:32:39,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 457 flow [2022-11-20 12:32:39,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:32:39,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:32:39,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-11-20 12:32:39,545 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446870451237264 [2022-11-20 12:32:39,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:39,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2022-11-20 12:32:39,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 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-20 12:32:39,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:39,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:39,558 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 415 flow. Second operand 3 states and 649 transitions. [2022-11-20 12:32:39,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 457 flow [2022-11-20 12:32:39,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 206 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-20 12:32:39,565 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 421 flow [2022-11-20 12:32:39,566 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=411, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=421, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2022-11-20 12:32:39,568 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -6 predicate places. [2022-11-20 12:32:39,574 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 421 flow [2022-11-20 12:32:39,575 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-20 12:32:39,575 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:39,575 INFO L209 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] [2022-11-20 12:32:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 12:32:39,576 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-20 12:32:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -637897097, now seen corresponding path program 1 times [2022-11-20 12:32:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:39,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342400709] [2022-11-20 12:32:39,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:39,834 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-20 12:32:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:39,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342400709] [2022-11-20 12:32:39,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342400709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:32:39,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048426375] [2022-11-20 12:32:39,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:39,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:39,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:39,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:32:39,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 12:32:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:40,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:32:40,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:32:40,279 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-20 12:32:40,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:32:40,407 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-20 12:32:40,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048426375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:32:40,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:32:40,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:32:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883564640] [2022-11-20 12:32:40,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:32:40,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-20 12:32:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-20 12:32:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:32:40,416 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-20 12:32:40,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 421 flow. Second operand has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 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-20 12:32:40,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:40,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-20 12:32:40,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:40,648 INFO L130 PetriNetUnfolder]: 30/421 cut-off events. [2022-11-20 12:32:40,648 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-20 12:32:40,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 421 events. 30/421 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 696 event pairs, 4 based on Foata normal form. 4/414 useless extension candidates. Maximal degree in co-relation 535. Up to 19 conditions per place. [2022-11-20 12:32:40,651 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 20 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2022-11-20 12:32:40,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 218 transitions, 529 flow [2022-11-20 12:32:40,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:32:40,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 12:32:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1921 transitions. [2022-11-20 12:32:40,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9320718098010674 [2022-11-20 12:32:40,659 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1921 transitions. [2022-11-20 12:32:40,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1921 transitions. [2022-11-20 12:32:40,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:40,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1921 transitions. [2022-11-20 12:32:40,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 213.44444444444446) internal successors, (1921), 9 states have internal predecessors, (1921), 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-20 12:32:40,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 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-20 12:32:40,675 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 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-20 12:32:40,675 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 421 flow. Second operand 9 states and 1921 transitions. [2022-11-20 12:32:40,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 218 transitions, 529 flow [2022-11-20 12:32:40,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:32:40,683 INFO L231 Difference]: Finished difference. Result has 214 places, 207 transitions, 469 flow [2022-11-20 12:32:40,683 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=469, PETRI_PLACES=214, PETRI_TRANSITIONS=207} [2022-11-20 12:32:40,686 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 3 predicate places. [2022-11-20 12:32:40,687 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 207 transitions, 469 flow [2022-11-20 12:32:40,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 212.2) internal successors, (2122), 10 states have internal predecessors, (2122), 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-20 12:32:40,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:40,691 INFO L209 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] [2022-11-20 12:32:40,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:32:40,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:40,911 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-20 12:32:40,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:40,912 INFO L85 PathProgramCache]: Analyzing trace with hash -579238025, now seen corresponding path program 2 times [2022-11-20 12:32:40,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:40,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873950747] [2022-11-20 12:32:40,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:40,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:41,294 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-20 12:32:41,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:41,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873950747] [2022-11-20 12:32:41,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873950747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:32:41,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:32:41,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:32:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886001411] [2022-11-20 12:32:41,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:32:41,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-20 12:32:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:41,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:32:41,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:32:41,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 229 [2022-11-20 12:32:41,306 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 207 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-20 12:32:41,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:41,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 229 [2022-11-20 12:32:41,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:41,460 INFO L130 PetriNetUnfolder]: 25/609 cut-off events. [2022-11-20 12:32:41,460 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-20 12:32:41,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 609 events. 25/609 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 1307 event pairs, 3 based on Foata normal form. 2/594 useless extension candidates. Maximal degree in co-relation 723. Up to 19 conditions per place. [2022-11-20 12:32:41,463 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 12 selfloop transitions, 3 changer transitions 3/209 dead transitions. [2022-11-20 12:32:41,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 508 flow [2022-11-20 12:32:41,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:32:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-20 12:32:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2022-11-20 12:32:41,467 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9301310043668122 [2022-11-20 12:32:41,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2022-11-20 12:32:41,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2022-11-20 12:32:41,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:41,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2022-11-20 12:32:41,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-20 12:32:41,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:41,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 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-20 12:32:41,472 INFO L175 Difference]: Start difference. First operand has 214 places, 207 transitions, 469 flow. Second operand 3 states and 639 transitions. [2022-11-20 12:32:41,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 508 flow [2022-11-20 12:32:41,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 209 transitions, 502 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-20 12:32:41,483 INFO L231 Difference]: Finished difference. Result has 215 places, 204 transitions, 463 flow [2022-11-20 12:32:41,484 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=463, PETRI_PLACES=215, PETRI_TRANSITIONS=204} [2022-11-20 12:32:41,488 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 4 predicate places. [2022-11-20 12:32:41,491 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 204 transitions, 463 flow [2022-11-20 12:32:41,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 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-20 12:32:41,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:41,492 INFO L209 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] [2022-11-20 12:32:41,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 12:32:41,492 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-20 12:32:41,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:41,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1192919075, now seen corresponding path program 1 times [2022-11-20 12:32:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:41,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231976388] [2022-11-20 12:32:41,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:41,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:42,044 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-20 12:32:42,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:42,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231976388] [2022-11-20 12:32:42,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231976388] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:32:42,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424908049] [2022-11-20 12:32:42,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:42,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:42,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:32:42,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 12:32:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:42,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 12:32:42,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:32:42,552 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-20 12:32:42,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:32:42,839 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-20 12:32:42,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424908049] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:32:42,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:32:42,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:32:42,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017290912] [2022-11-20 12:32:42,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:32:42,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-20 12:32:42,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:42,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-20 12:32:42,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-20 12:32:42,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-20 12:32:42,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 204 transitions, 463 flow. Second operand has 18 states, 18 states have (on average 212.33333333333334) internal successors, (3822), 18 states have internal predecessors, (3822), 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-20 12:32:42,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:42,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-20 12:32:42,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:43,351 INFO L130 PetriNetUnfolder]: 58/745 cut-off events. [2022-11-20 12:32:43,351 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-20 12:32:43,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 745 events. 58/745 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1387 event pairs, 4 based on Foata normal form. 8/734 useless extension candidates. Maximal degree in co-relation 1045. Up to 39 conditions per place. [2022-11-20 12:32:43,356 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 40 selfloop transitions, 21 changer transitions 1/247 dead transitions. [2022-11-20 12:32:43,356 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 247 transitions, 761 flow [2022-11-20 12:32:43,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-20 12:32:43,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-20 12:32:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4475 transitions. [2022-11-20 12:32:43,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9305468912455812 [2022-11-20 12:32:43,367 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4475 transitions. [2022-11-20 12:32:43,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4475 transitions. [2022-11-20 12:32:43,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:43,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4475 transitions. [2022-11-20 12:32:43,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 213.0952380952381) internal successors, (4475), 21 states have internal predecessors, (4475), 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-20 12:32:43,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 229.0) internal successors, (5038), 22 states have internal predecessors, (5038), 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-20 12:32:43,396 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 229.0) internal successors, (5038), 22 states have internal predecessors, (5038), 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-20 12:32:43,396 INFO L175 Difference]: Start difference. First operand has 215 places, 204 transitions, 463 flow. Second operand 21 states and 4475 transitions. [2022-11-20 12:32:43,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 247 transitions, 761 flow [2022-11-20 12:32:43,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 247 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 12:32:43,404 INFO L231 Difference]: Finished difference. Result has 236 places, 216 transitions, 588 flow [2022-11-20 12:32:43,404 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=588, PETRI_PLACES=236, PETRI_TRANSITIONS=216} [2022-11-20 12:32:43,405 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 25 predicate places. [2022-11-20 12:32:43,405 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 216 transitions, 588 flow [2022-11-20 12:32:43,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 212.33333333333334) internal successors, (3822), 18 states have internal predecessors, (3822), 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-20 12:32:43,407 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:43,408 INFO L209 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] [2022-11-20 12:32:43,422 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:32:43,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-20 12:32:43,623 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-20 12:32:43,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -387971235, now seen corresponding path program 2 times [2022-11-20 12:32:43,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:43,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512547906] [2022-11-20 12:32:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:43,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:44,757 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-20 12:32:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:44,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512547906] [2022-11-20 12:32:44,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512547906] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:32:44,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [338220069] [2022-11-20 12:32:44,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:32:44,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:44,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:44,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:32:44,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 12:32:45,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:32:45,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:32:45,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-20 12:32:45,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:32:45,682 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-20 12:32:45,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:32:46,562 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-20 12:32:46,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [338220069] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:32:46,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:32:46,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-20 12:32:46,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9358053] [2022-11-20 12:32:46,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:32:46,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-20 12:32:46,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:46,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-20 12:32:46,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-20 12:32:46,578 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-20 12:32:46,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 216 transitions, 588 flow. Second operand has 34 states, 34 states have (on average 212.41176470588235) internal successors, (7222), 34 states have internal predecessors, (7222), 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-20 12:32:46,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:46,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-20 12:32:46,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:32:48,015 INFO L130 PetriNetUnfolder]: 114/1391 cut-off events. [2022-11-20 12:32:48,016 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-11-20 12:32:48,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 1391 events. 114/1391 cut-off events. For 465/465 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 2837 event pairs, 4 based on Foata normal form. 16/1372 useless extension candidates. Maximal degree in co-relation 2153. Up to 79 conditions per place. [2022-11-20 12:32:48,024 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 80 selfloop transitions, 45 changer transitions 0/310 dead transitions. [2022-11-20 12:32:48,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 310 transitions, 1326 flow [2022-11-20 12:32:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-20 12:32:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-20 12:32:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9583 transitions. [2022-11-20 12:32:48,046 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9299369238233867 [2022-11-20 12:32:48,047 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9583 transitions. [2022-11-20 12:32:48,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9583 transitions. [2022-11-20 12:32:48,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:32:48,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9583 transitions. [2022-11-20 12:32:48,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 212.95555555555555) internal successors, (9583), 45 states have internal predecessors, (9583), 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-20 12:32:48,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 229.0) internal successors, (10534), 46 states have internal predecessors, (10534), 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-20 12:32:48,103 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 229.0) internal successors, (10534), 46 states have internal predecessors, (10534), 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-20 12:32:48,103 INFO L175 Difference]: Start difference. First operand has 236 places, 216 transitions, 588 flow. Second operand 45 states and 9583 transitions. [2022-11-20 12:32:48,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 310 transitions, 1326 flow [2022-11-20 12:32:48,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 310 transitions, 1286 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-20 12:32:48,115 INFO L231 Difference]: Finished difference. Result has 282 places, 241 transitions, 866 flow [2022-11-20 12:32:48,116 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=866, PETRI_PLACES=282, PETRI_TRANSITIONS=241} [2022-11-20 12:32:48,116 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 71 predicate places. [2022-11-20 12:32:48,117 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 241 transitions, 866 flow [2022-11-20 12:32:48,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 212.41176470588235) internal successors, (7222), 34 states have internal predecessors, (7222), 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-20 12:32:48,120 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:32:48,120 INFO L209 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] [2022-11-20 12:32:48,129 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:32:48,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:48,330 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-20 12:32:48,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:32:48,331 INFO L85 PathProgramCache]: Analyzing trace with hash 925531131, now seen corresponding path program 3 times [2022-11-20 12:32:48,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:32:48,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481811814] [2022-11-20 12:32:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:32:48,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:32:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:32:51,416 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-20 12:32:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:32:51,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481811814] [2022-11-20 12:32:51,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481811814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:32:51,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214606411] [2022-11-20 12:32:51,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:32:51,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:32:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:32:51,421 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:32:51,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 12:32:51,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-20 12:32:51,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:32:51,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-20 12:32:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:32:56,282 INFO L350 Elim1Store]: Elim1 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-20 12:32:56,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,407 INFO L350 Elim1Store]: Elim1 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-20 12:32:56,773 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:32:56,791 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 12:32:56,792 INFO L350 Elim1Store]: Elim1 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-20 12:32:56,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:32:56,865 INFO L350 Elim1Store]: Elim1 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-20 12:32:56,914 INFO L350 Elim1Store]: Elim1 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-20 12:32:56,967 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-20 12:32:56,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:32:57,632 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_777 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_775) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45|)) v_ArrVal_777) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_45| (select .cse0 .cse1)))))) is different from false [2022-11-20 12:32:57,711 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:32:57,711 INFO L350 Elim1Store]: Elim1 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 54 treesize of output 44 [2022-11-20 12:32:57,726 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:32:57,736 INFO L350 Elim1Store]: Elim1 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 81 treesize of output 83 [2022-11-20 12:32:57,744 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 70 [2022-11-20 12:32:57,783 INFO L350 Elim1Store]: Elim1 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-20 12:32:57,861 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:32:57,861 INFO L350 Elim1Store]: Elim1 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 52 treesize of output 48 [2022-11-20 12:32:59,269 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-20 12:32:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214606411] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:32:59,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:32:59,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 13] total 56 [2022-11-20 12:32:59,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016516107] [2022-11-20 12:32:59,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:32:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-20 12:32:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:32:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-20 12:32:59,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=2592, Unknown=1, NotChecked=106, Total=3080 [2022-11-20 12:32:59,290 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 229 [2022-11-20 12:32:59,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 241 transitions, 866 flow. Second operand has 56 states, 56 states have (on average 164.60714285714286) internal successors, (9218), 56 states have internal predecessors, (9218), 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-20 12:32:59,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:32:59,304 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 229 [2022-11-20 12:32:59,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:33:23,164 INFO L130 PetriNetUnfolder]: 2125/7556 cut-off events. [2022-11-20 12:33:23,165 INFO L131 PetriNetUnfolder]: For 2826/2826 co-relation queries the response was YES. [2022-11-20 12:33:23,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7556 events. 2125/7556 cut-off events. For 2826/2826 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 39973 event pairs, 33 based on Foata normal form. 8/7464 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-11-20 12:33:23,237 INFO L137 encePairwiseOnDemand]: 205/229 looper letters, 888 selfloop transitions, 408 changer transitions 0/1428 dead transitions. [2022-11-20 12:33:23,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 1428 transitions, 6868 flow [2022-11-20 12:33:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2022-11-20 12:33:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2022-11-20 12:33:23,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 32887 transitions. [2022-11-20 12:33:23,293 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7144843468248279 [2022-11-20 12:33:23,294 INFO L72 ComplementDD]: Start complementDD. Operand 201 states and 32887 transitions. [2022-11-20 12:33:23,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 201 states and 32887 transitions. [2022-11-20 12:33:23,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:33:23,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 201 states and 32887 transitions. [2022-11-20 12:33:23,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 202 states, 201 states have (on average 163.61691542288557) internal successors, (32887), 201 states have internal predecessors, (32887), 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-20 12:33:23,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 202 states, 202 states have (on average 229.0) internal successors, (46258), 202 states have internal predecessors, (46258), 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-20 12:33:23,606 INFO L81 ComplementDD]: Finished complementDD. Result has 202 states, 202 states have (on average 229.0) internal successors, (46258), 202 states have internal predecessors, (46258), 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-20 12:33:23,606 INFO L175 Difference]: Start difference. First operand has 282 places, 241 transitions, 866 flow. Second operand 201 states and 32887 transitions. [2022-11-20 12:33:23,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 1428 transitions, 6868 flow [2022-11-20 12:33:23,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1428 transitions, 6753 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-11-20 12:33:23,663 INFO L231 Difference]: Finished difference. Result has 548 places, 680 transitions, 3716 flow [2022-11-20 12:33:23,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=810, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=201, PETRI_FLOW=3716, PETRI_PLACES=548, PETRI_TRANSITIONS=680} [2022-11-20 12:33:23,665 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 337 predicate places. [2022-11-20 12:33:23,665 INFO L495 AbstractCegarLoop]: Abstraction has has 548 places, 680 transitions, 3716 flow [2022-11-20 12:33:23,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 164.60714285714286) internal successors, (9218), 56 states have internal predecessors, (9218), 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-20 12:33:23,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:33:23,670 INFO L209 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] [2022-11-20 12:33:23,685 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:23,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:23,879 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-20 12:33:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:23,880 INFO L85 PathProgramCache]: Analyzing trace with hash -104989988, now seen corresponding path program 1 times [2022-11-20 12:33:23,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:23,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705008265] [2022-11-20 12:33:23,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:23,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:26,891 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-20 12:33:26,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705008265] [2022-11-20 12:33:26,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705008265] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:26,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145098110] [2022-11-20 12:33:26,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:26,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:26,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:26,894 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:26,905 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 12:33:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:27,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-20 12:33:27,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:33:28,463 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-20 12:33:28,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:33:30,315 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-20 12:33:30,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145098110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:33:30,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:33:30,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-11-20 12:33:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246980275] [2022-11-20 12:33:30,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:33:30,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-20 12:33:30,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:30,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-20 12:33:30,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-20 12:33:30,330 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-20 12:33:30,340 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 680 transitions, 3716 flow. Second operand has 43 states, 43 states have (on average 212.53488372093022) internal successors, (9139), 43 states have internal predecessors, (9139), 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-20 12:33:30,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:33:30,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-20 12:33:30,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:33:35,440 INFO L130 PetriNetUnfolder]: 609/5114 cut-off events. [2022-11-20 12:33:35,440 INFO L131 PetriNetUnfolder]: For 72880/72899 co-relation queries the response was YES. [2022-11-20 12:33:35,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17334 conditions, 5114 events. 609/5114 cut-off events. For 72880/72899 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 22917 event pairs, 7 based on Foata normal form. 24/5130 useless extension candidates. Maximal degree in co-relation 17226. Up to 336 conditions per place. [2022-11-20 12:33:35,510 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 105 selfloop transitions, 110 changer transitions 0/788 dead transitions. [2022-11-20 12:33:35,511 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 788 transitions, 4778 flow [2022-11-20 12:33:35,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-20 12:33:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-11-20 12:33:35,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12769 transitions. [2022-11-20 12:33:35,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9293304221251819 [2022-11-20 12:33:35,531 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12769 transitions. [2022-11-20 12:33:35,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12769 transitions. [2022-11-20 12:33:35,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:33:35,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12769 transitions. [2022-11-20 12:33:35,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 212.81666666666666) internal successors, (12769), 60 states have internal predecessors, (12769), 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-20 12:33:35,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 229.0) internal successors, (13969), 61 states have internal predecessors, (13969), 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-20 12:33:35,696 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 229.0) internal successors, (13969), 61 states have internal predecessors, (13969), 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-20 12:33:35,697 INFO L175 Difference]: Start difference. First operand has 548 places, 680 transitions, 3716 flow. Second operand 60 states and 12769 transitions. [2022-11-20 12:33:35,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 788 transitions, 4778 flow [2022-11-20 12:33:36,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 788 transitions, 4592 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-11-20 12:33:36,112 INFO L231 Difference]: Finished difference. Result has 564 places, 695 transitions, 3968 flow [2022-11-20 12:33:36,114 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3530, PETRI_DIFFERENCE_MINUEND_PLACES=500, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3968, PETRI_PLACES=564, PETRI_TRANSITIONS=695} [2022-11-20 12:33:36,115 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 353 predicate places. [2022-11-20 12:33:36,115 INFO L495 AbstractCegarLoop]: Abstraction has has 564 places, 695 transitions, 3968 flow [2022-11-20 12:33:36,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 212.53488372093022) internal successors, (9139), 43 states have internal predecessors, (9139), 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-20 12:33:36,118 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:33:36,118 INFO L209 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] [2022-11-20 12:33:36,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:33:36,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:36,328 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-20 12:33:36,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1926501200, now seen corresponding path program 2 times [2022-11-20 12:33:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:36,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596132518] [2022-11-20 12:33:36,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:36,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:42,379 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-20 12:33:42,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:42,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596132518] [2022-11-20 12:33:42,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596132518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:33:42,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:33:42,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-20 12:33:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352827110] [2022-11-20 12:33:42,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:33:42,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-20 12:33:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:33:42,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-20 12:33:42,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-20 12:33:42,386 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 229 [2022-11-20 12:33:42,389 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 695 transitions, 3968 flow. Second operand has 17 states, 17 states have (on average 162.8235294117647) internal successors, (2768), 17 states have internal predecessors, (2768), 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-20 12:33:42,389 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:33:42,389 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 229 [2022-11-20 12:33:42,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:33:49,440 INFO L130 PetriNetUnfolder]: 2093/8376 cut-off events. [2022-11-20 12:33:49,440 INFO L131 PetriNetUnfolder]: For 109110/109110 co-relation queries the response was YES. [2022-11-20 12:33:49,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30259 conditions, 8376 events. 2093/8376 cut-off events. For 109110/109110 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 43521 event pairs, 1292 based on Foata normal form. 4/8345 useless extension candidates. Maximal degree in co-relation 30147. Up to 4581 conditions per place. [2022-11-20 12:33:49,523 INFO L137 encePairwiseOnDemand]: 212/229 looper letters, 438 selfloop transitions, 23 changer transitions 0/708 dead transitions. [2022-11-20 12:33:49,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 708 transitions, 5051 flow [2022-11-20 12:33:49,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:33:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-20 12:33:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2469 transitions. [2022-11-20 12:33:49,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7187772925764192 [2022-11-20 12:33:49,529 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2469 transitions. [2022-11-20 12:33:49,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2469 transitions. [2022-11-20 12:33:49,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:33:49,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2469 transitions. [2022-11-20 12:33:49,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 164.6) internal successors, (2469), 15 states have internal predecessors, (2469), 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-20 12:33:49,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 229.0) internal successors, (3664), 16 states have internal predecessors, (3664), 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-20 12:33:49,540 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 229.0) internal successors, (3664), 16 states have internal predecessors, (3664), 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-20 12:33:49,541 INFO L175 Difference]: Start difference. First operand has 564 places, 695 transitions, 3968 flow. Second operand 15 states and 2469 transitions. [2022-11-20 12:33:49,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 708 transitions, 5051 flow [2022-11-20 12:33:50,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 708 transitions, 4834 flow, removed 16 selfloop flow, removed 48 redundant places. [2022-11-20 12:33:50,052 INFO L231 Difference]: Finished difference. Result has 535 places, 699 transitions, 3944 flow [2022-11-20 12:33:50,053 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3716, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3944, PETRI_PLACES=535, PETRI_TRANSITIONS=699} [2022-11-20 12:33:50,053 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 324 predicate places. [2022-11-20 12:33:50,053 INFO L495 AbstractCegarLoop]: Abstraction has has 535 places, 699 transitions, 3944 flow [2022-11-20 12:33:50,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 162.8235294117647) internal successors, (2768), 17 states have internal predecessors, (2768), 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-20 12:33:50,054 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:33:50,055 INFO L209 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] [2022-11-20 12:33:50,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 12:33:50,055 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-20 12:33:50,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:33:50,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2032861861, now seen corresponding path program 3 times [2022-11-20 12:33:50,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:33:50,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028185931] [2022-11-20 12:33:50,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:33:50,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:33:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:33:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 3561 proven. 141 refuted. 0 times theorem prover too weak. 2188 trivial. 0 not checked. [2022-11-20 12:33:57,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:33:57,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028185931] [2022-11-20 12:33:57,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028185931] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:33:57,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222830651] [2022-11-20 12:33:57,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:33:57,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:33:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:33:57,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:33:57,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 12:33:58,653 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-20 12:33:58,653 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:33:58,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-20 12:33:58,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:34:03,978 INFO L350 Elim1Store]: Elim1 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-20 12:34:04,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:04,132 INFO L350 Elim1Store]: Elim1 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-20 12:34:04,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:34:04,607 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 12:34:04,608 INFO L350 Elim1Store]: Elim1 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-20 12:34:04,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:04,712 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,112 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:05,287 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:34:05,802 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 12:34:05,803 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:34:05,878 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,926 INFO L350 Elim1Store]: Elim1 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-20 12:34:05,973 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-20 12:34:05,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:34:06,057 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 4 [2022-11-20 12:34:06,719 WARN L837 $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-20 12:34:06,769 WARN L837 $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-20 12:34:06,780 WARN L837 $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-20 12:34:06,796 WARN L837 $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-20 12:34:06,965 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (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 .cse2 .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 20)))) is different from false [2022-11-20 12:34:07,005 WARN L837 $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-20 12:34:07,063 WARN L837 $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-20 12:34:07,087 WARN L837 $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 ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1660)))) (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 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_1666)) .cse1)))) (= .cse4 20)))))) is different from false [2022-11-20 12:34:07,132 WARN L837 $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 ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (let ((.cse2 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse3) 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_1660)))) (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_#in~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~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-20 12:34:07,439 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1658 (Array Int Int)) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1666 Int)) (let ((.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1658))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse2) 4)) v_ArrVal_1660)))) (let ((.cse0 (select .cse4 .cse2))) (or (= 20 .cse0) (not (= 20 (select (let ((.cse1 (select (store (store .cse3 |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 .cse1 (+ (* 4 (select .cse1 .cse2)) |c_~#queue~0.offset|) v_ArrVal_1666)) .cse2)))))))) is different from false [2022-11-20 12:34:07,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:34:07,536 INFO L350 Elim1Store]: Elim1 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 306 treesize of output 196 [2022-11-20 12:34:07,556 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:34:07,556 INFO L350 Elim1Store]: Elim1 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 278 treesize of output 268 [2022-11-20 12:34:07,577 INFO L350 Elim1Store]: Elim1 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 236 treesize of output 212 [2022-11-20 12:34:07,595 INFO L350 Elim1Store]: Elim1 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 258 treesize of output 226 [2022-11-20 12:34:07,648 INFO L350 Elim1Store]: Elim1 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-20 12:34:07,686 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:34:07,687 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 100 [2022-11-20 12:34:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 254 proven. 795 refuted. 0 times theorem prover too weak. 4318 trivial. 523 not checked. [2022-11-20 12:34:09,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222830651] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:34:09,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:34:09,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 30] total 65 [2022-11-20 12:34:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950740098] [2022-11-20 12:34:09,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:34:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-20 12:34:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:34:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-20 12:34:09,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2560, Unknown=18, NotChecked=1150, Total=4160 [2022-11-20 12:34:09,253 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 229 [2022-11-20 12:34:09,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 699 transitions, 3944 flow. Second operand has 65 states, 65 states have (on average 153.09230769230768) internal successors, (9951), 65 states have internal predecessors, (9951), 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-20 12:34:09,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:34:09,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 229 [2022-11-20 12:34:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 12:34:47,869 INFO L130 PetriNetUnfolder]: 9719/35427 cut-off events. [2022-11-20 12:34:47,869 INFO L131 PetriNetUnfolder]: For 539452/539452 co-relation queries the response was YES. [2022-11-20 12:34:48,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126762 conditions, 35427 events. 9719/35427 cut-off events. For 539452/539452 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 282131 event pairs, 973 based on Foata normal form. 219/35455 useless extension candidates. Maximal degree in co-relation 126646. Up to 5369 conditions per place. [2022-11-20 12:34:48,268 INFO L137 encePairwiseOnDemand]: 191/229 looper letters, 1184 selfloop transitions, 1735 changer transitions 0/3042 dead transitions. [2022-11-20 12:34:48,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 3042 transitions, 24955 flow [2022-11-20 12:34:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-20 12:34:48,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2022-11-20 12:34:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 14779 transitions. [2022-11-20 12:34:48,288 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6722616448326055 [2022-11-20 12:34:48,289 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 14779 transitions. [2022-11-20 12:34:48,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 14779 transitions. [2022-11-20 12:34:48,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:34:48,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 14779 transitions. [2022-11-20 12:34:48,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 153.94791666666666) internal successors, (14779), 96 states have internal predecessors, (14779), 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-20 12:34:48,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 229.0) internal successors, (22213), 97 states have internal predecessors, (22213), 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-20 12:34:48,346 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 229.0) internal successors, (22213), 97 states have internal predecessors, (22213), 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-20 12:34:48,346 INFO L175 Difference]: Start difference. First operand has 535 places, 699 transitions, 3944 flow. Second operand 96 states and 14779 transitions. [2022-11-20 12:34:48,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 3042 transitions, 24955 flow [2022-11-20 12:34:49,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 623 places, 3042 transitions, 24842 flow, removed 50 selfloop flow, removed 7 redundant places. [2022-11-20 12:34:49,777 INFO L231 Difference]: Finished difference. Result has 689 places, 2300 transitions, 21223 flow [2022-11-20 12:34:49,779 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3831, PETRI_DIFFERENCE_MINUEND_PLACES=528, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=21223, PETRI_PLACES=689, PETRI_TRANSITIONS=2300} [2022-11-20 12:34:49,779 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 478 predicate places. [2022-11-20 12:34:49,780 INFO L495 AbstractCegarLoop]: Abstraction has has 689 places, 2300 transitions, 21223 flow [2022-11-20 12:34:49,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 153.09230769230768) internal successors, (9951), 65 states have internal predecessors, (9951), 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-20 12:34:49,782 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 12:34:49,782 INFO L209 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, 12, 12, 12, 12, 12, 12, 12, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:34:49,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:34:49,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-20 12:34:49,991 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-20 12:34:49,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:34:49,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1590176723, now seen corresponding path program 4 times [2022-11-20 12:34:49,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:34:49,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957075351] [2022-11-20 12:34:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:34:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:34:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:35:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 3879 proven. 205 refuted. 0 times theorem prover too weak. 1898 trivial. 0 not checked. [2022-11-20 12:35:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:35:00,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957075351] [2022-11-20 12:35:00,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957075351] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:35:00,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593629809] [2022-11-20 12:35:00,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:35:00,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:35:00,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:35:00,068 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:35:00,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_47a43763-1e51-4211-b99a-06fb94b7eefb/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 12:35:11,939 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:35:11,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:35:11,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-20 12:35:11,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:35:17,025 INFO L350 Elim1Store]: Elim1 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-20 12:35:17,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:35:17,111 INFO L350 Elim1Store]: Elim1 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-20 12:35:17,432 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:35:17,444 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-20 12:35:17,444 INFO L350 Elim1Store]: Elim1 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-20 12:35:17,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:35:17,522 INFO L350 Elim1Store]: Elim1 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-20 12:35:17,767 INFO L350 Elim1Store]: Elim1 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-20 12:35:17,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:35:17,887 INFO L350 Elim1Store]: Elim1 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-20 12:35:18,161 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 12:35:18,171 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-20 12:35:18,172 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 27 [2022-11-20 12:35:18,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 12:35:18,234 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 20 [2022-11-20 12:35:18,256 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 7 [2022-11-20 12:35:18,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 2145 proven. 469 refuted. 0 times theorem prover too weak. 3368 trivial. 0 not checked. [2022-11-20 12:35:18,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:35:19,062 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2059 Int)) (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_2057) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2059) .cse1)))))) is different from false [2022-11-20 12:35:19,283 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2053 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2059 Int)) (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_2053) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2057) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2059) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| (select .cse0 .cse1)))))) is different from false [2022-11-20 12:35:19,348 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2052 Int) (v_ArrVal_2053 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2059 Int)) (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_2052)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2057) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2059) .cse1)))))) is different from false [2022-11-20 12:35:19,381 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 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_2053 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2059 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2052))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2057) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2059) .cse1) 20))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse4 .cse3)))))) is different from false [2022-11-20 12:35:23,176 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2050 (Array Int Int)) (v_ArrVal_2052 Int) (v_ArrVal_2053 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| Int) (v_ArrVal_2057 (Array Int Int)) (v_ArrVal_2059 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| Int)) (let ((.cse3 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2050))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse3 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| 4) |c_~#queue~0.offset|) v_ArrVal_2052))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2053) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2057) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| 4) |c_~#queue~0.offset|) v_ArrVal_2059) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_209| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_206| (select .cse0 .cse1)))))))) is different from false [2022-11-20 12:35:23,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:23,294 INFO L350 Elim1Store]: Elim1 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 209 treesize of output 149 [2022-11-20 12:35:23,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:23,311 INFO L350 Elim1Store]: Elim1 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 275 treesize of output 273 [2022-11-20 12:35:23,322 INFO L350 Elim1Store]: Elim1 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 253 treesize of output 237 [2022-11-20 12:35:23,334 INFO L350 Elim1Store]: Elim1 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 293 treesize of output 281 [2022-11-20 12:35:23,359 INFO L350 Elim1Store]: Elim1 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-20 12:35:23,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 12:35:23,471 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 89 [2022-11-20 12:35:24,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5982 backedges. 1893 proven. 388 refuted. 0 times theorem prover too weak. 3476 trivial. 225 not checked. [2022-11-20 12:35:24,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593629809] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:35:24,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:35:24,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 22] total 62 [2022-11-20 12:35:24,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725647931] [2022-11-20 12:35:24,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:35:24,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-20 12:35:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:35:24,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-20 12:35:24,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=2686, Unknown=32, NotChecked=570, Total=3782 [2022-11-20 12:35:24,916 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 229 [2022-11-20 12:35:24,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 2300 transitions, 21223 flow. Second operand has 62 states, 62 states have (on average 167.80645161290323) internal successors, (10404), 62 states have internal predecessors, (10404), 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-20 12:35:24,924 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 12:35:24,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 229 [2022-11-20 12:35:24,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand