./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 8393723b 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_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro --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-8393723 [2022-11-18 20:09:37,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 20:09:37,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 20:09:37,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 20:09:37,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 20:09:37,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 20:09:37,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 20:09:37,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 20:09:37,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 20:09:37,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 20:09:37,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 20:09:37,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 20:09:37,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 20:09:37,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 20:09:37,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 20:09:37,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 20:09:37,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 20:09:37,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 20:09:37,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 20:09:37,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 20:09:37,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 20:09:37,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 20:09:37,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 20:09:37,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 20:09:37,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 20:09:37,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 20:09:37,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 20:09:37,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 20:09:37,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 20:09:37,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 20:09:37,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 20:09:37,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 20:09:37,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 20:09:37,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 20:09:37,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 20:09:37,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 20:09:37,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 20:09:37,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 20:09:37,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 20:09:37,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 20:09:37,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 20:09:37,197 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 20:09:37,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 20:09:37,222 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 20:09:37,222 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 20:09:37,222 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 20:09:37,223 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 20:09:37,223 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 20:09:37,224 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 20:09:37,224 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 20:09:37,224 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 20:09:37,225 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 20:09:37,225 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 20:09:37,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 20:09:37,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 20:09:37,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 20:09:37,225 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 20:09:37,226 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 20:09:37,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 20:09:37,227 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 20:09:37,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 20:09:37,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:37,227 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 20:09:37,228 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 20:09:37,229 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 20:09:37,229 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_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/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_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro 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-18 20:09:37,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 20:09:37,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 20:09:37,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 20:09:37,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 20:09:37,530 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 20:09:37,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread/queue_ok.i [2022-11-18 20:09:37,626 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/data/cac69519a/cc56be30b2d54410830144c877956a0f/FLAG60e084dfe [2022-11-18 20:09:38,178 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 20:09:38,179 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/sv-benchmarks/c/pthread/queue_ok.i [2022-11-18 20:09:38,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/data/cac69519a/cc56be30b2d54410830144c877956a0f/FLAG60e084dfe [2022-11-18 20:09:38,436 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/data/cac69519a/cc56be30b2d54410830144c877956a0f [2022-11-18 20:09:38,439 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 20:09:38,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 20:09:38,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:38,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 20:09:38,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 20:09:38,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:38" (1/1) ... [2022-11-18 20:09:38,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2738f6e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:38, skipping insertion in model container [2022-11-18 20:09:38,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:09:38" (1/1) ... [2022-11-18 20:09:38,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 20:09:38,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 20:09:38,959 WARN L234 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_c3db84f7-402e-4178-a191-fae13064aecf/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-18 20:09:38,965 WARN L234 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_c3db84f7-402e-4178-a191-fae13064aecf/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-18 20:09:38,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:38,979 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 20:09:39,036 WARN L234 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_c3db84f7-402e-4178-a191-fae13064aecf/sv-benchmarks/c/pthread/queue_ok.i[43266,43279] [2022-11-18 20:09:39,042 WARN L234 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_c3db84f7-402e-4178-a191-fae13064aecf/sv-benchmarks/c/pthread/queue_ok.i[43543,43556] [2022-11-18 20:09:39,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 20:09:39,121 INFO L208 MainTranslator]: Completed translation [2022-11-18 20:09:39,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39 WrapperNode [2022-11-18 20:09:39,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 20:09:39,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:39,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 20:09:39,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 20:09:39,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,213 INFO L138 Inliner]: procedures = 274, calls = 57, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 202 [2022-11-18 20:09:39,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 20:09:39,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 20:09:39,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 20:09:39,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 20:09:39,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,271 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 20:09:39,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 20:09:39,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 20:09:39,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 20:09:39,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (1/1) ... [2022-11-18 20:09:39,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 20:09:39,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:39,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 20:09:39,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 20:09:39,370 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-18 20:09:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-18 20:09:39,371 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-18 20:09:39,373 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-18 20:09:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 20:09:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 20:09:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 20:09:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 20:09:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-18 20:09:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 20:09:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 20:09:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 20:09:39,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 20:09:39,377 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 20:09:39,595 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 20:09:39,597 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 20:09:40,007 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 20:09:40,016 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 20:09:40,025 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-18 20:09:40,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:40 BoogieIcfgContainer [2022-11-18 20:09:40,029 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 20:09:40,059 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 20:09:40,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 20:09:40,065 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 20:09:40,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:09:38" (1/3) ... [2022-11-18 20:09:40,066 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf21b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:40, skipping insertion in model container [2022-11-18 20:09:40,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:09:39" (2/3) ... [2022-11-18 20:09:40,067 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf21b03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:09:40, skipping insertion in model container [2022-11-18 20:09:40,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:09:40" (3/3) ... [2022-11-18 20:09:40,068 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2022-11-18 20:09:40,078 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 20:09:40,089 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 20:09:40,089 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 20:09:40,089 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 20:09:40,279 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-18 20:09:40,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 229 transitions, 474 flow [2022-11-18 20:09:40,431 INFO L130 PetriNetUnfolder]: 13/227 cut-off events. [2022-11-18 20:09:40,431 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:09:40,438 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-18 20:09:40,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 223 places, 229 transitions, 474 flow [2022-11-18 20:09:40,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 217 transitions, 443 flow [2022-11-18 20:09:40,467 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 20:09:40,474 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;@3d0e973c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 20:09:40,475 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-11-18 20:09:40,490 INFO L130 PetriNetUnfolder]: 1/62 cut-off events. [2022-11-18 20:09:40,490 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 20:09:40,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:40,491 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-18 20:09:40,492 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-18 20:09:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash 57167261, now seen corresponding path program 1 times [2022-11-18 20:09:40,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:40,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855241419] [2022-11-18 20:09:40,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:40,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:40,802 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-18 20:09:40,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:40,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855241419] [2022-11-18 20:09:40,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855241419] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:40,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:40,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 20:09:40,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790982322] [2022-11-18 20:09:40,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:40,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-18 20:09:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:40,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-18 20:09:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-18 20:09:40,865 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 229 [2022-11-18 20:09:40,869 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-18 20:09:40,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:40,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 229 [2022-11-18 20:09:40,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:40,936 INFO L130 PetriNetUnfolder]: 9/208 cut-off events. [2022-11-18 20:09:40,936 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-18 20:09:40,939 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-18 20:09:40,940 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 3 selfloop transitions, 0 changer transitions 0/208 dead transitions. [2022-11-18 20:09:40,941 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 208 transitions, 431 flow [2022-11-18 20:09:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-18 20:09:40,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-18 20:09:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 443 transitions. [2022-11-18 20:09:40,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9672489082969432 [2022-11-18 20:09:40,956 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 443 transitions. [2022-11-18 20:09:40,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 443 transitions. [2022-11-18 20:09:40,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:40,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 443 transitions. [2022-11-18 20:09:40,966 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-18 20:09:40,971 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-18 20:09:40,972 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-18 20:09:40,974 INFO L175 Difference]: Start difference. First operand has 211 places, 217 transitions, 443 flow. Second operand 2 states and 443 transitions. [2022-11-18 20:09:40,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 208 transitions, 431 flow [2022-11-18 20:09:40,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 208 transitions, 426 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-18 20:09:40,984 INFO L231 Difference]: Finished difference. Result has 204 places, 208 transitions, 420 flow [2022-11-18 20:09:40,986 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-18 20:09:40,990 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -7 predicate places. [2022-11-18 20:09:40,990 INFO L495 AbstractCegarLoop]: Abstraction has has 204 places, 208 transitions, 420 flow [2022-11-18 20:09:40,990 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-18 20:09:40,991 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:40,991 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-18 20:09:40,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 20:09:40,991 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-18 20:09:40,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:40,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1723295190, now seen corresponding path program 1 times [2022-11-18 20:09:40,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:40,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592979429] [2022-11-18 20:09:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:42,327 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-18 20:09:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592979429] [2022-11-18 20:09:42,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592979429] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:42,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:42,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-18 20:09:42,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181682919] [2022-11-18 20:09:42,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:42,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-18 20:09:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-18 20:09:42,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-11-18 20:09:42,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 229 [2022-11-18 20:09:42,349 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-18 20:09:42,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:42,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 229 [2022-11-18 20:09:42,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:43,576 INFO L130 PetriNetUnfolder]: 611/2580 cut-off events. [2022-11-18 20:09:43,577 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-11-18 20:09:43,590 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 20587 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-18 20:09:43,602 INFO L137 encePairwiseOnDemand]: 216/229 looper letters, 42 selfloop transitions, 12 changer transitions 0/204 dead transitions. [2022-11-18 20:09:43,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 204 transitions, 520 flow [2022-11-18 20:09:43,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 20:09:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 20:09:43,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2187 transitions. [2022-11-18 20:09:43,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7346321800470272 [2022-11-18 20:09:43,614 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2187 transitions. [2022-11-18 20:09:43,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2187 transitions. [2022-11-18 20:09:43,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:43,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2187 transitions. [2022-11-18 20:09:43,624 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-18 20:09:43,632 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-18 20:09:43,634 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-18 20:09:43,634 INFO L175 Difference]: Start difference. First operand has 204 places, 208 transitions, 420 flow. Second operand 13 states and 2187 transitions. [2022-11-18 20:09:43,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 204 transitions, 520 flow [2022-11-18 20:09:43,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 204 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-18 20:09:43,646 INFO L231 Difference]: Finished difference. Result has 213 places, 204 transitions, 436 flow [2022-11-18 20:09:43,647 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-18 20:09:43,647 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 2 predicate places. [2022-11-18 20:09:43,648 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 204 transitions, 436 flow [2022-11-18 20:09:43,649 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-18 20:09:43,649 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:43,650 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-18 20:09:43,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 20:09:43,650 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-18 20:09:43,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:43,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1553437092, now seen corresponding path program 1 times [2022-11-18 20:09:43,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:43,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616407932] [2022-11-18 20:09:43,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:43,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:43,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:43,904 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-18 20:09:43,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:43,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616407932] [2022-11-18 20:09:43,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616407932] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:43,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:43,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:09:43,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338696688] [2022-11-18 20:09:43,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:43,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:09:43,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:43,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:09:43,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:09:43,908 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 229 [2022-11-18 20:09:43,909 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-18 20:09:43,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:43,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 229 [2022-11-18 20:09:43,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:43,967 INFO L130 PetriNetUnfolder]: 16/305 cut-off events. [2022-11-18 20:09:43,967 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-11-18 20:09:43,968 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 688 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-18 20:09:43,969 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 7 selfloop transitions, 2 changer transitions 5/207 dead transitions. [2022-11-18 20:09:43,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 207 transitions, 469 flow [2022-11-18 20:09:43,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:09:43,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:09:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-11-18 20:09:43,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446870451237264 [2022-11-18 20:09:43,971 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2022-11-18 20:09:43,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2022-11-18 20:09:43,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:43,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2022-11-18 20:09:43,974 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-18 20:09:43,975 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-18 20:09:43,976 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-18 20:09:43,976 INFO L175 Difference]: Start difference. First operand has 213 places, 204 transitions, 436 flow. Second operand 3 states and 649 transitions. [2022-11-18 20:09:43,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 207 transitions, 469 flow [2022-11-18 20:09:43,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 207 transitions, 446 flow, removed 0 selfloop flow, removed 11 redundant places. [2022-11-18 20:09:43,981 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 415 flow [2022-11-18 20:09:43,982 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-18 20:09:43,983 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -6 predicate places. [2022-11-18 20:09:43,983 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 415 flow [2022-11-18 20:09:43,984 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-18 20:09:43,984 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:43,984 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-18 20:09:43,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 20:09:43,984 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-18 20:09:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1135869843, now seen corresponding path program 1 times [2022-11-18 20:09:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:43,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797211665] [2022-11-18 20:09:43,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:43,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:44,076 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-18 20:09:44,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:44,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797211665] [2022-11-18 20:09:44,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797211665] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:44,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:44,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:09:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279254887] [2022-11-18 20:09:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:44,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:09:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:44,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:09:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:09:44,080 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 229 [2022-11-18 20:09:44,081 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-18 20:09:44,081 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:44,081 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 229 [2022-11-18 20:09:44,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:44,149 INFO L130 PetriNetUnfolder]: 20/334 cut-off events. [2022-11-18 20:09:44,149 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-18 20:09:44,151 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-18 20:09:44,152 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 13 selfloop transitions, 2 changer transitions 1/206 dead transitions. [2022-11-18 20:09:44,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 457 flow [2022-11-18 20:09:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:09:44,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:09:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 649 transitions. [2022-11-18 20:09:44,154 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9446870451237264 [2022-11-18 20:09:44,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 649 transitions. [2022-11-18 20:09:44,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 649 transitions. [2022-11-18 20:09:44,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:44,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 649 transitions. [2022-11-18 20:09:44,157 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-18 20:09:44,158 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-18 20:09:44,159 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-18 20:09:44,159 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 415 flow. Second operand 3 states and 649 transitions. [2022-11-18 20:09:44,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 457 flow [2022-11-18 20:09:44,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 206 transitions, 453 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 20:09:44,164 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 421 flow [2022-11-18 20:09:44,164 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-18 20:09:44,165 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, -6 predicate places. [2022-11-18 20:09:44,165 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 421 flow [2022-11-18 20:09:44,166 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-18 20:09:44,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:44,166 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-18 20:09:44,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 20:09:44,166 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-18 20:09:44,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:44,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1252901689, now seen corresponding path program 1 times [2022-11-18 20:09:44,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:44,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647265484] [2022-11-18 20:09:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:44,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:44,346 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-18 20:09:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:44,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647265484] [2022-11-18 20:09:44,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647265484] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:44,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084275415] [2022-11-18 20:09:44,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:44,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:44,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:44,354 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:44,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 20:09:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:44,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 20:09:44,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:44,707 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-18 20:09:44,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:44,808 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-18 20:09:44,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084275415] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:44,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:44,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-18 20:09:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182698608] [2022-11-18 20:09:44,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:44,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 20:09:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 20:09:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 20:09:44,814 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-18 20:09:44,817 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-18 20:09:44,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:44,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-18 20:09:44,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:44,991 INFO L130 PetriNetUnfolder]: 30/421 cut-off events. [2022-11-18 20:09:44,991 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-11-18 20:09:44,993 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 693 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-18 20:09:44,994 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 20 selfloop transitions, 9 changer transitions 0/218 dead transitions. [2022-11-18 20:09:44,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 218 transitions, 529 flow [2022-11-18 20:09:44,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 20:09:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 20:09:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1921 transitions. [2022-11-18 20:09:45,000 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9320718098010674 [2022-11-18 20:09:45,000 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1921 transitions. [2022-11-18 20:09:45,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1921 transitions. [2022-11-18 20:09:45,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:45,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1921 transitions. [2022-11-18 20:09:45,006 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-18 20:09:45,009 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-18 20:09:45,011 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-18 20:09:45,011 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 421 flow. Second operand 9 states and 1921 transitions. [2022-11-18 20:09:45,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 218 transitions, 529 flow [2022-11-18 20:09:45,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 218 transitions, 527 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:09:45,016 INFO L231 Difference]: Finished difference. Result has 214 places, 207 transitions, 469 flow [2022-11-18 20:09:45,017 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-18 20:09:45,020 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 3 predicate places. [2022-11-18 20:09:45,020 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 207 transitions, 469 flow [2022-11-18 20:09:45,023 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-18 20:09:45,023 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:45,024 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-18 20:09:45,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:45,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:45,236 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-18 20:09:45,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash -185463623, now seen corresponding path program 2 times [2022-11-18 20:09:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:45,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757571223] [2022-11-18 20:09:45,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:45,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:45,491 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-18 20:09:45,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:45,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757571223] [2022-11-18 20:09:45,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757571223] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:09:45,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:09:45,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 20:09:45,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683574013] [2022-11-18 20:09:45,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:09:45,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 20:09:45,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:45,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 20:09:45,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 20:09:45,494 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 229 [2022-11-18 20:09:45,495 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-18 20:09:45,495 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:45,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 229 [2022-11-18 20:09:45,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:45,644 INFO L130 PetriNetUnfolder]: 25/609 cut-off events. [2022-11-18 20:09:45,645 INFO L131 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-11-18 20:09:45,647 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 1303 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-18 20:09:45,648 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 12 selfloop transitions, 3 changer transitions 3/209 dead transitions. [2022-11-18 20:09:45,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 508 flow [2022-11-18 20:09:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 20:09:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 20:09:45,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 639 transitions. [2022-11-18 20:09:45,650 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9301310043668122 [2022-11-18 20:09:45,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 639 transitions. [2022-11-18 20:09:45,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 639 transitions. [2022-11-18 20:09:45,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:45,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 639 transitions. [2022-11-18 20:09:45,653 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-18 20:09:45,654 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-18 20:09:45,655 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-18 20:09:45,655 INFO L175 Difference]: Start difference. First operand has 214 places, 207 transitions, 469 flow. Second operand 3 states and 639 transitions. [2022-11-18 20:09:45,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 508 flow [2022-11-18 20:09:45,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 209 transitions, 502 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-11-18 20:09:45,663 INFO L231 Difference]: Finished difference. Result has 215 places, 204 transitions, 463 flow [2022-11-18 20:09:45,663 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-18 20:09:45,666 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 4 predicate places. [2022-11-18 20:09:45,666 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 204 transitions, 463 flow [2022-11-18 20:09:45,667 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-18 20:09:45,667 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:45,667 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-18 20:09:45,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 20:09:45,668 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-18 20:09:45,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1279925599, now seen corresponding path program 1 times [2022-11-18 20:09:45,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:45,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795853904] [2022-11-18 20:09:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:46,099 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-18 20:09:46,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795853904] [2022-11-18 20:09:46,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795853904] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:46,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123703584] [2022-11-18 20:09:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:46,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:46,103 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:46,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 20:09:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:46,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-18 20:09:46,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:46,521 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-18 20:09:46,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:46,740 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-18 20:09:46,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123703584] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:46,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:46,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-18 20:09:46,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31236723] [2022-11-18 20:09:46,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:46,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-18 20:09:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-18 20:09:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-18 20:09:46,749 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-18 20:09:46,754 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-18 20:09:46,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:46,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-18 20:09:46,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:47,159 INFO L130 PetriNetUnfolder]: 58/745 cut-off events. [2022-11-18 20:09:47,160 INFO L131 PetriNetUnfolder]: For 37/37 co-relation queries the response was YES. [2022-11-18 20:09:47,162 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 1394 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-18 20:09:47,164 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 40 selfloop transitions, 21 changer transitions 1/247 dead transitions. [2022-11-18 20:09:47,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 247 transitions, 761 flow [2022-11-18 20:09:47,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-18 20:09:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-11-18 20:09:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4475 transitions. [2022-11-18 20:09:47,173 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9305468912455812 [2022-11-18 20:09:47,173 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4475 transitions. [2022-11-18 20:09:47,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4475 transitions. [2022-11-18 20:09:47,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:47,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4475 transitions. [2022-11-18 20:09:47,187 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-18 20:09:47,196 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-18 20:09:47,199 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-18 20:09:47,199 INFO L175 Difference]: Start difference. First operand has 215 places, 204 transitions, 463 flow. Second operand 21 states and 4475 transitions. [2022-11-18 20:09:47,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 247 transitions, 761 flow [2022-11-18 20:09:47,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 247 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 20:09:47,205 INFO L231 Difference]: Finished difference. Result has 236 places, 216 transitions, 588 flow [2022-11-18 20:09:47,206 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-18 20:09:47,207 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 25 predicate places. [2022-11-18 20:09:47,207 INFO L495 AbstractCegarLoop]: Abstraction has has 236 places, 216 transitions, 588 flow [2022-11-18 20:09:47,208 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-18 20:09:47,209 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:47,209 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-18 20:09:47,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 20:09:47,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-18 20:09:47,415 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-18 20:09:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:47,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1142080485, now seen corresponding path program 2 times [2022-11-18 20:09:47,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:47,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724819009] [2022-11-18 20:09:47,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:47,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:48,304 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-18 20:09:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724819009] [2022-11-18 20:09:48,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724819009] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:48,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568499465] [2022-11-18 20:09:48,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 20:09:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:48,307 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:48,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 20:09:48,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 20:09:48,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:09:48,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-18 20:09:48,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:48,991 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-18 20:09:48,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:49,644 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-18 20:09:49,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568499465] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:09:49,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:09:49,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-11-18 20:09:49,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524211186] [2022-11-18 20:09:49,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:09:49,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-18 20:09:49,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:09:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-18 20:09:49,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-11-18 20:09:49,660 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-18 20:09:49,671 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-18 20:09:49,671 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:09:49,671 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-18 20:09:49,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:09:50,847 INFO L130 PetriNetUnfolder]: 114/1391 cut-off events. [2022-11-18 20:09:50,847 INFO L131 PetriNetUnfolder]: For 465/465 co-relation queries the response was YES. [2022-11-18 20:09:50,850 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 2838 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-18 20:09:50,854 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 80 selfloop transitions, 45 changer transitions 0/310 dead transitions. [2022-11-18 20:09:50,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 310 transitions, 1326 flow [2022-11-18 20:09:50,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-18 20:09:50,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2022-11-18 20:09:50,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 9583 transitions. [2022-11-18 20:09:50,874 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9299369238233867 [2022-11-18 20:09:50,874 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 9583 transitions. [2022-11-18 20:09:50,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 9583 transitions. [2022-11-18 20:09:50,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:09:50,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 9583 transitions. [2022-11-18 20:09:50,909 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-18 20:09:50,928 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-18 20:09:50,932 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-18 20:09:50,932 INFO L175 Difference]: Start difference. First operand has 236 places, 216 transitions, 588 flow. Second operand 45 states and 9583 transitions. [2022-11-18 20:09:50,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 310 transitions, 1326 flow [2022-11-18 20:09:50,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 310 transitions, 1286 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-18 20:09:50,944 INFO L231 Difference]: Finished difference. Result has 282 places, 241 transitions, 866 flow [2022-11-18 20:09:50,945 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-18 20:09:50,947 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 71 predicate places. [2022-11-18 20:09:50,948 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 241 transitions, 866 flow [2022-11-18 20:09:50,951 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-18 20:09:50,951 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:09:50,952 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-18 20:09:50,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-18 20:09:51,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:51,159 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-18 20:09:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:09:51,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1778850809, now seen corresponding path program 3 times [2022-11-18 20:09:51,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:09:51,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969490539] [2022-11-18 20:09:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:09:51,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:09:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:09:53,858 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-18 20:09:53,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:09:53,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969490539] [2022-11-18 20:09:53,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969490539] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:09:53,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760245017] [2022-11-18 20:09:53,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:09:53,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:09:53,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:09:53,875 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:09:53,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 20:09:54,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-18 20:09:54,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:09:54,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-18 20:09:54,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:09:57,779 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-18 20:09:57,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:57,888 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-18 20:09:58,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:09:58,174 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:09:58,174 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-18 20:09:58,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:09:58,259 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-18 20:09:58,289 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-18 20:09:58,328 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-18 20:09:58,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:09:58,910 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:58,911 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 22 treesize of output 23 [2022-11-18 20:09:58,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:09:58,933 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 36 treesize of output 35 [2022-11-18 20:09:58,980 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 7 treesize of output 3 [2022-11-18 20:10:00,024 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-18 20:10:00,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760245017] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:00,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:00,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 14, 12] total 55 [2022-11-18 20:10:00,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845841697] [2022-11-18 20:10:00,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:00,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-18 20:10:00,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:00,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-18 20:10:00,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=2587, Unknown=4, NotChecked=0, Total=2970 [2022-11-18 20:10:00,038 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 229 [2022-11-18 20:10:00,045 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 241 transitions, 866 flow. Second operand has 55 states, 55 states have (on average 164.74545454545455) internal successors, (9061), 55 states have internal predecessors, (9061), 0 states have call successors, (0), 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-18 20:10:00,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:10:00,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 229 [2022-11-18 20:10:00,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:10:18,127 INFO L130 PetriNetUnfolder]: 2125/7556 cut-off events. [2022-11-18 20:10:18,127 INFO L131 PetriNetUnfolder]: For 2828/2828 co-relation queries the response was YES. [2022-11-18 20:10:18,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15817 conditions, 7556 events. 2125/7556 cut-off events. For 2828/2828 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 40106 event pairs, 31 based on Foata normal form. 8/7464 useless extension candidates. Maximal degree in co-relation 15794. Up to 687 conditions per place. [2022-11-18 20:10:18,291 INFO L137 encePairwiseOnDemand]: 206/229 looper letters, 871 selfloop transitions, 374 changer transitions 0/1377 dead transitions. [2022-11-18 20:10:18,292 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 465 places, 1377 transitions, 6630 flow [2022-11-18 20:10:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-11-18 20:10:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2022-11-18 20:10:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 30167 transitions. [2022-11-18 20:10:18,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7159436111638504 [2022-11-18 20:10:18,360 INFO L72 ComplementDD]: Start complementDD. Operand 184 states and 30167 transitions. [2022-11-18 20:10:18,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 30167 transitions. [2022-11-18 20:10:18,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:10:18,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 184 states and 30167 transitions. [2022-11-18 20:10:18,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 185 states, 184 states have (on average 163.95108695652175) internal successors, (30167), 184 states have internal predecessors, (30167), 0 states have call successors, (0), 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-18 20:10:18,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 185 states, 185 states have (on average 229.0) internal successors, (42365), 185 states have internal predecessors, (42365), 0 states have call successors, (0), 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-18 20:10:18,549 INFO L81 ComplementDD]: Finished complementDD. Result has 185 states, 185 states have (on average 229.0) internal successors, (42365), 185 states have internal predecessors, (42365), 0 states have call successors, (0), 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-18 20:10:18,549 INFO L175 Difference]: Start difference. First operand has 282 places, 241 transitions, 866 flow. Second operand 184 states and 30167 transitions. [2022-11-18 20:10:18,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 465 places, 1377 transitions, 6630 flow [2022-11-18 20:10:18,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 1377 transitions, 6515 flow, removed 22 selfloop flow, removed 18 redundant places. [2022-11-18 20:10:18,595 INFO L231 Difference]: Finished difference. Result has 516 places, 646 transitions, 3382 flow [2022-11-18 20:10:18,596 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=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=184, PETRI_FLOW=3382, PETRI_PLACES=516, PETRI_TRANSITIONS=646} [2022-11-18 20:10:18,597 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 305 predicate places. [2022-11-18 20:10:18,597 INFO L495 AbstractCegarLoop]: Abstraction has has 516 places, 646 transitions, 3382 flow [2022-11-18 20:10:18,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 164.74545454545455) internal successors, (9061), 55 states have internal predecessors, (9061), 0 states have call successors, (0), 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-18 20:10:18,600 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:10:18,601 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-18 20:10:18,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:18,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:18,808 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-18 20:10:18,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash -426103930, now seen corresponding path program 1 times [2022-11-18 20:10:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:18,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755436656] [2022-11-18 20:10:18,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:21,494 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-18 20:10:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:21,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755436656] [2022-11-18 20:10:21,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755436656] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:10:21,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598858218] [2022-11-18 20:10:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:10:21,497 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:10:21,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 20:10:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:21,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 1372 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-18 20:10:21,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:22,651 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-18 20:10:22,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:24,035 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-18 20:10:24,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598858218] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:24,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:24,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 43 [2022-11-18 20:10:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238069917] [2022-11-18 20:10:24,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:24,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-18 20:10:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:24,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-18 20:10:24,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2022-11-18 20:10:24,049 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 229 [2022-11-18 20:10:24,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 646 transitions, 3382 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-18 20:10:24,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:10:24,057 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 229 [2022-11-18 20:10:24,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:10:27,729 INFO L130 PetriNetUnfolder]: 589/5094 cut-off events. [2022-11-18 20:10:27,729 INFO L131 PetriNetUnfolder]: For 64984/64984 co-relation queries the response was YES. [2022-11-18 20:10:27,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16043 conditions, 5094 events. 589/5094 cut-off events. For 64984/64984 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 22724 event pairs, 7 based on Foata normal form. 24/5110 useless extension candidates. Maximal degree in co-relation 15950. Up to 316 conditions per place. [2022-11-18 20:10:27,781 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 105 selfloop transitions, 110 changer transitions 0/754 dead transitions. [2022-11-18 20:10:27,782 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 754 transitions, 4444 flow [2022-11-18 20:10:27,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-11-18 20:10:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-11-18 20:10:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 12769 transitions. [2022-11-18 20:10:27,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9293304221251819 [2022-11-18 20:10:27,796 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 12769 transitions. [2022-11-18 20:10:27,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 12769 transitions. [2022-11-18 20:10:27,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:10:27,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 12769 transitions. [2022-11-18 20:10:27,817 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-18 20:10:27,831 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-18 20:10:27,835 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-18 20:10:27,835 INFO L175 Difference]: Start difference. First operand has 516 places, 646 transitions, 3382 flow. Second operand 60 states and 12769 transitions. [2022-11-18 20:10:27,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 754 transitions, 4444 flow [2022-11-18 20:10:28,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 754 transitions, 4258 flow, removed 4 selfloop flow, removed 48 redundant places. [2022-11-18 20:10:28,077 INFO L231 Difference]: Finished difference. Result has 532 places, 661 transitions, 3634 flow [2022-11-18 20:10:28,078 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3196, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=548, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3634, PETRI_PLACES=532, PETRI_TRANSITIONS=661} [2022-11-18 20:10:28,079 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 321 predicate places. [2022-11-18 20:10:28,079 INFO L495 AbstractCegarLoop]: Abstraction has has 532 places, 661 transitions, 3634 flow [2022-11-18 20:10:28,081 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-18 20:10:28,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:10:28,082 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-18 20:10:28,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 20:10:28,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-18 20:10:28,289 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-18 20:10:28,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:28,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1774851054, now seen corresponding path program 2 times [2022-11-18 20:10:28,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:28,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060993542] [2022-11-18 20:10:28,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:28,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:34,217 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-18 20:10:34,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:34,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060993542] [2022-11-18 20:10:34,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060993542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 20:10:34,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 20:10:34,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-11-18 20:10:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924990077] [2022-11-18 20:10:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 20:10:34,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-18 20:10:34,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:34,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-18 20:10:34,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-11-18 20:10:34,226 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 229 [2022-11-18 20:10:34,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 661 transitions, 3634 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-18 20:10:34,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:10:34,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 229 [2022-11-18 20:10:34,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:10:39,294 INFO L130 PetriNetUnfolder]: 2093/8376 cut-off events. [2022-11-18 20:10:39,294 INFO L131 PetriNetUnfolder]: For 90156/90156 co-relation queries the response was YES. [2022-11-18 20:10:39,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27690 conditions, 8376 events. 2093/8376 cut-off events. For 90156/90156 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 43588 event pairs, 1290 based on Foata normal form. 4/8345 useless extension candidates. Maximal degree in co-relation 27593. Up to 4581 conditions per place. [2022-11-18 20:10:39,368 INFO L137 encePairwiseOnDemand]: 212/229 looper letters, 405 selfloop transitions, 22 changer transitions 0/674 dead transitions. [2022-11-18 20:10:39,368 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 674 transitions, 4643 flow [2022-11-18 20:10:39,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-18 20:10:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-11-18 20:10:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2469 transitions. [2022-11-18 20:10:39,372 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7187772925764192 [2022-11-18 20:10:39,372 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2469 transitions. [2022-11-18 20:10:39,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2469 transitions. [2022-11-18 20:10:39,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:10:39,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2469 transitions. [2022-11-18 20:10:39,377 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-18 20:10:39,380 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-18 20:10:39,381 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-18 20:10:39,381 INFO L175 Difference]: Start difference. First operand has 532 places, 661 transitions, 3634 flow. Second operand 15 states and 2469 transitions. [2022-11-18 20:10:39,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 674 transitions, 4643 flow [2022-11-18 20:10:39,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 496 places, 674 transitions, 4407 flow, removed 21 selfloop flow, removed 49 redundant places. [2022-11-18 20:10:39,687 INFO L231 Difference]: Finished difference. Result has 502 places, 665 transitions, 3619 flow [2022-11-18 20:10:39,688 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3366, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=635, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3619, PETRI_PLACES=502, PETRI_TRANSITIONS=665} [2022-11-18 20:10:39,689 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 291 predicate places. [2022-11-18 20:10:39,689 INFO L495 AbstractCegarLoop]: Abstraction has has 502 places, 665 transitions, 3619 flow [2022-11-18 20:10:39,690 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-18 20:10:39,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:10:39,690 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-18 20:10:39,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 20:10:39,691 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-18 20:10:39,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:10:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 256012347, now seen corresponding path program 3 times [2022-11-18 20:10:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:10:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624273944] [2022-11-18 20:10:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:10:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:10:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:10:46,563 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-18 20:10:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:10:46,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624273944] [2022-11-18 20:10:46,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624273944] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:10:46,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876818282] [2022-11-18 20:10:46,564 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-18 20:10:46,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:10:46,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:10:46,568 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:10:46,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 20:10:47,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-18 20:10:47,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:10:47,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 76 conjunts are in the unsatisfiable core [2022-11-18 20:10:47,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:10:51,429 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-18 20:10:51,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:51,509 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-18 20:10:51,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:10:51,810 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:10:51,811 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-18 20:10:51,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:51,893 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-18 20:10:52,143 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 34 treesize of output 18 [2022-11-18 20:10:52,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:52,274 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-18 20:10:52,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:10:52,568 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:10:52,568 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-18 20:10:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:10:52,639 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-18 20:10:52,698 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-18 20:10:52,733 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-18 20:10:52,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:10:53,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1) 20))))) is different from false [2022-11-18 20:10:53,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 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|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= v_ArrVal_1664 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1) 20))))) is different from false [2022-11-18 20:10:53,228 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 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|) v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1) v_ArrVal_1664) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1) 20))))) is different from false [2022-11-18 20:10:53,248 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_1664) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse2 .cse3))) (not (= (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse3) 20)))))) is different from false [2022-11-18 20:10:53,351 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (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 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1664) (not (= (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1) 20)))))) is different from false [2022-11-18 20:10:53,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 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 ((.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 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1664) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1))))))) is different from false [2022-11-18 20:10:53,471 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 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_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| Int)) (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660))) (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 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1664) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1))))))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse3)))))) is different from false [2022-11-18 20:10:53,544 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| Int) (v_ArrVal_1660 Int) (v_ArrVal_1665 (Array Int Int)) (v_ArrVal_1662 Int) (v_ArrVal_1664 Int) (v_ArrVal_1666 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| 4)) v_ArrVal_1660)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|))) (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 v_ArrVal_1664)) |c_~#stored_elements~0.base| v_ArrVal_1665) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_139| 4)) v_ArrVal_1666) .cse1))) (< (+ (select .cse2 .cse3) 1) v_ArrVal_1664) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_142| (select .cse4 .cse3)))))))) is different from false [2022-11-18 20:10:56,226 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:56,226 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 184 treesize of output 134 [2022-11-18 20:10:56,240 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:56,241 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 262 treesize of output 262 [2022-11-18 20:10:56,277 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 173 treesize of output 165 [2022-11-18 20:10:56,288 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 191 treesize of output 175 [2022-11-18 20:10:56,313 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-18 20:10:56,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:10:56,410 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 78 treesize of output 74 [2022-11-18 20:10:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5890 backedges. 565 proven. 420 refuted. 159 times theorem prover too weak. 4318 trivial. 428 not checked. [2022-11-18 20:10:59,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876818282] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:10:59,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:10:59,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20, 22] total 56 [2022-11-18 20:10:59,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786647867] [2022-11-18 20:10:59,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:10:59,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 20:10:59,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:10:59,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 20:10:59,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1870, Unknown=13, NotChecked=792, Total=3080 [2022-11-18 20:10:59,657 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 229 [2022-11-18 20:10:59,663 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 665 transitions, 3619 flow. Second operand has 56 states, 56 states have (on average 165.80357142857142) internal successors, (9285), 56 states have internal predecessors, (9285), 0 states have call successors, (0), 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-18 20:10:59,663 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:10:59,663 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 229 [2022-11-18 20:10:59,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:11:11,704 INFO L130 PetriNetUnfolder]: 4535/17080 cut-off events. [2022-11-18 20:11:11,705 INFO L131 PetriNetUnfolder]: For 320969/320969 co-relation queries the response was YES. [2022-11-18 20:11:11,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58323 conditions, 17080 events. 4535/17080 cut-off events. For 320969/320969 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 109612 event pairs, 64 based on Foata normal form. 237/17242 useless extension candidates. Maximal degree in co-relation 58223. Up to 3541 conditions per place. [2022-11-18 20:11:11,864 INFO L137 encePairwiseOnDemand]: 205/229 looper letters, 239 selfloop transitions, 683 changer transitions 0/1169 dead transitions. [2022-11-18 20:11:11,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 533 places, 1169 transitions, 7674 flow [2022-11-18 20:11:11,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-18 20:11:11,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-11-18 20:11:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 5380 transitions. [2022-11-18 20:11:11,871 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7341703056768559 [2022-11-18 20:11:11,871 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 5380 transitions. [2022-11-18 20:11:11,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 5380 transitions. [2022-11-18 20:11:11,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:11:11,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 5380 transitions. [2022-11-18 20:11:11,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 168.125) internal successors, (5380), 32 states have internal predecessors, (5380), 0 states have call successors, (0), 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-18 20:11:11,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 229.0) internal successors, (7557), 33 states have internal predecessors, (7557), 0 states have call successors, (0), 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-18 20:11:11,888 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 229.0) internal successors, (7557), 33 states have internal predecessors, (7557), 0 states have call successors, (0), 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-18 20:11:11,889 INFO L175 Difference]: Start difference. First operand has 502 places, 665 transitions, 3619 flow. Second operand 32 states and 5380 transitions. [2022-11-18 20:11:11,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 533 places, 1169 transitions, 7674 flow [2022-11-18 20:11:12,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 1169 transitions, 7521 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-11-18 20:11:12,397 INFO L231 Difference]: Finished difference. Result has 545 places, 1070 transitions, 7946 flow [2022-11-18 20:11:12,398 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=3468, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=7946, PETRI_PLACES=545, PETRI_TRANSITIONS=1070} [2022-11-18 20:11:12,398 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 334 predicate places. [2022-11-18 20:11:12,398 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 1070 transitions, 7946 flow [2022-11-18 20:11:12,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 165.80357142857142) internal successors, (9285), 56 states have internal predecessors, (9285), 0 states have call successors, (0), 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-18 20:11:12,400 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:11:12,400 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, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:11:12,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 20:11:12,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:12,601 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-18 20:11:12,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:11:12,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1217067851, now seen corresponding path program 4 times [2022-11-18 20:11:12,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:11:12,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374339814] [2022-11-18 20:11:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:11:12,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:11:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 20:11:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6106 backedges. 3677 proven. 360 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2022-11-18 20:11:22,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 20:11:22,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374339814] [2022-11-18 20:11:22,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374339814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 20:11:22,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800789814] [2022-11-18 20:11:22,850 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-18 20:11:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 20:11:22,851 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 20:11:22,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 20:11:22,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 20:11:30,801 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-18 20:11:30,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 20:11:30,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1663 conjuncts, 109 conjunts are in the unsatisfiable core [2022-11-18 20:11:30,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 20:11:33,887 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-18 20:11:33,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:33,988 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-18 20:11:34,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:34,364 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:11:34,364 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-18 20:11:34,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:34,453 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-18 20:11:34,724 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-18 20:11:34,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:34,855 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-18 20:11:35,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:35,258 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:11:35,259 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-18 20:11:35,348 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:35,349 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-18 20:11:35,645 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-18 20:11:35,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:35,795 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-18 20:11:36,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:36,248 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-18 20:11:36,249 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-18 20:11:36,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:36,352 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-18 20:11:36,697 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-18 20:11:36,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:36,872 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-18 20:11:37,155 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:11:37,165 INFO L321 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-18 20:11:37,165 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-18 20:11:37,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:11:37,229 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-18 20:11:37,253 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-18 20:11:37,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6106 backedges. 3590 proven. 501 refuted. 0 times theorem prover too weak. 2015 trivial. 0 not checked. [2022-11-18 20:11:37,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 20:11:37,722 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20))))) is different from false [2022-11-18 20:11:37,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 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|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1)))))) is different from false [2022-11-18 20:11:37,816 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 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_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1)))))) is different from false [2022-11-18 20:11:37,830 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 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 .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1)))))) is different from false [2022-11-18 20:11:37,909 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 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_2067) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1)))))) is different from false [2022-11-18 20:11:37,973 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 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_2064)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2067) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1)))))) is different from false [2022-11-18 20:11:37,999 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (v_ArrVal_2072 Int)) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2064))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2067) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (or (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse2 .cse3))))))))) is different from false [2022-11-18 20:11:38,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2072 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2064))) (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2067) .cse3 (+ (select .cse4 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse3))) (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)))))) is different from false [2022-11-18 20:11:38,996 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int)) (let ((.cse3 (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_2063))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2067) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse2 .cse1)))))))) is different from false [2022-11-18 20:11:39,307 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (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_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2067) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (= (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1)))))))) is different from false [2022-11-18 20:11:39,413 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int)) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse5 (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_2058)) (.cse6 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) .cse6 (+ (select .cse5 .cse6) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse3 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse3 |c_~#queue~0.base| (let ((.cse4 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse4 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2067) .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse2 .cse1))) (not (= (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20))))))) is different from false [2022-11-18 20:11:39,456 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse7 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2058))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2060) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse2 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2067) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse3))) (not (= 20 (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse3))))))))))) is different from false [2022-11-18 20:11:39,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse5 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse7 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2058))) (store (store .cse7 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2060) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse6 (+ 88 |c_~#queue~0.offset|) v_ArrVal_2067) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1))))))))) is different from false [2022-11-18 20:11:41,431 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2058))) (store (store .cse8 .cse6 v_ArrVal_2060) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse5 .cse6 v_ArrVal_2067) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse3 .cse1)))))))))) is different from false [2022-11-18 20:11:41,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int) (v_ArrVal_2051 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (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_2051)) (.cse10 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse9 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053) .cse10 (+ (select .cse9 .cse10) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse0 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store (store .cse7 |c_~#queue~0.base| (let ((.cse8 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2058))) (store (store .cse8 .cse6 v_ArrVal_2060) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse2 (select .cse4 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse5 .cse6 v_ArrVal_2067) .cse1 (+ (select .cse5 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse2 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse3 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20))))))))) is different from false [2022-11-18 20:11:41,688 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| (select .cse0 .cse1))) (forall ((v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int) (v_ArrVal_2051 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2051))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_2053) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2058))) (store (store .cse10 .cse8 v_ArrVal_2060) .cse3 (+ (select .cse10 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse4 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse7 .cse8 v_ArrVal_2067) .cse3 (+ (select .cse7 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse4 .cse3))) (not (= (select (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse3) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse5 .cse3))))))))))))) is different from false [2022-11-18 20:11:41,806 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| Int) (v_ArrVal_2051 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|)) (.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_#in~q#1.base| (let ((.cse11 (store .cse2 (+ |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| 4)) v_ArrVal_2051))) (store (store .cse11 (+ 88 |c_t1Thread1of1ForFork0_enqueue_#in~q#1.offset|) v_ArrVal_2053) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056))) (let ((.cse8 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (let ((.cse10 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2058))) (store (store .cse10 .cse8 v_ArrVal_2060) .cse1 (+ (select .cse10 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse7 .cse8 v_ArrVal_2067) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| (select .cse2 .cse3))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse4 .cse1))) (not (= 20 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse5 .cse1))))))))))) is different from false [2022-11-18 20:11:42,740 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2049 (Array Int Int)) (v_ArrVal_2056 (Array Int Int)) (v_ArrVal_2063 (Array Int Int)) (v_ArrVal_2072 Int) (v_ArrVal_2060 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| Int) (v_ArrVal_2051 Int) (v_ArrVal_2070 (Array Int Int)) (v_ArrVal_2053 Int) (v_ArrVal_2064 Int) (v_ArrVal_2067 Int) (v_ArrVal_2058 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| Int)) (let ((.cse10 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_2049))) (let ((.cse7 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse2 (select .cse10 |c_~#queue~0.base|))) (let ((.cse8 (store (store .cse10 |c_~#queue~0.base| (let ((.cse11 (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| 4)) v_ArrVal_2051))) (store (store .cse11 .cse7 v_ArrVal_2053) .cse1 (+ (select .cse11 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2056))) (let ((.cse4 (select .cse8 |c_~#queue~0.base|))) (let ((.cse5 (store (store .cse8 |c_~#queue~0.base| (let ((.cse9 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| 4) |c_~#queue~0.offset|) v_ArrVal_2058))) (store (store .cse9 .cse7 v_ArrVal_2060) .cse1 (+ (select .cse9 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2063))) (let ((.cse0 (select .cse5 |c_~#queue~0.base|))) (let ((.cse3 (select (store (store .cse5 |c_~#queue~0.base| (let ((.cse6 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| 4) |c_~#queue~0.offset|) v_ArrVal_2064))) (store (store .cse6 .cse7 v_ArrVal_2067) .cse1 (+ (select .cse6 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_2070) |c_~#queue~0.base|))) (or (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_215| (select .cse0 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_221| (select .cse2 .cse1))) (not (= (select (store .cse3 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| 4) |c_~#queue~0.offset|) v_ArrVal_2072) .cse1) 20)) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_212| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_218| (select .cse4 .cse1)))))))))))) is different from false [2022-11-18 20:11:43,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:43,056 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 2169 treesize of output 1509 [2022-11-18 20:11:43,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:43,119 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 2079 treesize of output 2053 [2022-11-18 20:11:43,156 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 2003 treesize of output 1983 [2022-11-18 20:11:43,200 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 1731 treesize of output 1667 [2022-11-18 20:11:43,245 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 2016 treesize of output 1968 [2022-11-18 20:11:43,296 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 2075 treesize of output 2043 [2022-11-18 20:11:43,403 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-18 20:11:43,809 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:11:43,809 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 411 treesize of output 395 [2022-11-18 20:11:45,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6106 backedges. 2968 proven. 357 refuted. 1 times theorem prover too weak. 2069 trivial. 711 not checked. [2022-11-18 20:11:45,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800789814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 20:11:45,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 20:11:45,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 40] total 97 [2022-11-18 20:11:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263720383] [2022-11-18 20:11:45,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 20:11:45,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-11-18 20:11:45,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 20:11:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-11-18 20:11:45,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=5121, Unknown=58, NotChecked=3078, Total=9312 [2022-11-18 20:11:45,962 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 229 [2022-11-18 20:11:45,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 1070 transitions, 7946 flow. Second operand has 97 states, 97 states have (on average 166.79381443298968) internal successors, (16179), 97 states have internal predecessors, (16179), 0 states have call successors, (0), 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-18 20:11:45,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 20:11:45,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 229 [2022-11-18 20:11:45,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 20:12:41,279 INFO L130 PetriNetUnfolder]: 10973/43323 cut-off events. [2022-11-18 20:12:41,279 INFO L131 PetriNetUnfolder]: For 957935/958101 co-relation queries the response was YES. [2022-11-18 20:12:41,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199218 conditions, 43323 events. 10973/43323 cut-off events. For 957935/958101 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 374039 event pairs, 345 based on Foata normal form. 442/43541 useless extension candidates. Maximal degree in co-relation 199099. Up to 8849 conditions per place. [2022-11-18 20:12:41,914 INFO L137 encePairwiseOnDemand]: 207/229 looper letters, 456 selfloop transitions, 1526 changer transitions 0/2231 dead transitions. [2022-11-18 20:12:41,915 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 2231 transitions, 20801 flow [2022-11-18 20:12:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-11-18 20:12:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-11-18 20:12:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 12910 transitions. [2022-11-18 20:12:41,929 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7417834980464261 [2022-11-18 20:12:41,929 INFO L72 ComplementDD]: Start complementDD. Operand 76 states and 12910 transitions. [2022-11-18 20:12:41,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 12910 transitions. [2022-11-18 20:12:41,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 20:12:41,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 76 states and 12910 transitions. [2022-11-18 20:12:41,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 77 states, 76 states have (on average 169.8684210526316) internal successors, (12910), 76 states have internal predecessors, (12910), 0 states have call successors, (0), 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-18 20:12:41,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 77 states, 77 states have (on average 229.0) internal successors, (17633), 77 states have internal predecessors, (17633), 0 states have call successors, (0), 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-18 20:12:41,969 INFO L81 ComplementDD]: Finished complementDD. Result has 77 states, 77 states have (on average 229.0) internal successors, (17633), 77 states have internal predecessors, (17633), 0 states have call successors, (0), 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-18 20:12:41,970 INFO L175 Difference]: Start difference. First operand has 545 places, 1070 transitions, 7946 flow. Second operand 76 states and 12910 transitions. [2022-11-18 20:12:41,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 2231 transitions, 20801 flow [2022-11-18 20:12:43,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 583 places, 2231 transitions, 18966 flow, removed 737 selfloop flow, removed 37 redundant places. [2022-11-18 20:12:43,164 INFO L231 Difference]: Finished difference. Result has 616 places, 1947 transitions, 18145 flow [2022-11-18 20:12:43,165 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=7175, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1070, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=720, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=18145, PETRI_PLACES=616, PETRI_TRANSITIONS=1947} [2022-11-18 20:12:43,166 INFO L288 CegarLoopForPetriNet]: 211 programPoint places, 405 predicate places. [2022-11-18 20:12:43,166 INFO L495 AbstractCegarLoop]: Abstraction has has 616 places, 1947 transitions, 18145 flow [2022-11-18 20:12:43,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 166.79381443298968) internal successors, (16179), 97 states have internal predecessors, (16179), 0 states have call successors, (0), 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-18 20:12:43,168 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 20:12:43,168 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, 16, 16, 16, 16, 16, 16, 16, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 20:12:43,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 20:12:43,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3db84f7-402e-4178-a191-fae13064aecf/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 20:12:43,369 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-11-18 20:12:43,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 20:12:43,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2140902243, now seen corresponding path program 5 times [2022-11-18 20:12:43,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 20:12:43,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065343286] [2022-11-18 20:12:43,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 20:12:43,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 20:12:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat