./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/mutex-meet/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version bcb38a6f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i ./goblint.2024-05-21_14-57-05.files/mutex-meet/circular_buffer_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-bcb38a6-m [2024-06-03 21:03:30,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-03 21:03:30,828 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-03 21:03:30,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-03 21:03:30,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-03 21:03:30,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-03 21:03:30,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-03 21:03:30,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-03 21:03:30,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-03 21:03:30,869 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-03 21:03:30,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-03 21:03:30,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-03 21:03:30,870 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-03 21:03:30,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-03 21:03:30,871 INFO L153 SettingsManager]: * Use SBE=true [2024-06-03 21:03:30,871 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-03 21:03:30,871 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-03 21:03:30,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-03 21:03:30,872 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-03 21:03:30,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-03 21:03:30,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-03 21:03:30,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-03 21:03:30,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-03 21:03:30,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-03 21:03:30,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-03 21:03:30,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-03 21:03:30,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-03 21:03:30,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-03 21:03:30,875 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-03 21:03:30,875 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-03 21:03:30,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-03 21:03:30,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-03 21:03:30,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:03:30,876 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-03 21:03:30,877 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-03 21:03:30,877 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-03 21:03:30,877 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-03 21:03:30,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-03 21:03:30,888 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-03 21:03:30,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-03 21:03:30,888 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-03 21:03:30,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-03 21:03:30,889 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-03 21:03:30,889 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-03 21:03:31,226 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-03 21:03:31,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-03 21:03:31,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-03 21:03:31,252 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-03 21:03:31,253 INFO L274 PluginConnector]: CDTParser initialized [2024-06-03 21:03:31,253 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-03 21:03:32,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-03 21:03:32,554 INFO L384 CDTParser]: Found 1 translation units. [2024-06-03 21:03:32,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-03 21:03:32,568 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41212482/89821afb49fd4d98b20a372f7f1c226d/FLAG2b5155579 [2024-06-03 21:03:32,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e41212482/89821afb49fd4d98b20a372f7f1c226d [2024-06-03 21:03:32,580 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-03 21:03:32,581 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-03 21:03:32,581 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/circular_buffer_ok.yml/witness.yml [2024-06-03 21:03:32,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-03 21:03:32,677 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-03 21:03:32,679 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-03 21:03:32,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-03 21:03:32,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-03 21:03:32,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:03:32" (1/2) ... [2024-06-03 21:03:32,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b458c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:03:32, skipping insertion in model container [2024-06-03 21:03:32,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.06 09:03:32" (1/2) ... [2024-06-03 21:03:32,686 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3ac93d45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.06 09:03:32, skipping insertion in model container [2024-06-03 21:03:32,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:03:32" (2/2) ... [2024-06-03 21:03:32,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49b458c6 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:32, skipping insertion in model container [2024-06-03 21:03:32,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:03:32" (2/2) ... [2024-06-03 21:03:32,689 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-03 21:03:32,729 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-03 21:03:32,731 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] ((! multithreaded || (m_locked || (((((((((((((((-10LL + (long long )buffer_size) + (long long )send >= 0LL && (-10LL + (long long )buffer_size) + (long long )value >= 0LL) && (-1LL + (long long )receive) + (long long )send >= 0LL) && (1LL - (long long )receive) + (long long )send >= 0LL) && (1LL - (long long )receive) + (long long )value >= 0LL) && (10LL - (long long )buffer_size) + (long long )send >= 0LL) && (10LL - (long long )buffer_size) + (long long )value >= 0LL) && (long long )send + (long long )value >= 0LL) && (-9LL + (long long )buffer_size) - (long long )receive >= 0LL) && (-4LL + (long long )buffer_size) - (long long )value >= 0LL) && (6LL + (long long )send) - (long long )value >= 0LL) && (1LL - (long long )receive) - (long long )send >= 0LL) && (7LL - (long long )receive) - (long long )value >= 0LL) && (11LL - (long long )buffer_size) - (long long )receive >= 0LL) && (16LL - (long long )buffer_size) - (long long )value >= 0LL))) && (! multithreaded || ((0 <= value && value <= 6) && value <= 127))) && (! multithreaded || (m_locked || (0 <= value && value <= 127))) [2024-06-03 21:03:32,731 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] ((! multithreaded || (m_locked || (((((((((((((((-10LL + (long long )buffer_size) + (long long )send >= 0LL && (-10LL + (long long )buffer_size) + (long long )value >= 0LL) && (-1LL + (long long )receive) + (long long )send >= 0LL) && (1LL - (long long )receive) + (long long )send >= 0LL) && (1LL - (long long )receive) + (long long )value >= 0LL) && (10LL - (long long )buffer_size) + (long long )send >= 0LL) && (10LL - (long long )buffer_size) + (long long )value >= 0LL) && (long long )send + (long long )value >= 0LL) && (-9LL + (long long )buffer_size) - (long long )receive >= 0LL) && (-4LL + (long long )buffer_size) - (long long )value >= 0LL) && (6LL + (long long )send) - (long long )value >= 0LL) && (1LL - (long long )receive) - (long long )send >= 0LL) && (7LL - (long long )receive) - (long long )value >= 0LL) && (11LL - (long long )buffer_size) - (long long )receive >= 0LL) && (16LL - (long long )buffer_size) - (long long )value >= 0LL))) && (! multithreaded || ((0 <= value && value <= 6) && value <= 127))) && (! multithreaded || (m_locked || (0 <= value && value <= 127))) [2024-06-03 21:03:32,731 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-03 21:03:32,732 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-03 21:03:32,732 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-03 21:03:32,733 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-03 21:03:32,733 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-03 21:03:32,733 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-03 21:03:32,734 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-03 21:03:32,780 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-03 21:03:33,133 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:03:33,146 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-03 21:03:33,235 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-03 21:03:33,280 INFO L206 MainTranslator]: Completed translation [2024-06-03 21:03:33,281 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33 WrapperNode [2024-06-03 21:03:33,281 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-03 21:03:33,282 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-03 21:03:33,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-03 21:03:33,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-03 21:03:33,289 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,367 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-03 21:03:33,368 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-03 21:03:33,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-03 21:03:33,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-03 21:03:33,369 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-03 21:03:33,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,394 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,411 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-06-03 21:03:33,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,427 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,434 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,443 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-03 21:03:33,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-03 21:03:33,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-03 21:03:33,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-03 21:03:33,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (1/1) ... [2024-06-03 21:03:33,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-03 21:03:33,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:33,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-03 21:03:33,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-03 21:03:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-03 21:03:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-03 21:03:33,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-03 21:03:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-03 21:03:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-03 21:03:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-03 21:03:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-03 21:03:33,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-03 21:03:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-03 21:03:33,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-03 21:03:33,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-03 21:03:33,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-03 21:03:33,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-03 21:03:33,508 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-03 21:03:33,634 INFO L244 CfgBuilder]: Building ICFG [2024-06-03 21:03:33,636 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-03 21:03:33,897 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-03 21:03:33,898 INFO L293 CfgBuilder]: Performing block encoding [2024-06-03 21:03:34,127 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-03 21:03:34,127 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-03 21:03:34,128 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:03:34 BoogieIcfgContainer [2024-06-03 21:03:34,128 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-03 21:03:34,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-03 21:03:34,129 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-03 21:03:34,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-03 21:03:34,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.06 09:03:32" (1/4) ... [2024-06-03 21:03:34,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263125a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.06 09:03:34, skipping insertion in model container [2024-06-03 21:03:34,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 03.06 09:03:32" (2/4) ... [2024-06-03 21:03:34,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263125a8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:03:34, skipping insertion in model container [2024-06-03 21:03:34,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 03.06 09:03:33" (3/4) ... [2024-06-03 21:03:34,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@263125a8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 03.06 09:03:34, skipping insertion in model container [2024-06-03 21:03:34,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.06 09:03:34" (4/4) ... [2024-06-03 21:03:34,134 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-03 21:03:34,146 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-03 21:03:34,146 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-03 21:03:34,146 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-03 21:03:34,179 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-03 21:03:34,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 74 flow [2024-06-03 21:03:34,224 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-06-03 21:03:34,225 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-03 21:03:34,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 2/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-03 21:03:34,227 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 30 transitions, 74 flow [2024-06-03 21:03:34,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 61 flow [2024-06-03 21:03:34,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-03 21:03:34,240 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@63bafc6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-03 21:03:34,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-03 21:03:34,243 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-03 21:03:34,243 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-03 21:03:34,244 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-03 21:03:34,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:34,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-03 21:03:34,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:34,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:34,248 INFO L85 PathProgramCache]: Analyzing trace with hash -300262953, now seen corresponding path program 1 times [2024-06-03 21:03:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150112619] [2024-06-03 21:03:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:34,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:34,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150112619] [2024-06-03 21:03:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150112619] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:34,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-03 21:03:34,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649499459] [2024-06-03 21:03:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:34,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:03:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:34,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:03:34,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:03:34,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 21:03:34,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:34,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:34,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 21:03:34,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:35,029 INFO L124 PetriNetUnfolderBase]: 267/482 cut-off events. [2024-06-03 21:03:35,030 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-03 21:03:35,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 482 events. 267/482 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1969 event pairs, 95 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 895. Up to 308 conditions per place. [2024-06-03 21:03:35,035 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2024-06-03 21:03:35,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 169 flow [2024-06-03 21:03:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:03:35,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:03:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-03 21:03:35,044 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-03 21:03:35,045 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 61 flow. Second operand 3 states and 54 transitions. [2024-06-03 21:03:35,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 169 flow [2024-06-03 21:03:35,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-03 21:03:35,049 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 67 flow [2024-06-03 21:03:35,051 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2024-06-03 21:03:35,053 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-06-03 21:03:35,053 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 67 flow [2024-06-03 21:03:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:35,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:35,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:35,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-03 21:03:35,054 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:35,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1606586641, now seen corresponding path program 1 times [2024-06-03 21:03:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459851368] [2024-06-03 21:03:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:35,067 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:35,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [661053262] [2024-06-03 21:03:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:35,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:35,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:35,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:35,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-03 21:03:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:35,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-03 21:03:35,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:35,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:35,286 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 21:03:35,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459851368] [2024-06-03 21:03:35,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:35,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661053262] [2024-06-03 21:03:35,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661053262] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:35,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:35,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:03:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008617529] [2024-06-03 21:03:35,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-03 21:03:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-03 21:03:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-03 21:03:35,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 21:03:35,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 67 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:35,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:35,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 21:03:35,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:35,582 INFO L124 PetriNetUnfolderBase]: 437/786 cut-off events. [2024-06-03 21:03:35,583 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2024-06-03 21:03:35,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1699 conditions, 786 events. 437/786 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3429 event pairs, 73 based on Foata normal form. 30/815 useless extension candidates. Maximal degree in co-relation 879. Up to 303 conditions per place. [2024-06-03 21:03:35,588 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 65 selfloop transitions, 13 changer transitions 0/81 dead transitions. [2024-06-03 21:03:35,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 81 transitions, 354 flow [2024-06-03 21:03:35,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-03 21:03:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-03 21:03:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 113 transitions. [2024-06-03 21:03:35,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6277777777777778 [2024-06-03 21:03:35,590 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 67 flow. Second operand 6 states and 113 transitions. [2024-06-03 21:03:35,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 81 transitions, 354 flow [2024-06-03 21:03:35,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 81 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:03:35,592 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 171 flow [2024-06-03 21:03:35,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2024-06-03 21:03:35,593 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-03 21:03:35,593 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 171 flow [2024-06-03 21:03:35,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:35,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:35,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:35,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-03 21:03:35,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:35,806 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:35,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1214479301, now seen corresponding path program 1 times [2024-06-03 21:03:35,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:35,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147880501] [2024-06-03 21:03:35,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:35,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:35,817 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:35,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [272441154] [2024-06-03 21:03:35,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:35,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:35,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:35,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:35,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-03 21:03:35,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:35,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-03 21:03:35,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:36,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 21:03:36,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147880501] [2024-06-03 21:03:36,006 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:36,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272441154] [2024-06-03 21:03:36,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272441154] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:36,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:36,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:03:36,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766797022] [2024-06-03 21:03:36,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:36,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:03:36,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:03:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:03:36,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 21:03:36,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:36,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:36,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 21:03:36,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:36,324 INFO L124 PetriNetUnfolderBase]: 685/1221 cut-off events. [2024-06-03 21:03:36,325 INFO L125 PetriNetUnfolderBase]: For 1290/1294 co-relation queries the response was YES. [2024-06-03 21:03:36,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3747 conditions, 1221 events. 685/1221 cut-off events. For 1290/1294 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5696 event pairs, 95 based on Foata normal form. 70/1291 useless extension candidates. Maximal degree in co-relation 3462. Up to 431 conditions per place. [2024-06-03 21:03:36,333 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 68 selfloop transitions, 8 changer transitions 2/81 dead transitions. [2024-06-03 21:03:36,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 81 transitions, 508 flow [2024-06-03 21:03:36,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:03:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:03:36,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2024-06-03 21:03:36,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.58 [2024-06-03 21:03:36,336 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 171 flow. Second operand 5 states and 87 transitions. [2024-06-03 21:03:36,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 81 transitions, 508 flow [2024-06-03 21:03:36,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 81 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-03 21:03:36,349 INFO L231 Difference]: Finished difference. Result has 43 places, 39 transitions, 216 flow [2024-06-03 21:03:36,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=43, PETRI_TRANSITIONS=39} [2024-06-03 21:03:36,350 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-03 21:03:36,350 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 39 transitions, 216 flow [2024-06-03 21:03:36,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:36,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:36,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:36,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-03 21:03:36,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-03 21:03:36,561 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:36,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:36,566 INFO L85 PathProgramCache]: Analyzing trace with hash -314589603, now seen corresponding path program 1 times [2024-06-03 21:03:36,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:36,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348323213] [2024-06-03 21:03:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:36,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:36,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348323213] [2024-06-03 21:03:36,587 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-06-03 21:03:36,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252382750] [2024-06-03 21:03:36,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:36,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:36,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:36,588 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:36,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-03 21:03:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:36,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-03 21:03:36,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:36,707 INFO L378 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 11 treesize of output 7 [2024-06-03 21:03:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:36,715 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 21:03:36,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252382750] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:36,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:36,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-03 21:03:36,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969918393] [2024-06-03 21:03:36,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-03 21:03:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:36,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-03 21:03:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-03 21:03:36,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-03 21:03:36,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:36,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:36,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-03 21:03:36,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:36,866 INFO L124 PetriNetUnfolderBase]: 429/825 cut-off events. [2024-06-03 21:03:36,866 INFO L125 PetriNetUnfolderBase]: For 866/886 co-relation queries the response was YES. [2024-06-03 21:03:36,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 825 events. 429/825 cut-off events. For 866/886 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3577 event pairs, 169 based on Foata normal form. 47/844 useless extension candidates. Maximal degree in co-relation 1823. Up to 389 conditions per place. [2024-06-03 21:03:36,871 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 33 selfloop transitions, 8 changer transitions 0/45 dead transitions. [2024-06-03 21:03:36,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 302 flow [2024-06-03 21:03:36,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-03 21:03:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-03 21:03:36,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-03 21:03:36,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-03 21:03:36,873 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 216 flow. Second operand 3 states and 53 transitions. [2024-06-03 21:03:36,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 302 flow [2024-06-03 21:03:36,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 45 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-03 21:03:36,876 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 196 flow [2024-06-03 21:03:36,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-03 21:03:36,877 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-03 21:03:36,877 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 196 flow [2024-06-03 21:03:36,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:36,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:36,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:36,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-03 21:03:37,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:37,093 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:37,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:37,094 INFO L85 PathProgramCache]: Analyzing trace with hash 77694902, now seen corresponding path program 1 times [2024-06-03 21:03:37,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454516156] [2024-06-03 21:03:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:37,109 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:37,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288592363] [2024-06-03 21:03:37,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:37,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:37,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:37,111 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:37,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-03 21:03:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:37,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-03 21:03:37,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:37,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 21:03:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454516156] [2024-06-03 21:03:37,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288592363] [2024-06-03 21:03:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288592363] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:37,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:37,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-03 21:03:37,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056995662] [2024-06-03 21:03:37,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:37,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-03 21:03:37,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:37,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-03 21:03:37,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-03 21:03:37,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2024-06-03 21:03:37,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:37,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:37,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2024-06-03 21:03:37,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:37,617 INFO L124 PetriNetUnfolderBase]: 1156/2111 cut-off events. [2024-06-03 21:03:37,618 INFO L125 PetriNetUnfolderBase]: For 3441/3441 co-relation queries the response was YES. [2024-06-03 21:03:37,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6971 conditions, 2111 events. 1156/2111 cut-off events. For 3441/3441 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11627 event pairs, 262 based on Foata normal form. 16/2119 useless extension candidates. Maximal degree in co-relation 1555. Up to 997 conditions per place. [2024-06-03 21:03:37,627 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 53 selfloop transitions, 16 changer transitions 10/81 dead transitions. [2024-06-03 21:03:37,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 81 transitions, 640 flow [2024-06-03 21:03:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-03 21:03:37,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-03 21:03:37,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2024-06-03 21:03:37,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-06-03 21:03:37,629 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 196 flow. Second operand 5 states and 71 transitions. [2024-06-03 21:03:37,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 81 transitions, 640 flow [2024-06-03 21:03:37,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 622 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:03:37,634 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 376 flow [2024-06-03 21:03:37,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=376, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2024-06-03 21:03:37,635 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-03 21:03:37,635 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 376 flow [2024-06-03 21:03:37,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:37,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:37,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:37,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-03 21:03:37,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:37,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:37,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:37,848 INFO L85 PathProgramCache]: Analyzing trace with hash 77815058, now seen corresponding path program 1 times [2024-06-03 21:03:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:37,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629827652] [2024-06-03 21:03:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:37,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:37,859 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:37,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844435638] [2024-06-03 21:03:37,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:37,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:37,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:37,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:37,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-03 21:03:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:37,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-03 21:03:37,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:38,121 INFO L378 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 8 treesize of output 1 [2024-06-03 21:03:38,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:38,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-03 21:03:38,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629827652] [2024-06-03 21:03:38,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:38,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844435638] [2024-06-03 21:03:38,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844435638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-03 21:03:38,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-03 21:03:38,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-03 21:03:38,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396144734] [2024-06-03 21:03:38,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-03 21:03:38,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-03 21:03:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-03 21:03:38,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-03 21:03:38,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 21:03:38,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 376 flow. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:38,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:38,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 21:03:38,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:38,943 INFO L124 PetriNetUnfolderBase]: 625/1201 cut-off events. [2024-06-03 21:03:38,943 INFO L125 PetriNetUnfolderBase]: For 3141/3145 co-relation queries the response was YES. [2024-06-03 21:03:38,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 1201 events. 625/1201 cut-off events. For 3141/3145 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5850 event pairs, 83 based on Foata normal form. 56/1257 useless extension candidates. Maximal degree in co-relation 2322. Up to 336 conditions per place. [2024-06-03 21:03:38,950 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 74 selfloop transitions, 19 changer transitions 7/102 dead transitions. [2024-06-03 21:03:38,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 850 flow [2024-06-03 21:03:38,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-03 21:03:38,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-03 21:03:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 113 transitions. [2024-06-03 21:03:38,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708333333333333 [2024-06-03 21:03:38,952 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 376 flow. Second operand 8 states and 113 transitions. [2024-06-03 21:03:38,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 850 flow [2024-06-03 21:03:38,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 102 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-03 21:03:38,956 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 513 flow [2024-06-03 21:03:38,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=513, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-06-03 21:03:38,957 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-03 21:03:38,957 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 513 flow [2024-06-03 21:03:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:38,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:38,958 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:38,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-03 21:03:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:39,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:39,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:39,172 INFO L85 PathProgramCache]: Analyzing trace with hash 334188212, now seen corresponding path program 1 times [2024-06-03 21:03:39,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677922211] [2024-06-03 21:03:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:39,203 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:39,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206773860] [2024-06-03 21:03:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:39,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:39,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:39,213 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:39,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-03 21:03:39,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:03:39,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-03 21:03:39,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:39,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:39,514 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:03:40,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:40,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:40,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677922211] [2024-06-03 21:03:40,297 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:40,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206773860] [2024-06-03 21:03:40,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206773860] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:03:40,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 21:03:40,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-06-03 21:03:40,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993936972] [2024-06-03 21:03:40,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 21:03:40,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-03 21:03:40,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:40,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-03 21:03:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-03 21:03:40,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-03 21:03:40,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 513 flow. Second operand has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:40,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:40,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-03 21:03:40,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:03:41,119 INFO L124 PetriNetUnfolderBase]: 1212/2372 cut-off events. [2024-06-03 21:03:41,119 INFO L125 PetriNetUnfolderBase]: For 8139/8157 co-relation queries the response was YES. [2024-06-03 21:03:41,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8963 conditions, 2372 events. 1212/2372 cut-off events. For 8139/8157 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 13047 event pairs, 172 based on Foata normal form. 96/2468 useless extension candidates. Maximal degree in co-relation 5123. Up to 619 conditions per place. [2024-06-03 21:03:41,131 INFO L140 encePairwiseOnDemand]: 20/30 looper letters, 149 selfloop transitions, 79 changer transitions 13/243 dead transitions. [2024-06-03 21:03:41,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 243 transitions, 2197 flow [2024-06-03 21:03:41,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-03 21:03:41,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-03 21:03:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 273 transitions. [2024-06-03 21:03:41,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789473684210526 [2024-06-03 21:03:41,133 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 513 flow. Second operand 19 states and 273 transitions. [2024-06-03 21:03:41,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 243 transitions, 2197 flow [2024-06-03 21:03:41,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 243 transitions, 2132 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-03 21:03:41,143 INFO L231 Difference]: Finished difference. Result has 77 places, 117 transitions, 1414 flow [2024-06-03 21:03:41,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1414, PETRI_PLACES=77, PETRI_TRANSITIONS=117} [2024-06-03 21:03:41,143 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 46 predicate places. [2024-06-03 21:03:41,144 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 117 transitions, 1414 flow [2024-06-03 21:03:41,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:41,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:03:41,144 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:03:41,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-03 21:03:41,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:41,356 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:03:41,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:03:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash 220504132, now seen corresponding path program 2 times [2024-06-03 21:03:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:03:41,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337201586] [2024-06-03 21:03:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:03:41,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:03:41,370 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:03:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504506969] [2024-06-03 21:03:41,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-03 21:03:41,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:03:41,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:03:41,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:03:41,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-03 21:03:41,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-03 21:03:41,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-03 21:03:41,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-03 21:03:41,486 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:03:41,635 INFO L378 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 8 treesize of output 1 [2024-06-03 21:03:41,640 INFO L378 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 8 treesize of output 1 [2024-06-03 21:03:41,646 INFO L378 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 8 treesize of output 1 [2024-06-03 21:03:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:42,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:03:43,885 INFO L378 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 9 treesize of output 1 [2024-06-03 21:03:43,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-06-03 21:03:43,935 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-03 21:03:50,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:03:50,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:03:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337201586] [2024-06-03 21:03:50,101 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:03:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504506969] [2024-06-03 21:03:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504506969] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:03:50,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 21:03:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2024-06-03 21:03:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842241997] [2024-06-03 21:03:50,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 21:03:50,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-03 21:03:50,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:03:50,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-03 21:03:50,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=273, Unknown=1, NotChecked=0, Total=380 [2024-06-03 21:03:50,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 21:03:50,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 117 transitions, 1414 flow. Second operand has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:03:50,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:03:50,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 21:03:50,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:13,600 INFO L124 PetriNetUnfolderBase]: 2953/5472 cut-off events. [2024-06-03 21:04:13,601 INFO L125 PetriNetUnfolderBase]: For 42226/42230 co-relation queries the response was YES. [2024-06-03 21:04:13,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23993 conditions, 5472 events. 2953/5472 cut-off events. For 42226/42230 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 33630 event pairs, 204 based on Foata normal form. 197/5669 useless extension candidates. Maximal degree in co-relation 19022. Up to 1099 conditions per place. [2024-06-03 21:04:13,638 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 341 selfloop transitions, 146 changer transitions 66/554 dead transitions. [2024-06-03 21:04:13,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 554 transitions, 6080 flow [2024-06-03 21:04:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-06-03 21:04:13,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2024-06-03 21:04:13,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 480 transitions. [2024-06-03 21:04:13,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37209302325581395 [2024-06-03 21:04:13,648 INFO L175 Difference]: Start difference. First operand has 77 places, 117 transitions, 1414 flow. Second operand 43 states and 480 transitions. [2024-06-03 21:04:13,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 554 transitions, 6080 flow [2024-06-03 21:04:13,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 554 transitions, 5638 flow, removed 193 selfloop flow, removed 4 redundant places. [2024-06-03 21:04:13,705 INFO L231 Difference]: Finished difference. Result has 132 places, 236 transitions, 2973 flow [2024-06-03 21:04:13,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=2973, PETRI_PLACES=132, PETRI_TRANSITIONS=236} [2024-06-03 21:04:13,706 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-03 21:04:13,706 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 236 transitions, 2973 flow [2024-06-03 21:04:13,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.3) internal successors, (106), 20 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:13,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:13,706 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:13,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-03 21:04:13,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:04:13,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:13,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1440552836, now seen corresponding path program 3 times [2024-06-03 21:04:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:13,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117144147] [2024-06-03 21:04:13,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:13,957 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:04:13,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644461121] [2024-06-03 21:04:13,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-03 21:04:13,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:04:13,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:04:13,961 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:04:13,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-03 21:04:14,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-03 21:04:14,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-03 21:04:14,090 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-03 21:04:14,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:04:14,249 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:14,253 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:14,290 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:14,748 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:04:16,548 INFO L378 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 9 treesize of output 1 [2024-06-03 21:04:16,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2024-06-03 21:04:16,618 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-03 21:04:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117144147] [2024-06-03 21:04:20,110 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:04:20,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644461121] [2024-06-03 21:04:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644461121] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:04:20,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 21:04:20,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-06-03 21:04:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192811324] [2024-06-03 21:04:20,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 21:04:20,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-03 21:04:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-03 21:04:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-06-03 21:04:20,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 21:04:20,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 236 transitions, 2973 flow. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:20,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:20,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 21:04:20,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:04:41,549 INFO L124 PetriNetUnfolderBase]: 4533/8318 cut-off events. [2024-06-03 21:04:41,549 INFO L125 PetriNetUnfolderBase]: For 91139/91143 co-relation queries the response was YES. [2024-06-03 21:04:41,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41999 conditions, 8318 events. 4533/8318 cut-off events. For 91139/91143 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 52904 event pairs, 476 based on Foata normal form. 245/8563 useless extension candidates. Maximal degree in co-relation 37773. Up to 1575 conditions per place. [2024-06-03 21:04:41,608 INFO L140 encePairwiseOnDemand]: 18/30 looper letters, 389 selfloop transitions, 176 changer transitions 100/666 dead transitions. [2024-06-03 21:04:41,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 666 transitions, 8374 flow [2024-06-03 21:04:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-06-03 21:04:41,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2024-06-03 21:04:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 426 transitions. [2024-06-03 21:04:41,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4303030303030303 [2024-06-03 21:04:41,611 INFO L175 Difference]: Start difference. First operand has 132 places, 236 transitions, 2973 flow. Second operand 33 states and 426 transitions. [2024-06-03 21:04:41,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 666 transitions, 8374 flow [2024-06-03 21:04:41,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 666 transitions, 7073 flow, removed 578 selfloop flow, removed 15 redundant places. [2024-06-03 21:04:41,920 INFO L231 Difference]: Finished difference. Result has 166 places, 306 transitions, 3930 flow [2024-06-03 21:04:41,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2121, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=3930, PETRI_PLACES=166, PETRI_TRANSITIONS=306} [2024-06-03 21:04:41,921 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 135 predicate places. [2024-06-03 21:04:41,922 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 306 transitions, 3930 flow [2024-06-03 21:04:41,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 19 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:41,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:04:41,922 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:04:41,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-06-03 21:04:42,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-06-03 21:04:42,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:04:42,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:04:42,136 INFO L85 PathProgramCache]: Analyzing trace with hash 398982695, now seen corresponding path program 1 times [2024-06-03 21:04:42,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:04:42,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631636449] [2024-06-03 21:04:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:04:42,150 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:04:42,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904065023] [2024-06-03 21:04:42,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:04:42,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:04:42,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:04:42,165 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:04:42,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-03 21:04:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-03 21:04:42,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 26 conjunts are in the unsatisfiable core [2024-06-03 21:04:42,328 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:04:42,472 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:42,475 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:42,504 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:43,072 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:43,144 INFO L378 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 22 treesize of output 11 [2024-06-03 21:04:43,147 INFO L378 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 11 treesize of output 3 [2024-06-03 21:04:43,164 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:44,234 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:44,239 INFO L378 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 8 treesize of output 1 [2024-06-03 21:04:44,250 INFO L378 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 22 treesize of output 11 [2024-06-03 21:04:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:04:45,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:04:47,861 INFO L378 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 10 treesize of output 4 [2024-06-03 21:04:47,868 INFO L378 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 11 treesize of output 4 [2024-06-03 21:04:52,721 INFO L378 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 9 treesize of output 1 [2024-06-03 21:04:52,797 INFO L378 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 11 treesize of output 4 [2024-06-03 21:04:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-03 21:04:54,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:04:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631636449] [2024-06-03 21:04:54,873 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:04:54,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904065023] [2024-06-03 21:04:54,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904065023] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:04:54,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 21:04:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 27 [2024-06-03 21:04:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245521270] [2024-06-03 21:04:54,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 21:04:54,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-03 21:04:54,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:04:54,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-03 21:04:54,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=582, Unknown=0, NotChecked=0, Total=812 [2024-06-03 21:04:55,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 21:04:55,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 306 transitions, 3930 flow. Second operand has 29 states, 29 states have (on average 5.482758620689655) internal successors, (159), 29 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:04:55,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:04:55,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 21:04:55,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:05:27,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:05:59,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:06:03,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:06:08,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:06:34,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:06:37,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:06:42,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:07:19,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:07:33,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:08:23,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:08:27,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:08:31,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:08:46,684 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~send~0 256))) (let ((.cse31 (mod c_~receive~0 256)) (.cse10 (mod c_~buffer_size~0 4294967296)) (.cse8 (mod c_~next~0 4294967296)) (.cse15 (= .cse33 0))) (let ((.cse20 (= |c_#ghost~m_locked| 0)) (.cse36 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse19 (not .cse15)) (.cse21 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse26 (< .cse10 (+ .cse8 1))) (.cse29 (< c_~buffer_size~0 1)) (.cse37 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse4 (= .cse31 0))) (let ((.cse18 (not .cse4)) (.cse0 (and (or .cse26 .cse29) (not (= .cse37 0)))) (.cse1 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (or .cse3 .cse19 .cse21)) (.cse23 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 1)) (.cse24 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse25 (= .cse36 0)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse14 (< .cse8 1)) (.cse11 (not (= (+ c_~value~0 1) 0))) (.cse6 (< 2147483647 c_~value~0)) (.cse27 (and (<= 0 .cse37) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse28 (< .cse36 0)) (.cse16 (not .cse20)) (.cse17 (= c_~buffer_size~0 10)) (.cse22 (or .cse3 .cse21))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse9 (+ .cse12 1))) (and (or (and (<= 1 .cse8) (<= .cse9 .cse10)) .cse11) (or (< .cse10 .cse9) (and (or (< 2147483647 .cse12) (not (= c_~value~0 (select .cse13 (+ |c_~#buffer~0.offset| .cse12))))) (or (not (= (select .cse13 (+ |c_~#buffer~0.offset| .cse12 (- 4294967296))) c_~value~0)) (< .cse12 2147483648))) .cse14))))) (or .cse0 .cse15 .cse5 .cse7 (and (or .cse1 .cse3) (or .cse16 .cse3 .cse17))) (or .cse18 .cse19 .cse20 .cse21) .cse22 (or .cse18 (and (or .cse23 .cse24 .cse3 .cse25 .cse26 .cse15 .cse27 .cse28 .cse29) .cse30)) (or .cse16 .cse3 (let ((.cse32 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse31 c_~buffer_size~0) 11) (<= 10 .cse32) (= (+ .cse33 .cse31) 1) (<= (+ 9 .cse31) c_~buffer_size~0) (<= c_~buffer_size~0 (+ c_~value~0 10)) (<= .cse32 16) (<= (+ c_~value~0 4) c_~buffer_size~0)))) (or .cse18 (and (or .cse0 .cse1 .cse3 .cse15 .cse5 .cse7) .cse30)) (or .cse23 .cse24 .cse2 .cse3 .cse4 .cse25 .cse26 (and (or (and (forall ((v_z_58 Int) (v_y_58 Int) (|~#buffer~0.offset| Int)) (let ((.cse34 (* v_y_58 4294967296))) (or (< .cse10 (+ .cse34 v_z_58 1)) (< .cse10 v_z_58) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_58 (- 4294967297))))) (< v_z_58 2147483649) (< (+ .cse34 v_z_58) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_62 Int) (v_y_62 Int)) (let ((.cse35 (* v_y_62 4294967296))) (or (< .cse10 (+ .cse35 v_z_62 1)) (< 2147483648 v_z_62) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_62)))) (< v_z_62 0) (< (+ .cse35 v_z_62) 0) (= v_z_62 0))))) .cse14) (or .cse11 (< 0 .cse8))) .cse6 .cse27 .cse28 .cse29) (or .cse19 (and (or .cse16 .cse3 (and (= .cse31 1) .cse17)) .cse22))))))) is different from false [2024-06-03 21:08:50,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:08:57,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-03 21:09:00,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-03 21:09:03,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-06-03 21:09:08,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-06-03 21:09:12,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-06-03 21:11:00,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:11:35,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:11:38,178 INFO L124 PetriNetUnfolderBase]: 8727/15899 cut-off events. [2024-06-03 21:11:38,178 INFO L125 PetriNetUnfolderBase]: For 164557/164563 co-relation queries the response was YES. [2024-06-03 21:11:38,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85067 conditions, 15899 events. 8727/15899 cut-off events. For 164557/164563 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 112943 event pairs, 462 based on Foata normal form. 48/15947 useless extension candidates. Maximal degree in co-relation 84751. Up to 2906 conditions per place. [2024-06-03 21:11:38,332 INFO L140 encePairwiseOnDemand]: 13/30 looper letters, 597 selfloop transitions, 784 changer transitions 16/1398 dead transitions. [2024-06-03 21:11:38,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 1398 transitions, 18970 flow [2024-06-03 21:11:38,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-06-03 21:11:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2024-06-03 21:11:38,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 876 transitions. [2024-06-03 21:11:38,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.335632183908046 [2024-06-03 21:11:38,337 INFO L175 Difference]: Start difference. First operand has 166 places, 306 transitions, 3930 flow. Second operand 87 states and 876 transitions. [2024-06-03 21:11:38,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 1398 transitions, 18970 flow [2024-06-03 21:11:38,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 1398 transitions, 17127 flow, removed 759 selfloop flow, removed 14 redundant places. [2024-06-03 21:11:38,891 INFO L231 Difference]: Finished difference. Result has 263 places, 988 transitions, 14630 flow [2024-06-03 21:11:38,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3483, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=14630, PETRI_PLACES=263, PETRI_TRANSITIONS=988} [2024-06-03 21:11:38,893 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 232 predicate places. [2024-06-03 21:11:38,893 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 988 transitions, 14630 flow [2024-06-03 21:11:38,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 5.482758620689655) internal successors, (159), 29 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:11:38,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-03 21:11:38,894 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-03 21:11:38,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-06-03 21:11:39,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-03 21:11:39,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-03 21:11:39,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-03 21:11:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash -715183161, now seen corresponding path program 2 times [2024-06-03 21:11:39,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-03 21:11:39,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179252347] [2024-06-03 21:11:39,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-03 21:11:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-03 21:11:39,124 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-03 21:11:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [293209824] [2024-06-03 21:11:39,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-03 21:11:39,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-03 21:11:39,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-03 21:11:39,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-03 21:11:39,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-03 21:11:39,273 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-03 21:11:39,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-03 21:11:39,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 24 conjunts are in the unsatisfiable core [2024-06-03 21:11:39,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-03 21:11:39,637 INFO L378 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 8 treesize of output 1 [2024-06-03 21:11:39,652 INFO L378 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 8 treesize of output 1 [2024-06-03 21:11:39,660 INFO L378 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 8 treesize of output 1 [2024-06-03 21:11:40,657 INFO L378 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 8 treesize of output 1 [2024-06-03 21:11:40,688 INFO L378 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 8 treesize of output 1 [2024-06-03 21:11:40,694 INFO L378 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 22 treesize of output 11 [2024-06-03 21:11:40,700 INFO L378 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 11 treesize of output 3 [2024-06-03 21:11:43,981 INFO L378 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 27 treesize of output 9 [2024-06-03 21:11:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:11:44,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-03 21:11:48,138 INFO L378 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 10 treesize of output 4 [2024-06-03 21:11:48,153 INFO L378 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 11 treesize of output 4 [2024-06-03 21:11:50,889 INFO L378 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 11 treesize of output 4 [2024-06-03 21:11:50,909 INFO L378 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 10 treesize of output 4 [2024-06-03 21:11:57,701 INFO L378 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 9 treesize of output 1 [2024-06-03 21:11:57,941 INFO L378 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 11 treesize of output 4 [2024-06-03 21:11:58,001 INFO L378 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 11 treesize of output 4 [2024-06-03 21:12:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-03 21:12:03,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-03 21:12:03,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179252347] [2024-06-03 21:12:03,928 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-03 21:12:03,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293209824] [2024-06-03 21:12:03,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293209824] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-03 21:12:03,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-03 21:12:03,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2024-06-03 21:12:03,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072750003] [2024-06-03 21:12:03,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-03 21:12:03,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-03 21:12:03,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-03 21:12:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-03 21:12:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=690, Unknown=6, NotChecked=0, Total=930 [2024-06-03 21:12:04,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-03 21:12:04,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 988 transitions, 14630 flow. Second operand has 31 states, 31 states have (on average 5.32258064516129) internal successors, (165), 31 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-03 21:12:04,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-03 21:12:04,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-03 21:12:04,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-03 21:12:08,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~send~0 256)) (.cse44 (mod c_~first~0 4294967296)) (.cse1 (mod c_~receive~0 256))) (let ((.cse0 (+ c_~value~0 1)) (.cse15 (= .cse1 0)) (.cse43 (+ .cse44 1)) (.cse31 (mod c_~buffer_size~0 4294967296)) (.cse42 (mod c_~next~0 4294967296)) (.cse23 (= .cse2 0))) (let ((.cse4 (not .cse23)) (.cse16 (< .cse31 (+ .cse42 1))) (.cse18 (< c_~buffer_size~0 1)) (.cse35 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse26 (< .cse31 .cse43)) (.cse19 (not .cse15)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse41 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse21 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse40 (not (= .cse0 0))) (.cse45 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse46 (< .cse42 1))) (let ((.cse25 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (and (or .cse40 (< 0 .cse42)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse47 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse45 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse31 (+ v_z_89 .cse47 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse47) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse48 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse45 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse31 (+ v_z_89 .cse48 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse48) 0))))) .cse46))) (.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse31) 1)) (.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse36 (or .cse19 .cse3 .cse41 .cse21)) (.cse20 (= |c_#ghost~m_locked| 0)) (.cse14 (< (+ c_~value~0 2147483648) 0)) (.cse17 (< 2147483647 c_~value~0)) (.cse27 (and (or (and (<= 1 .cse42) (<= .cse43 .cse31)) .cse40) (or .cse26 (and (or (< 2147483647 .cse44) (not (= c_~value~0 (select .cse45 (+ |c_~#buffer~0.offset| .cse44))))) (or (not (= (select .cse45 (+ |c_~#buffer~0.offset| .cse44 (- 4294967296))) c_~value~0)) (< .cse44 2147483648))) .cse46))) (.cse28 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse32 (and (or .cse16 .cse18) (not (= .cse35 0)))) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse34 (or .cse3 .cse4 .cse21))) (and (or (< .cse0 .cse1) (not (= (+ .cse2 .cse1) 1)) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse5 .cse6 (forall ((v_z_101 Int) (v_z_93 Int) (v_y_93 Int) (v_y_101 Int)) (let ((.cse11 (* v_y_101 4294967296))) (let ((.cse7 (* v_y_93 4294967296)) (.cse9 (+ c_~value~0 .cse11 v_z_101)) (.cse8 (mod (+ v_z_93 1) v_z_101)) (.cse10 (+ .cse11 v_z_101))) (or (< (+ v_z_93 .cse7) 0) (< (mod (mod (+ .cse8 1) 4294967296) v_z_101) 1) (< 16 .cse9) (< (+ .cse2 10) .cse10) (< (+ c_~value~0 10) .cse10) (< 4294967295 v_z_101) (< .cse10 (+ 9 .cse1)) (< v_z_101 (+ v_z_93 .cse7 1)) (< v_z_93 0) (< 4294967295 v_z_93) (< .cse9 10) (< .cse8 1) (< .cse10 (+ c_~value~0 4)))))))) (< (+ .cse2 6) c_~value~0)) (or .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse17 .cse18) (or .cse19 .cse4 .cse20 .cse21) (or .cse19 (and (or .cse13 .cse22 .cse3 .cse16 .cse23 .cse6 .cse18) (or .cse3 .cse4 .cse21 .cse24))) (or .cse19 .cse3 .cse4 .cse25 .cse21) (or .cse3 (and (or .cse13 .cse22 .cse16 .cse26 .cse23 .cse18) (or .cse22 .cse14 .cse15 .cse4 .cse17 .cse27))) (or .cse19 (and (or .cse3 .cse23 .cse28) (or .cse3 .cse4 .cse25 .cse21))) (or .cse3 (forall ((v_z_93 Int) (v_y_93 Int)) (let ((.cse29 (* v_y_93 4294967296)) (.cse30 (mod (+ v_z_93 1) .cse31))) (or (< (+ v_z_93 .cse29) 0) (< v_z_93 0) (< (mod (mod (+ .cse30 1) 4294967296) .cse31) 1) (< 4294967295 v_z_93) (< .cse31 (+ v_z_93 .cse29 1)) (< .cse30 1)))) .cse5 .cse23 .cse6 .cse18) (or .cse12 .cse13 .cse22 .cse14 .cse3 .cse15 .cse16 .cse6 .cse17 .cse18) (or .cse19 .cse3 .cse4 .cse21 .cse24) (or .cse3 (and (or .cse14 .cse15 .cse4 .cse17 .cse27) (or .cse13 .cse16 .cse26 .cse23 .cse6 .cse18)) .cse28) (or (let ((.cse33 (< 0 .cse35))) (and (or .cse32 .cse14 .cse3 .cse15 .cse6 .cse17 .cse27 .cse33) (or .cse19 (and (or .cse32 .cse3 .cse23 .cse6 .cse33) .cse34)))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 (and .cse36 (or .cse14 .cse3 .cse15 .cse5 .cse17 (and (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse38 (* v_y_98 4294967296))) (let ((.cse37 (+ v_z_98 .cse38))) (or (< v_z_98 0) (= .cse37 0) (< .cse31 (+ v_z_98 .cse38 1)) (< (mod (+ v_z_98 1) .cse31) 1) (< 4294967295 v_z_98) (< .cse37 0))))) (or (forall ((v_z_97 Int) (v_y_97 Int)) (let ((.cse39 (* v_y_97 4294967296))) (or (< 4294967295 v_z_97) (< v_z_97 0) (< (mod (+ v_z_97 1) .cse31) 1) (< .cse31 (+ v_z_97 .cse39 1)) (< (+ v_z_97 .cse39) 0)))) .cse40)) .cse18))) (or .cse19 (and (or .cse13 .cse3 .cse16 .cse5 .cse23 .cse18) (or .cse3 .cse41 .cse4 .cse21))) (or (and (or .cse3 .cse5 .cse23 .cse6) (or .cse4 (and (or .cse14 .cse3 .cse15 .cse5 .cse17) .cse36))) .cse20) (or .cse14 .cse3 .cse15 .cse17 .cse27 .cse28) (or .cse32 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse3 .cse23 .cse6 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse34))))) is different from false [2024-06-03 21:12:08,736 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (mod c_~first~0 4294967296))) (let ((.cse11 (mod c_~next~0 4294967296)) (.cse13 (mod c_~buffer_size~0 4294967296)) (.cse25 (+ .cse26 1))) (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse18 (= (mod c_~receive~0 256) 0)) (.cse10 (not (= (+ c_~value~0 1) 0))) (.cse21 (< .cse13 .cse25)) (.cse12 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse16 (< .cse11 1))) (let ((.cse2 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse17 (< (+ c_~value~0 2147483648) 0)) (.cse19 (< 2147483647 c_~value~0)) (.cse20 (and (or (and (<= 1 .cse11) (<= .cse25 .cse13)) .cse10) (or .cse21 (and (or (< 2147483647 .cse26) (not (= c_~value~0 (select .cse12 (+ |c_~#buffer~0.offset| .cse26))))) (or (not (= (select .cse12 (+ |c_~#buffer~0.offset| .cse26 (- 4294967296))) c_~value~0)) (< .cse26 2147483648))) .cse16))) (.cse0 (not .cse18)) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse8 (not .cse5)) (.cse9 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (< .cse13 (+ .cse11 1))) (.cse7 (< c_~buffer_size~0 1))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse3 .cse8 .cse9 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse0 .cse3 .cse8 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse9) (or (and (or .cse10 (< 0 .cse11)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse14 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse13 (+ v_z_89 .cse14 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse14) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse15 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse13 (+ v_z_89 .cse15 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse15) 0))))) .cse16)) .cse1 .cse2 .cse17 .cse3 .cse18 .cse4 .cse6 .cse19 .cse7) (or .cse3 (and (or .cse17 .cse18 .cse8 .cse19 .cse20) (or .cse1 .cse4 .cse21 .cse5 .cse6 .cse7)) (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (let ((.cse24 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse22 (and (or .cse4 .cse7) (not (= .cse24 0)))) (.cse23 (< 0 .cse24))) (and (or .cse22 .cse17 .cse3 .cse18 .cse6 .cse19 .cse20 .cse23) (or .cse0 (and (or .cse22 .cse3 .cse5 .cse6 .cse23) (or .cse3 .cse8 .cse9)))))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))))))) is different from false [2024-06-03 21:12:44,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse18 (= (mod c_~receive~0 256) 0)) (.cse11 (mod c_~next~0 4294967296)) (.cse13 (mod c_~buffer_size~0 4294967296))) (let ((.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse2 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse17 (< (+ c_~value~0 2147483648) 0)) (.cse19 (< 2147483647 c_~value~0)) (.cse10 (not (= (+ c_~value~0 1) 0))) (.cse12 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse16 (< .cse11 1)) (.cse0 (not .cse18)) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse8 (not .cse5)) (.cse9 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (< .cse13 (+ .cse11 1))) (.cse7 (< c_~buffer_size~0 1))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (or .cse3 .cse8 .cse9 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or (and (or .cse10 (< 0 .cse11)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse14 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse13 (+ v_z_89 .cse14 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse14) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse15 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse12 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse13 (+ v_z_89 .cse15 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse15) 0))))) .cse16)) .cse1 .cse2 .cse17 .cse3 .cse18 .cse4 .cse6 .cse19 .cse7) (or (let ((.cse24 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (let ((.cse20 (and (or .cse4 .cse7) (not (= .cse24 0)))) (.cse23 (< 0 .cse24))) (and (or .cse20 .cse17 .cse3 .cse18 .cse6 .cse19 (let ((.cse22 (mod c_~first~0 4294967296))) (let ((.cse21 (+ .cse22 1))) (and (or (and (<= 1 .cse11) (<= .cse21 .cse13)) .cse10) (or (< .cse13 .cse21) (and (or (< 2147483647 .cse22) (not (= c_~value~0 (select .cse12 (+ |c_~#buffer~0.offset| .cse22))))) (or (not (= (select .cse12 (+ |c_~#buffer~0.offset| .cse22 (- 4294967296))) c_~value~0)) (< .cse22 2147483648))) .cse16)))) .cse23) (or .cse0 (and (or .cse20 .cse3 .cse5 .cse6 .cse23) (or .cse3 .cse8 .cse9)))))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|))))) is different from false [2024-06-03 21:12:48,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:12:49,102 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~receive~0 256)) (.cse2 (mod c_~send~0 256))) (let ((.cse16 (= .cse2 0)) (.cse27 (= .cse1 0)) (.cse22 (mod c_~buffer_size~0 4294967296)) (.cse20 (mod c_~next~0 4294967296)) (.cse0 (+ c_~value~0 1))) (let ((.cse14 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse19 (not (= .cse0 0))) (.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse25 (< .cse20 1)) (.cse13 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse28 (< 2147483647 c_~value~0)) (.cse12 (not .cse27)) (.cse15 (< .cse22 (+ .cse20 1))) (.cse17 (< c_~buffer_size~0 1)) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse4 (not .cse16)) (.cse18 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or (< .cse0 .cse1) (not (= (+ .cse2 .cse1) 1)) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse5 .cse6 (forall ((v_z_101 Int) (v_z_93 Int) (v_y_93 Int) (v_y_101 Int)) (let ((.cse11 (* v_y_101 4294967296))) (let ((.cse7 (* v_y_93 4294967296)) (.cse9 (+ c_~value~0 .cse11 v_z_101)) (.cse8 (mod (+ v_z_93 1) v_z_101)) (.cse10 (+ .cse11 v_z_101))) (or (< (+ v_z_93 .cse7) 0) (< (mod (mod (+ .cse8 1) 4294967296) v_z_101) 1) (< 16 .cse9) (< (+ .cse2 10) .cse10) (< (+ c_~value~0 10) .cse10) (< 4294967295 v_z_101) (< .cse10 (+ 9 .cse1)) (< v_z_101 (+ v_z_93 .cse7 1)) (< v_z_93 0) (< 4294967295 v_z_93) (< .cse9 10) (< .cse8 1) (< .cse10 (+ c_~value~0 4)))))))) (< (+ .cse2 6) c_~value~0)) (or .cse12 (and (or .cse13 .cse14 .cse3 .cse15 .cse16 .cse6 .cse17) (or .cse3 .cse4 .cse18 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)))) (or .cse12 .cse3 .cse4 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse18) (or (and (or .cse19 (< 0 .cse20)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse23 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse22 (+ v_z_89 .cse23 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse23) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse24 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse22 (+ v_z_89 .cse24 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse24) 0))))) .cse25)) .cse13 .cse14 .cse26 .cse3 .cse27 .cse15 .cse6 .cse28 .cse17) (or .cse3 (let ((.cse31 (mod c_~first~0 4294967296))) (let ((.cse29 (+ .cse31 1))) (let ((.cse30 (< .cse22 .cse29))) (and (or .cse26 .cse27 .cse4 .cse28 (and (or (and (<= 1 .cse20) (<= .cse29 .cse22)) .cse19) (or .cse30 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse21 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse21 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse25))) (or .cse13 .cse15 .cse30 .cse16 .cse6 .cse17))))) (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (or .cse3 .cse5 .cse16 .cse6) (or .cse4 (and (or .cse26 .cse3 .cse27 .cse5 .cse28) (or .cse12 .cse3 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse18)))) (= |c_#ghost~m_locked| 0)) (or (and (or .cse15 .cse17) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse3 .cse16 .cse6 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse4 .cse18))))) is different from false [2024-06-03 21:12:59,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:13:14,938 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse38 (mod c_~first~0 4294967296))) (let ((.cse30 (mod c_~receive~0 256)) (.cse8 (mod c_~next~0 4294967296)) (.cse10 (mod c_~buffer_size~0 4294967296)) (.cse37 (+ .cse38 1)) (.cse32 (mod c_~send~0 256))) (let ((.cse4 (= |c_#ghost~multithreaded| 0)) (.cse22 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= .cse32 0)) (.cse7 (not (= (+ c_~value~0 1) 0))) (.cse25 (< .cse10 .cse37)) (.cse9 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse13 (< .cse8 1)) (.cse16 (= .cse30 0))) (let ((.cse21 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse19 (not .cse16)) (.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 1)) (.cse0 (< .cse10 (+ .cse8 1))) (.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse1 (< c_~buffer_size~0 1)) (.cse33 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse15 (< (+ c_~value~0 2147483648) 0)) (.cse18 (< 2147483647 c_~value~0)) (.cse26 (and (or (and (<= 1 .cse8) (<= .cse37 .cse10)) .cse7) (or .cse25 (and (or (< 2147483647 .cse38) (not (= c_~value~0 (select .cse9 (+ |c_~#buffer~0.offset| .cse38))))) (or (not (= (select .cse9 (+ |c_~#buffer~0.offset| .cse38 (- 4294967296))) c_~value~0)) (< .cse38 2147483648))) .cse13))) (.cse27 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse20 (not .cse2)) (.cse5 (not (= |c_#ghost~m_locked| 0))) (.cse6 (= c_~buffer_size~0 10)) (.cse23 (or .cse4 .cse22))) (and (or (and (or .cse0 .cse1) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0))) .cse2 .cse3 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse4) (or .cse5 .cse4 .cse6))) (or (and (or .cse7 (< 0 .cse8)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse11 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse9 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse10 (+ v_z_89 .cse11 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse11) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse12 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse9 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse10 (+ v_z_89 .cse12 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse12) 0))))) .cse13)) .cse14 .cse15 .cse4 .cse16 .cse0 .cse17 .cse18 .cse1) (or .cse19 .cse4 .cse20 .cse21 .cse22) .cse23 (or .cse4 (let ((.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse14 .cse24 .cse0 .cse25 .cse2 .cse1) (or .cse24 .cse15 .cse16 .cse20 .cse18 .cse26)))) (or .cse19 (and (or .cse4 .cse2 .cse27) (or .cse4 .cse20 .cse21 .cse22))) (or .cse4 (forall ((v_z_93 Int) (v_y_93 Int)) (let ((.cse28 (* v_y_93 4294967296)) (.cse29 (mod (+ v_z_93 1) .cse10))) (or (< (+ v_z_93 .cse28) 0) (< v_z_93 0) (< (mod (mod (+ .cse29 1) 4294967296) .cse10) 1) (< 4294967295 v_z_93) (< .cse10 (+ v_z_93 .cse28 1)) (< .cse29 1)))) .cse17 .cse2 .cse3 .cse1) (or .cse5 .cse4 (let ((.cse31 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse30 c_~buffer_size~0) 11) (<= 10 .cse31) (= (+ .cse32 .cse30) 1) (<= (+ 9 .cse30) c_~buffer_size~0) (<= c_~buffer_size~0 (+ c_~value~0 10)) (<= .cse31 16) (<= (+ c_~value~0 4) c_~buffer_size~0)))) (or .cse19 .cse4 .cse20 .cse22 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 (and (or .cse15 .cse16 .cse20 .cse18 .cse26) (or .cse14 .cse0 .cse25 .cse2 .cse3 .cse1)) .cse27) (or .cse20 (and (or .cse19 .cse4 .cse33 .cse22) (or .cse15 .cse4 .cse16 .cse17 .cse18 (and (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse35 (* v_y_98 4294967296))) (let ((.cse34 (+ v_z_98 .cse35))) (or (< v_z_98 0) (= .cse34 0) (< .cse10 (+ v_z_98 .cse35 1)) (< (mod (+ v_z_98 1) .cse10) 1) (< 4294967295 v_z_98) (< .cse34 0))))) (or (forall ((v_z_97 Int) (v_y_97 Int)) (let ((.cse36 (* v_y_97 4294967296))) (or (< 4294967295 v_z_97) (< v_z_97 0) (< (mod (+ v_z_97 1) .cse10) 1) (< .cse10 (+ v_z_97 .cse36 1)) (< (+ v_z_97 .cse36) 0)))) .cse7)) .cse1))) (or .cse19 (and (or .cse14 .cse4 .cse0 .cse17 .cse2 .cse1) (or .cse4 .cse33 .cse20 .cse22))) (or .cse15 .cse4 .cse16 .cse18 .cse26 .cse27) (or .cse20 (and (or .cse5 .cse4 (and (= .cse30 1) .cse6)) .cse23))))))) is different from false [2024-06-03 21:13:33,958 WARN L293 SmtUtils]: Spent 5.67s on a formula simplification. DAG size of input: 257 DAG size of output: 170 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-06-03 21:13:43,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:14:06,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:14:08,110 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~send~0 256)) (.cse43 (mod c_~first~0 4294967296)) (.cse1 (mod c_~receive~0 256))) (let ((.cse0 (+ c_~value~0 1)) (.cse15 (= .cse1 0)) (.cse42 (+ .cse43 1)) (.cse30 (mod c_~buffer_size~0 4294967296)) (.cse41 (mod c_~next~0 4294967296)) (.cse21 (= .cse2 0))) (let ((.cse4 (not .cse21)) (.cse16 (< .cse30 (+ .cse41 1))) (.cse18 (< c_~buffer_size~0 1)) (.cse34 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse25 (< .cse30 .cse42)) (.cse19 (not .cse15)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse40 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse39 (not (= .cse0 0))) (.cse44 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse45 (< .cse41 1))) (let ((.cse24 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (and (or .cse39 (< 0 .cse41)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse46 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse44 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse30 (+ v_z_89 .cse46 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse46) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse47 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse44 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse30 (+ v_z_89 .cse47 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse47) 0))))) .cse45))) (.cse20 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse23 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse30) 1)) (.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse35 (or .cse19 .cse3 .cse40 .cse22)) (.cse14 (< (+ c_~value~0 2147483648) 0)) (.cse17 (< 2147483647 c_~value~0)) (.cse26 (and (or (and (<= 1 .cse41) (<= .cse42 .cse30)) .cse39) (or .cse25 (and (or (< 2147483647 .cse43) (not (= c_~value~0 (select .cse44 (+ |c_~#buffer~0.offset| .cse43))))) (or (not (= (select .cse44 (+ |c_~#buffer~0.offset| .cse43 (- 4294967296))) c_~value~0)) (< .cse43 2147483648))) .cse45))) (.cse27 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse31 (and (or .cse16 .cse18) (not (= .cse34 0)))) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse33 (or .cse3 .cse4 .cse22))) (and (or (< .cse0 .cse1) (not (= (+ .cse2 .cse1) 1)) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse5 .cse6 (forall ((v_z_101 Int) (v_z_93 Int) (v_y_93 Int) (v_y_101 Int)) (let ((.cse11 (* v_y_101 4294967296))) (let ((.cse7 (* v_y_93 4294967296)) (.cse9 (+ c_~value~0 .cse11 v_z_101)) (.cse8 (mod (+ v_z_93 1) v_z_101)) (.cse10 (+ .cse11 v_z_101))) (or (< (+ v_z_93 .cse7) 0) (< (mod (mod (+ .cse8 1) 4294967296) v_z_101) 1) (< 16 .cse9) (< (+ .cse2 10) .cse10) (< (+ c_~value~0 10) .cse10) (< 4294967295 v_z_101) (< .cse10 (+ 9 .cse1)) (< v_z_101 (+ v_z_93 .cse7 1)) (< v_z_93 0) (< 4294967295 v_z_93) (< .cse9 10) (< .cse8 1) (< .cse10 (+ c_~value~0 4)))))))) (< (+ .cse2 6) c_~value~0)) (or .cse12 .cse13 .cse14 .cse3 .cse15 .cse16 .cse5 .cse17 .cse18) (or .cse19 (and (or .cse13 .cse20 .cse3 .cse16 .cse21 .cse6 .cse18) (or .cse3 .cse4 .cse22 .cse23))) (or .cse19 .cse3 .cse4 .cse24 .cse22) (or .cse3 (and (or .cse13 .cse20 .cse16 .cse25 .cse21 .cse18) (or .cse20 .cse14 .cse15 .cse4 .cse17 .cse26))) (or .cse19 (and (or .cse3 .cse21 .cse27) (or .cse3 .cse4 .cse24 .cse22))) (or .cse3 (forall ((v_z_93 Int) (v_y_93 Int)) (let ((.cse28 (* v_y_93 4294967296)) (.cse29 (mod (+ v_z_93 1) .cse30))) (or (< (+ v_z_93 .cse28) 0) (< v_z_93 0) (< (mod (mod (+ .cse29 1) 4294967296) .cse30) 1) (< 4294967295 v_z_93) (< .cse30 (+ v_z_93 .cse28 1)) (< .cse29 1)))) .cse5 .cse21 .cse6 .cse18) (or .cse12 .cse13 .cse20 .cse14 .cse3 .cse15 .cse16 .cse6 .cse17 .cse18) (or .cse19 .cse3 .cse4 .cse22 .cse23) (or .cse3 (and (or .cse14 .cse15 .cse4 .cse17 .cse26) (or .cse13 .cse16 .cse25 .cse21 .cse6 .cse18)) .cse27) (or (let ((.cse32 (< 0 .cse34))) (and (or .cse31 .cse14 .cse3 .cse15 .cse6 .cse17 .cse26 .cse32) (or .cse19 (and (or .cse31 .cse3 .cse21 .cse6 .cse32) .cse33)))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 (and .cse35 (or .cse14 .cse3 .cse15 .cse5 .cse17 (and (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse37 (* v_y_98 4294967296))) (let ((.cse36 (+ v_z_98 .cse37))) (or (< v_z_98 0) (= .cse36 0) (< .cse30 (+ v_z_98 .cse37 1)) (< (mod (+ v_z_98 1) .cse30) 1) (< 4294967295 v_z_98) (< .cse36 0))))) (or (forall ((v_z_97 Int) (v_y_97 Int)) (let ((.cse38 (* v_y_97 4294967296))) (or (< 4294967295 v_z_97) (< v_z_97 0) (< (mod (+ v_z_97 1) .cse30) 1) (< .cse30 (+ v_z_97 .cse38 1)) (< (+ v_z_97 .cse38) 0)))) .cse39)) .cse18))) (or .cse19 (and (or .cse13 .cse3 .cse16 .cse5 .cse21 .cse18) (or .cse3 .cse40 .cse4 .cse22))) (or (and (or .cse3 .cse5 .cse21 .cse6) (or .cse4 (and (or .cse14 .cse3 .cse15 .cse5 .cse17) .cse35))) (= |c_#ghost~m_locked| 0)) (or .cse14 .cse3 .cse15 .cse17 .cse26 .cse27) (or .cse31 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse3 .cse21 .cse6 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse33))))) is different from false [2024-06-03 21:14:40,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:14:58,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:16:14,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-03 21:17:39,225 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~send~0 256)) (.cse49 (mod c_~first~0 4294967296)) (.cse1 (mod c_~receive~0 256))) (let ((.cse0 (+ c_~value~0 1)) (.cse19 (= .cse1 0)) (.cse48 (+ .cse49 1)) (.cse34 (mod c_~buffer_size~0 4294967296)) (.cse47 (mod c_~next~0 4294967296)) (.cse25 (= .cse10 0))) (let ((.cse4 (not .cse25)) (.cse20 (< .cse34 (+ .cse47 1))) (.cse22 (< c_~buffer_size~0 1)) (.cse40 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse29 (< .cse34 .cse48)) (.cse23 (not .cse19)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse46 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse26 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse45 (not (= .cse0 0))) (.cse50 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse51 (< .cse47 1))) (let ((.cse28 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse16 (and (or .cse45 (< 0 .cse47)) (or (and (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse52 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| (- 1) v_z_89)))) (< .cse34 (+ v_z_89 .cse52 1)) (< 2147483648 v_z_89) (< v_z_89 0) (= v_z_89 0) (< (+ v_z_89 .cse52) 0)))) (forall ((v_y_89 Int) (|~#buffer~0.offset| Int) (v_z_89 Int)) (let ((.cse53 (* v_y_89 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| v_z_89 (- 4294967297))))) (< v_z_89 2147483649) (< .cse34 (+ v_z_89 .cse53 1)) (< 4294967295 v_z_89) (< (+ v_z_89 .cse53) 0))))) .cse51))) (.cse24 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse2 (= (+ .cse10 .cse1) 1)) (.cse13 (+ 9 .cse1)) (.cse12 (+ c_~value~0 10)) (.cse14 (+ c_~value~0 4)) (.cse27 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse5 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse41 (or .cse23 .cse3 .cse46 .cse26)) (.cse35 (= |c_#ghost~m_locked| 0)) (.cse18 (< (+ c_~value~0 2147483648) 0)) (.cse21 (< 2147483647 c_~value~0)) (.cse30 (and (or (and (<= 1 .cse47) (<= .cse48 .cse34)) .cse45) (or .cse29 (and (or (< 2147483647 .cse49) (not (= c_~value~0 (select .cse50 (+ |c_~#buffer~0.offset| .cse49))))) (or (not (= (select .cse50 (+ |c_~#buffer~0.offset| .cse49 (- 4294967296))) c_~value~0)) (< .cse49 2147483648))) .cse51))) (.cse31 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse37 (and (or .cse20 .cse22) (not (= .cse40 0)))) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse39 (or .cse3 .cse4 .cse26))) (and (or (< .cse0 .cse1) (not .cse2) (and (or .cse3 .cse4 .cse5) (or .cse3 .cse5 .cse6 (forall ((v_z_101 Int) (v_z_93 Int) (v_y_93 Int) (v_y_101 Int)) (let ((.cse15 (* v_y_101 4294967296))) (let ((.cse7 (* v_y_93 4294967296)) (.cse9 (+ c_~value~0 .cse15 v_z_101)) (.cse8 (mod (+ v_z_93 1) v_z_101)) (.cse11 (+ .cse15 v_z_101))) (or (< (+ v_z_93 .cse7) 0) (< (mod (mod (+ .cse8 1) 4294967296) v_z_101) 1) (< 16 .cse9) (< (+ .cse10 10) .cse11) (< .cse12 .cse11) (< 4294967295 v_z_101) (< .cse11 .cse13) (< v_z_101 (+ v_z_93 .cse7 1)) (< v_z_93 0) (< 4294967295 v_z_93) (< .cse9 10) (< .cse8 1) (< .cse11 .cse14))))))) (< (+ .cse10 6) c_~value~0)) (or .cse16 .cse17 .cse18 .cse3 .cse19 .cse20 .cse5 .cse21 .cse22) (or .cse23 (and (or .cse17 .cse24 .cse3 .cse20 .cse25 .cse6 .cse22) (or .cse3 .cse4 .cse26 .cse27))) (or .cse23 .cse3 .cse4 .cse28 .cse26) (or .cse3 .cse26) (or .cse3 (and (or .cse17 .cse24 .cse20 .cse29 .cse25 .cse22) (or .cse24 .cse18 .cse19 .cse4 .cse21 .cse30))) (or .cse23 (and (or .cse3 .cse25 .cse31) (or .cse3 .cse4 .cse28 .cse26))) (or .cse3 (forall ((v_z_93 Int) (v_y_93 Int)) (let ((.cse32 (* v_y_93 4294967296)) (.cse33 (mod (+ v_z_93 1) .cse34))) (or (< (+ v_z_93 .cse32) 0) (< v_z_93 0) (< (mod (mod (+ .cse33 1) 4294967296) .cse34) 1) (< 4294967295 v_z_93) (< .cse34 (+ v_z_93 .cse32 1)) (< .cse33 1)))) .cse5 .cse25 .cse6 .cse22) (or .cse16 .cse17 .cse24 .cse18 .cse3 .cse19 .cse20 .cse6 .cse21 .cse22) (or (not .cse35) .cse3 (let ((.cse36 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse1 c_~buffer_size~0) 11) (<= 10 .cse36) .cse2 (<= .cse13 c_~buffer_size~0) (<= c_~buffer_size~0 .cse12) (<= .cse36 16) (<= .cse14 c_~buffer_size~0)))) (or .cse23 .cse3 .cse4 .cse26 .cse27) (or .cse3 (and (or .cse18 .cse19 .cse4 .cse21 .cse30) (or .cse17 .cse20 .cse29 .cse25 .cse6 .cse22)) .cse31) (or (let ((.cse38 (< 0 .cse40))) (and (or .cse37 .cse18 .cse3 .cse19 .cse6 .cse21 .cse30 .cse38) (or .cse23 (and (or .cse37 .cse3 .cse25 .cse6 .cse38) .cse39)))) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse4 (and .cse41 (or .cse18 .cse3 .cse19 .cse5 .cse21 (and (forall ((v_z_98 Int) (v_y_98 Int)) (let ((.cse43 (* v_y_98 4294967296))) (let ((.cse42 (+ v_z_98 .cse43))) (or (< v_z_98 0) (= .cse42 0) (< .cse34 (+ v_z_98 .cse43 1)) (< (mod (+ v_z_98 1) .cse34) 1) (< 4294967295 v_z_98) (< .cse42 0))))) (or (forall ((v_z_97 Int) (v_y_97 Int)) (let ((.cse44 (* v_y_97 4294967296))) (or (< 4294967295 v_z_97) (< v_z_97 0) (< (mod (+ v_z_97 1) .cse34) 1) (< .cse34 (+ v_z_97 .cse44 1)) (< (+ v_z_97 .cse44) 0)))) .cse45)) .cse22))) (or .cse23 (and (or .cse17 .cse3 .cse20 .cse5 .cse25 .cse22) (or .cse3 .cse46 .cse4 .cse26))) (or (and (or .cse3 .cse5 .cse25 .cse6) (or .cse4 (and (or .cse18 .cse3 .cse19 .cse5 .cse21) .cse41))) .cse35) (or .cse18 .cse3 .cse19 .cse21 .cse30 .cse31) (or .cse37 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse3 .cse25 .cse6 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse39))))) is different from false Killed by 15