./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 76401ed0 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-76401ed-m [2024-06-20 18:15:27,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:15:27,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:15:27,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:15:27,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:15:27,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:15:27,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:15:27,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:15:27,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:15:27,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:15:27,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:15:27,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:15:27,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:15:27,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:15:27,743 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:15:27,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:15:27,744 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:15:27,744 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:15:27,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:15:27,745 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:15:27,745 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:15:27,746 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:15:27,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:15:27,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:15:27,747 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:15:27,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:15:27,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:15:27,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:15:27,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:15:27,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:15:27,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:15:27,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:15:27,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:15:27,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:15:27,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:15:27,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:15:27,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:15:27,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:15:27,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:15:27,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:15:27,752 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:15:27,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:15:27,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:15:27,753 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-20 18:15:28,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:15:28,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:15:28,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:15:28,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:15:28,033 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:15:28,035 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-20 18:15:29,184 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:15:29,453 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:15:29,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-20 18:15:29,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba47fbed/7fe8174d8b73414b82a5e1cb8a005212/FLAGc04c54db2 [2024-06-20 18:15:29,481 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ba47fbed/7fe8174d8b73414b82a5e1cb8a005212 [2024-06-20 18:15:29,484 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:15:29,485 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:15:29,486 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-20 18:15:29,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:15:29,610 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:15:29,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:15:29,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:15:29,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:15:29,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:15:29" (1/2) ... [2024-06-20 18:15:29,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f43edd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:15:29, skipping insertion in model container [2024-06-20 18:15:29,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:15:29" (1/2) ... [2024-06-20 18:15:29,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6a581cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:15:29, skipping insertion in model container [2024-06-20 18:15:29,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:15:29" (2/2) ... [2024-06-20 18:15:29,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f43edd5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:29, skipping insertion in model container [2024-06-20 18:15:29,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:15:29" (2/2) ... [2024-06-20 18:15:29,623 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:15:29,662 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:15:29,663 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-20 18:15:29,663 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-20 18:15:29,664 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-20 18:15:29,664 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:15:29,664 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-20 18:15:29,665 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-20 18:15:29,665 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-20 18:15:29,665 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-20 18:15:29,665 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-20 18:15:29,709 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:15:30,084 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:15:30,097 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-20 18:15:30,234 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:15:30,266 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:15:30,267 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30 WrapperNode [2024-06-20 18:15:30,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:15:30,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:15:30,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:15:30,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:15:30,274 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 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,291 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 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,331 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-20 18:15:30,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:15:30,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:15:30,333 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:15:30,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:15:30,348 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,354 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,369 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-20 18:15:30,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,370 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,415 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:15:30,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:15:30,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:15:30,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:15:30,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (1/1) ... [2024-06-20 18:15:30,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:15:30,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:30,447 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-20 18:15:30,460 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-20 18:15:30,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-20 18:15:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-20 18:15:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-20 18:15:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-20 18:15:30,496 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-20 18:15:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-20 18:15:30,497 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-20 18:15:30,497 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-20 18:15:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-20 18:15:30,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-20 18:15:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-20 18:15:30,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-20 18:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-20 18:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:15:30,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-20 18:15:30,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-20 18:15:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-20 18:15:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-20 18:15:30,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:15:30,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:15:30,505 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:15:30,697 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:15:30,699 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:15:31,057 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:15:31,057 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:15:31,299 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:15:31,299 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-20 18:15:31,300 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:15:31 BoogieIcfgContainer [2024-06-20 18:15:31,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:15:31,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:15:31,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:15:31,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:15:31,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:15:29" (1/4) ... [2024-06-20 18:15:31,305 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e4b09e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:15:31, skipping insertion in model container [2024-06-20 18:15:31,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:15:29" (2/4) ... [2024-06-20 18:15:31,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e4b09e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:15:31, skipping insertion in model container [2024-06-20 18:15:31,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:15:30" (3/4) ... [2024-06-20 18:15:31,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e4b09e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:15:31, skipping insertion in model container [2024-06-20 18:15:31,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:15:31" (4/4) ... [2024-06-20 18:15:31,308 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-20 18:15:31,325 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:15:31,326 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 18:15:31,326 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:15:31,370 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-20 18:15:31,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 72 flow [2024-06-20 18:15:31,440 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2024-06-20 18:15:31,440 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-20 18:15:31,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 2/27 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/23 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-20 18:15:31,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 72 flow [2024-06-20 18:15:31,447 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 59 flow [2024-06-20 18:15:31,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:15:31,474 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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;@4cf59398, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:15:31,474 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 18:15:31,479 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:15:31,480 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 18:15:31,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:15:31,481 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:31,481 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 18:15:31,482 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-20 18:15:31,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash 406286641, now seen corresponding path program 1 times [2024-06-20 18:15:31,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:31,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256034021] [2024-06-20 18:15:31,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:31,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:32,095 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-20 18:15:32,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:32,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256034021] [2024-06-20 18:15:32,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256034021] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:32,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:32,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:15:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331832600] [2024-06-20 18:15:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:32,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:15:32,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:32,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:15:32,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:15:32,160 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 18:15:32,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 18:15:32,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:32,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 18:15:32,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:32,477 INFO L124 PetriNetUnfolderBase]: 267/484 cut-off events. [2024-06-20 18:15:32,477 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-20 18:15:32,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 484 events. 267/484 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2009 event pairs, 95 based on Foata normal form. 24/497 useless extension candidates. Maximal degree in co-relation 899. Up to 308 conditions per place. [2024-06-20 18:15:32,484 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 3/39 dead transitions. [2024-06-20 18:15:32,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-06-20 18:15:32,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:15:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:15:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-20 18:15:32,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2024-06-20 18:15:32,499 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 55 transitions. [2024-06-20 18:15:32,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-06-20 18:15:32,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-20 18:15:32,505 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 65 flow [2024-06-20 18:15:32,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-06-20 18:15:32,511 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2024-06-20 18:15:32,511 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 65 flow [2024-06-20 18:15:32,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-20 18:15:32,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:32,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:15:32,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:15:32,513 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-20 18:15:32,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2116370505, now seen corresponding path program 1 times [2024-06-20 18:15:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:32,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926221353] [2024-06-20 18:15:32,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:32,553 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:32,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [755212644] [2024-06-20 18:15:32,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:32,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:32,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:32,560 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-20 18:15:32,583 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-20 18:15:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:32,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-20 18:15:32,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:32,898 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-20 18:15:32,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 18:15:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926221353] [2024-06-20 18:15:32,899 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:32,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755212644] [2024-06-20 18:15:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755212644] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:32,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:32,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:15:32,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671834437] [2024-06-20 18:15:32,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:32,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-20 18:15:32,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:32,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-20 18:15:32,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-20 18:15:32,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 18:15:32,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 65 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-20 18:15:32,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:32,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 18:15:32,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:33,213 INFO L124 PetriNetUnfolderBase]: 437/789 cut-off events. [2024-06-20 18:15:33,214 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-06-20 18:15:33,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1700 conditions, 789 events. 437/789 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3464 event pairs, 73 based on Foata normal form. 30/815 useless extension candidates. Maximal degree in co-relation 881. Up to 303 conditions per place. [2024-06-20 18:15:33,220 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 63 selfloop transitions, 13 changer transitions 0/80 dead transitions. [2024-06-20 18:15:33,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 80 transitions, 348 flow [2024-06-20 18:15:33,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-20 18:15:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-20 18:15:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-06-20 18:15:33,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6724137931034483 [2024-06-20 18:15:33,222 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 65 flow. Second operand 6 states and 117 transitions. [2024-06-20 18:15:33,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 80 transitions, 348 flow [2024-06-20 18:15:33,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 80 transitions, 345 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:15:33,225 INFO L231 Difference]: Finished difference. Result has 37 places, 36 transitions, 169 flow [2024-06-20 18:15:33,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=37, PETRI_TRANSITIONS=36} [2024-06-20 18:15:33,226 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2024-06-20 18:15:33,226 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 36 transitions, 169 flow [2024-06-20 18:15:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 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-20 18:15:33,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:33,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:15:33,244 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-20 18:15:33,439 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-20 18:15:33,440 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-20 18:15:33,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1049563989, now seen corresponding path program 1 times [2024-06-20 18:15:33,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:33,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272755599] [2024-06-20 18:15:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:33,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:33,454 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:33,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910519630] [2024-06-20 18:15:33,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:33,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:33,459 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-20 18:15:33,479 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-20 18:15:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:33,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-20 18:15:33,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:33,718 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-20 18:15:33,719 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 18:15:33,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272755599] [2024-06-20 18:15:33,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:33,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910519630] [2024-06-20 18:15:33,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910519630] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:33,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:33,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:15:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818521101] [2024-06-20 18:15:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:33,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:15:33,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:33,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:15:33,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:15:33,738 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 18:15:33,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 36 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-20 18:15:33,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:33,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 18:15:33,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:34,048 INFO L124 PetriNetUnfolderBase]: 685/1232 cut-off events. [2024-06-20 18:15:34,049 INFO L125 PetriNetUnfolderBase]: For 1327/1330 co-relation queries the response was YES. [2024-06-20 18:15:34,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3756 conditions, 1232 events. 685/1232 cut-off events. For 1327/1330 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5896 event pairs, 95 based on Foata normal form. 68/1299 useless extension candidates. Maximal degree in co-relation 3474. Up to 429 conditions per place. [2024-06-20 18:15:34,058 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 66 selfloop transitions, 8 changer transitions 2/80 dead transitions. [2024-06-20 18:15:34,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 80 transitions, 502 flow [2024-06-20 18:15:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:15:34,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:15:34,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2024-06-20 18:15:34,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2024-06-20 18:15:34,060 INFO L175 Difference]: Start difference. First operand has 37 places, 36 transitions, 169 flow. Second operand 5 states and 90 transitions. [2024-06-20 18:15:34,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 80 transitions, 502 flow [2024-06-20 18:15:34,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 80 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-20 18:15:34,065 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 214 flow [2024-06-20 18:15:34,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2024-06-20 18:15:34,066 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-20 18:15:34,066 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 214 flow [2024-06-20 18:15:34,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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-20 18:15:34,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:34,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:15:34,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-20 18:15:34,280 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-20 18:15:34,281 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-20 18:15:34,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:34,282 INFO L85 PathProgramCache]: Analyzing trace with hash 838617839, now seen corresponding path program 1 times [2024-06-20 18:15:34,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:34,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675073906] [2024-06-20 18:15:34,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:34,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:34,300 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1396096136] [2024-06-20 18:15:34,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:34,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:34,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:34,307 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-20 18:15:34,326 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-20 18:15:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:34,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-20 18:15:34,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:34,441 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-20 18:15:34,450 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-20 18:15:34,450 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 18:15:34,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:34,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675073906] [2024-06-20 18:15:34,451 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:34,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396096136] [2024-06-20 18:15:34,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396096136] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:34,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:34,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:15:34,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540723296] [2024-06-20 18:15:34,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:34,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:15:34,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:34,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:15:34,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:15:34,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 18:15:34,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 214 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-20 18:15:34,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:34,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 18:15:34,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:34,644 INFO L124 PetriNetUnfolderBase]: 429/824 cut-off events. [2024-06-20 18:15:34,644 INFO L125 PetriNetUnfolderBase]: For 859/879 co-relation queries the response was YES. [2024-06-20 18:15:34,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 824 events. 429/824 cut-off events. For 859/879 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 3599 event pairs, 169 based on Foata normal form. 47/840 useless extension candidates. Maximal degree in co-relation 1824. Up to 389 conditions per place. [2024-06-20 18:15:34,651 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 31 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2024-06-20 18:15:34,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 296 flow [2024-06-20 18:15:34,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:15:34,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:15:34,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-20 18:15:34,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2024-06-20 18:15:34,653 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 214 flow. Second operand 3 states and 54 transitions. [2024-06-20 18:15:34,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 296 flow [2024-06-20 18:15:34,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 291 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 18:15:34,656 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 194 flow [2024-06-20 18:15:34,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2024-06-20 18:15:34,657 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 12 predicate places. [2024-06-20 18:15:34,657 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 194 flow [2024-06-20 18:15:34,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 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-20 18:15:34,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:34,658 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-20 18:15:34,676 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-20 18:15:34,873 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-20 18:15:34,874 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-20 18:15:34,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 886366244, now seen corresponding path program 1 times [2024-06-20 18:15:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:34,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88914012] [2024-06-20 18:15:34,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:34,888 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [644031228] [2024-06-20 18:15:34,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:34,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:34,890 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-20 18:15:34,908 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-20 18:15:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:34,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-20 18:15:34,999 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:35,071 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-20 18:15:35,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 18:15:35,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88914012] [2024-06-20 18:15:35,072 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:35,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644031228] [2024-06-20 18:15:35,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644031228] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:35,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:35,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:15:35,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527731319] [2024-06-20 18:15:35,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:35,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-20 18:15:35,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:35,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-20 18:15:35,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-06-20 18:15:35,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 29 [2024-06-20 18:15:35,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-20 18:15:35,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:35,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 29 [2024-06-20 18:15:35,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:35,486 INFO L124 PetriNetUnfolderBase]: 1156/2093 cut-off events. [2024-06-20 18:15:35,486 INFO L125 PetriNetUnfolderBase]: For 3464/3464 co-relation queries the response was YES. [2024-06-20 18:15:35,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2093 events. 1156/2093 cut-off events. For 3464/3464 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11423 event pairs, 262 based on Foata normal form. 16/2100 useless extension candidates. Maximal degree in co-relation 1545. Up to 996 conditions per place. [2024-06-20 18:15:35,500 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 52 selfloop transitions, 16 changer transitions 10/80 dead transitions. [2024-06-20 18:15:35,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 80 transitions, 636 flow [2024-06-20 18:15:35,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-20 18:15:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-20 18:15:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2024-06-20 18:15:35,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-20 18:15:35,504 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 194 flow. Second operand 5 states and 70 transitions. [2024-06-20 18:15:35,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 80 transitions, 636 flow [2024-06-20 18:15:35,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 80 transitions, 618 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:15:35,512 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 374 flow [2024-06-20 18:15:35,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2024-06-20 18:15:35,514 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 17 predicate places. [2024-06-20 18:15:35,514 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 374 flow [2024-06-20 18:15:35,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 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-20 18:15:35,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:35,515 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-20 18:15:35,532 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-20 18:15:35,732 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-20 18:15:35,732 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-20 18:15:35,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:35,733 INFO L85 PathProgramCache]: Analyzing trace with hash 491989256, now seen corresponding path program 1 times [2024-06-20 18:15:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:35,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703569913] [2024-06-20 18:15:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:35,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:35,747 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:35,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612275878] [2024-06-20 18:15:35,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:35,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:35,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:35,751 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-20 18:15:35,754 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-20 18:15:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:35,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-20 18:15:35,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:36,063 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-20 18:15:36,567 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-20 18:15:36,568 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 18:15:36,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703569913] [2024-06-20 18:15:36,568 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:36,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612275878] [2024-06-20 18:15:36,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612275878] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:15:36,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:15:36,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-20 18:15:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657277169] [2024-06-20 18:15:36,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:15:36,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-20 18:15:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:36,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-20 18:15:36,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-06-20 18:15:36,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 18:15:36,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 374 flow. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-20 18:15:36,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:36,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 18:15:36,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:37,054 INFO L124 PetriNetUnfolderBase]: 625/1193 cut-off events. [2024-06-20 18:15:37,054 INFO L125 PetriNetUnfolderBase]: For 3152/3158 co-relation queries the response was YES. [2024-06-20 18:15:37,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1193 events. 625/1193 cut-off events. For 3152/3158 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5761 event pairs, 83 based on Foata normal form. 57/1249 useless extension candidates. Maximal degree in co-relation 2321. Up to 336 conditions per place. [2024-06-20 18:15:37,063 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 73 selfloop transitions, 19 changer transitions 7/101 dead transitions. [2024-06-20 18:15:37,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 101 transitions, 846 flow [2024-06-20 18:15:37,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-20 18:15:37,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-20 18:15:37,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 112 transitions. [2024-06-20 18:15:37,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-20 18:15:37,064 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 374 flow. Second operand 8 states and 112 transitions. [2024-06-20 18:15:37,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 101 transitions, 846 flow [2024-06-20 18:15:37,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 845 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:15:37,070 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 511 flow [2024-06-20 18:15:37,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=511, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-06-20 18:15:37,071 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-20 18:15:37,071 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 511 flow [2024-06-20 18:15:37,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 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-20 18:15:37,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:37,072 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:15:37,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-20 18:15:37,288 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-20 18:15:37,288 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-20 18:15:37,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:37,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1177163536, now seen corresponding path program 1 times [2024-06-20 18:15:37,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:37,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975190330] [2024-06-20 18:15:37,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:37,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:37,319 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [539324470] [2024-06-20 18:15:37,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:37,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:37,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:37,322 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-20 18:15:37,323 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-20 18:15:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:15:37,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-20 18:15:37,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:37,669 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-20 18:15:37,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 18:15:38,884 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-20 18:15:38,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:38,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975190330] [2024-06-20 18:15:38,884 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:38,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539324470] [2024-06-20 18:15:38,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539324470] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 18:15:38,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 18:15:38,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 11 [2024-06-20 18:15:38,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630411061] [2024-06-20 18:15:38,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 18:15:38,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-20 18:15:38,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-20 18:15:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-06-20 18:15:38,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 18:15:38,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 511 flow. Second operand has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 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-20 18:15:38,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:38,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 18:15:38,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:39,901 INFO L124 PetriNetUnfolderBase]: 1212/2356 cut-off events. [2024-06-20 18:15:39,901 INFO L125 PetriNetUnfolderBase]: For 8136/8146 co-relation queries the response was YES. [2024-06-20 18:15:39,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8945 conditions, 2356 events. 1212/2356 cut-off events. For 8136/8146 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 12850 event pairs, 172 based on Foata normal form. 87/2442 useless extension candidates. Maximal degree in co-relation 5122. Up to 619 conditions per place. [2024-06-20 18:15:39,918 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 147 selfloop transitions, 79 changer transitions 13/242 dead transitions. [2024-06-20 18:15:39,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 242 transitions, 2191 flow [2024-06-20 18:15:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-20 18:15:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-20 18:15:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 290 transitions. [2024-06-20 18:15:39,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2024-06-20 18:15:39,921 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 511 flow. Second operand 19 states and 290 transitions. [2024-06-20 18:15:39,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 242 transitions, 2191 flow [2024-06-20 18:15:39,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 242 transitions, 2126 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-06-20 18:15:39,937 INFO L231 Difference]: Finished difference. Result has 76 places, 116 transitions, 1412 flow [2024-06-20 18:15:39,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1412, PETRI_PLACES=76, PETRI_TRANSITIONS=116} [2024-06-20 18:15:39,938 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 46 predicate places. [2024-06-20 18:15:39,938 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 116 transitions, 1412 flow [2024-06-20 18:15:39,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.76923076923077) internal successors, (114), 13 states have internal predecessors, (114), 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-20 18:15:39,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:15:39,938 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:15:39,958 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-20 18:15:40,152 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-20 18:15:40,153 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-20 18:15:40,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:15:40,153 INFO L85 PathProgramCache]: Analyzing trace with hash 912283522, now seen corresponding path program 2 times [2024-06-20 18:15:40,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:15:40,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584099275] [2024-06-20 18:15:40,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:15:40,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:15:40,185 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:15:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474971930] [2024-06-20 18:15:40,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-20 18:15:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:15:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:15:40,194 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-20 18:15:40,212 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-20 18:15:40,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-20 18:15:40,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 18:15:40,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 20 conjunts are in the unsatisfiable core [2024-06-20 18:15:40,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:15:40,497 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-20 18:15:40,502 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-20 18:15:40,509 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-20 18:15:41,148 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-20 18:15:41,148 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 18:15:43,392 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-20 18:15:43,447 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-20 18:15:43,457 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-20 18:15:50,420 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-20 18:15:50,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:15:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584099275] [2024-06-20 18:15:50,421 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:15:50,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474971930] [2024-06-20 18:15:50,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474971930] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 18:15:50,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 18:15:50,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-06-20 18:15:50,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280628594] [2024-06-20 18:15:50,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 18:15:50,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-20 18:15:50,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:15:50,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-20 18:15:50,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=243, Unknown=1, NotChecked=0, Total=342 [2024-06-20 18:15:50,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 18:15:50,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 116 transitions, 1412 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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-20 18:15:50,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:15:50,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 18:15:50,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:15:56,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:04,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:07,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:12,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:20,249 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-20 18:16:20,971 INFO L124 PetriNetUnfolderBase]: 2889/5276 cut-off events. [2024-06-20 18:16:20,971 INFO L125 PetriNetUnfolderBase]: For 40429/40432 co-relation queries the response was YES. [2024-06-20 18:16:20,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23141 conditions, 5276 events. 2889/5276 cut-off events. For 40429/40432 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 31515 event pairs, 323 based on Foata normal form. 187/5462 useless extension candidates. Maximal degree in co-relation 18449. Up to 1075 conditions per place. [2024-06-20 18:16:21,022 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 284 selfloop transitions, 122 changer transitions 39/446 dead transitions. [2024-06-20 18:16:21,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 446 transitions, 4851 flow [2024-06-20 18:16:21,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-06-20 18:16:21,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-06-20 18:16:21,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 397 transitions. [2024-06-20 18:16:21,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38026819923371646 [2024-06-20 18:16:21,027 INFO L175 Difference]: Start difference. First operand has 76 places, 116 transitions, 1412 flow. Second operand 36 states and 397 transitions. [2024-06-20 18:16:21,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 446 transitions, 4851 flow [2024-06-20 18:16:21,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 446 transitions, 4425 flow, removed 185 selfloop flow, removed 4 redundant places. [2024-06-20 18:16:21,094 INFO L231 Difference]: Finished difference. Result has 127 places, 202 transitions, 2603 flow [2024-06-20 18:16:21,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1246, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=2603, PETRI_PLACES=127, PETRI_TRANSITIONS=202} [2024-06-20 18:16:21,094 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 97 predicate places. [2024-06-20 18:16:21,095 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 202 transitions, 2603 flow [2024-06-20 18:16:21,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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-20 18:16:21,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:16:21,095 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:16:21,110 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-20 18:16:21,295 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-20 18:16:21,296 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-20 18:16:21,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:16:21,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1244684880, now seen corresponding path program 3 times [2024-06-20 18:16:21,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:16:21,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502932928] [2024-06-20 18:16:21,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:16:21,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:16:21,318 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:16:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569962243] [2024-06-20 18:16:21,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-20 18:16:21,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:16:21,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:16:21,320 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-20 18:16:21,322 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-20 18:16:21,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-20 18:16:21,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 18:16:21,477 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-20 18:16:21,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:16:21,655 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-20 18:16:21,662 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-20 18:16:21,715 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-20 18:16:22,267 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-20 18:16:22,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 18:16:24,256 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-20 18:16:24,334 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-20 18:16:24,346 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-20 18:16:26,542 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-20 18:16:26,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:16:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502932928] [2024-06-20 18:16:26,543 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:16:26,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569962243] [2024-06-20 18:16:26,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569962243] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 18:16:26,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 18:16:26,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-06-20 18:16:26,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075721190] [2024-06-20 18:16:26,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 18:16:26,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-20 18:16:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:16:26,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-20 18:16:26,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-06-20 18:16:26,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 18:16:26,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 202 transitions, 2603 flow. Second operand has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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-20 18:16:26,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:16:26,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 18:16:26,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:16:32,687 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-20 18:16:38,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:42,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:51,445 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-20 18:16:57,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:16:59,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:17:00,173 INFO L124 PetriNetUnfolderBase]: 4625/8295 cut-off events. [2024-06-20 18:17:00,173 INFO L125 PetriNetUnfolderBase]: For 91617/91620 co-relation queries the response was YES. [2024-06-20 18:17:00,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41362 conditions, 8295 events. 4625/8295 cut-off events. For 91617/91620 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 51809 event pairs, 547 based on Foata normal form. 226/8520 useless extension candidates. Maximal degree in co-relation 41002. Up to 1549 conditions per place. [2024-06-20 18:17:00,233 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 360 selfloop transitions, 172 changer transitions 102/635 dead transitions. [2024-06-20 18:17:00,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 635 transitions, 8040 flow [2024-06-20 18:17:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-06-20 18:17:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-06-20 18:17:00,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 443 transitions. [2024-06-20 18:17:00,239 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44929006085192696 [2024-06-20 18:17:00,239 INFO L175 Difference]: Start difference. First operand has 127 places, 202 transitions, 2603 flow. Second operand 34 states and 443 transitions. [2024-06-20 18:17:00,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 635 transitions, 8040 flow [2024-06-20 18:17:00,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 635 transitions, 7234 flow, removed 357 selfloop flow, removed 14 redundant places. [2024-06-20 18:17:00,578 INFO L231 Difference]: Finished difference. Result has 162 places, 275 transitions, 3886 flow [2024-06-20 18:17:00,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=3886, PETRI_PLACES=162, PETRI_TRANSITIONS=275} [2024-06-20 18:17:00,579 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 132 predicate places. [2024-06-20 18:17:00,579 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 275 transitions, 3886 flow [2024-06-20 18:17:00,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.315789473684211) internal successors, (101), 19 states have internal predecessors, (101), 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-20 18:17:00,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:17:00,580 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] [2024-06-20 18:17:00,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-20 18:17:00,783 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-20 18:17:00,783 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-20 18:17:00,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:17:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1076370039, now seen corresponding path program 1 times [2024-06-20 18:17:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:17:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026640048] [2024-06-20 18:17:00,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:17:00,808 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:17:00,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755217580] [2024-06-20 18:17:00,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:17:00,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:17:00,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:17:00,810 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-20 18:17:00,818 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-20 18:17:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:17:00,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 25 conjunts are in the unsatisfiable core [2024-06-20 18:17:00,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:17:01,139 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-20 18:17:01,142 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-20 18:17:01,174 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-20 18:17:01,830 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-20 18:17:01,839 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-20 18:17:01,842 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-20 18:17:01,937 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-20 18:17:03,034 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-20 18:17:03,039 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-20 18:17:03,230 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-20 18:17:04,113 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-20 18:17:04,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 18:17:06,828 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-20 18:17:06,838 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-20 18:17:11,359 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-20 18:17:11,473 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-20 18:17:14,745 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-20 18:17:14,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:17:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026640048] [2024-06-20 18:17:14,746 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:17:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755217580] [2024-06-20 18:17:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755217580] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 18:17:14,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 18:17:14,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2024-06-20 18:17:14,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588403657] [2024-06-20 18:17:14,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 18:17:14,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-20 18:17:14,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:17:14,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-20 18:17:14,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=556, Unknown=0, NotChecked=0, Total=756 [2024-06-20 18:17:14,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 18:17:14,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 275 transitions, 3886 flow. Second operand has 28 states, 28 states have (on average 5.5) internal successors, (154), 28 states have internal predecessors, (154), 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-20 18:17:14,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:17:14,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 18:17:14,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:17:14,958 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse33 (mod c_~buffer_size~0 4294967296)) (.cse47 (mod c_~next~0 4294967296)) (.cse49 (mod c_~first~0 4294967296))) (let ((.cse48 (+ .cse49 1)) (.cse12 (< .cse33 (+ .cse47 1))) (.cse17 (< c_~buffer_size~0 1)) (.cse21 (mod c_~receive~0 256)) (.cse13 (= (mod c_~send~0 256) 0))) (let ((.cse42 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse28 (not .cse13)) (.cse22 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (= .cse21 0)) (.cse45 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse46 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse43 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse44 (or .cse12 .cse17)) (.cse30 (< .cse33 .cse48)) (.cse34 (not (= (+ c_~value~0 1) 0))) (.cse51 (< .cse47 1)) (.cse50 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (let ((.cse20 (= |c_#ghost~m_locked| 0)) (.cse19 (and (or .cse34 (< 0 .cse47)) (or .cse51 (and (forall ((v_y_67 Int) (|~#buffer~0.offset| Int) (v_z_67 Int)) (let ((.cse52 (* v_y_67 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| (- 1) v_z_67)))) (< .cse33 (+ v_z_67 .cse52 1)) (= v_z_67 0) (< (+ v_z_67 .cse52) 0) (< 2147483648 v_z_67) (< v_z_67 0)))) (forall ((v_z_68 Int) (v_y_68 Int) (|~#buffer~0.offset| Int)) (let ((.cse53 (* v_y_68 4294967296))) (or (< v_z_68 2147483649) (< (+ v_z_68 .cse53) 0) (< .cse33 v_z_68) (< .cse33 (+ v_z_68 .cse53 1)) (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| v_z_68 (- 4294967297)))))))))))) (.cse23 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (and (or (and (<= 1 .cse47) (<= .cse48 .cse33)) .cse34) (or .cse30 (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))) (.cse27 (and (not (= .cse43 0)) .cse44)) (.cse10 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse33) 1)) (.cse24 (= .cse46 0)) (.cse25 (and (<= 0 .cse45) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse26 (< .cse46 0)) (.cse9 (not .cse4)) (.cse0 (and .cse44 (not (= .cse45 0)))) (.cse1 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse7 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (or .cse3 .cse28 .cse22)) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse43))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse29 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse6 (< 2147483647 c_~value~0)) (.cse14 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse15 (= .cse42 0)) (.cse16 (< .cse42 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (and (or .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18)) (= c_~value~0 0) (or .cse3 .cse13) (or .cse10 .cse11 .cse2 .cse3 .cse4 .cse12 .cse6 .cse19 .cse14 .cse15 .cse16 .cse17) (or (not .cse20) .cse3 (and (= .cse21 1) (= c_~buffer_size~0 10))) (or .cse3 .cse22) (or .cse9 (and (or .cse10 .cse23 .cse3 .cse24 .cse12 .cse13 .cse25 .cse26 .cse17) .cse18)) .cse20 (or .cse23 .cse2 .cse3 .cse4 .cse6 .cse8 .cse27 .cse25 .cse26) (= c_~receive~0 0) (or .cse9 (and (or .cse23 .cse3 .cse13 .cse27 .cse25 .cse26) .cse18)) (or .cse10 .cse23 .cse2 .cse3 .cse4 .cse24 .cse12 .cse6 .cse19 .cse25 .cse26 .cse17) (or .cse23 .cse3 (and (or .cse2 .cse28 .cse29 .cse6 .cse8 .cse27) (or .cse10 .cse24 .cse12 .cse30 .cse13 .cse17)) .cse25 .cse26) (or .cse9 .cse3 .cse28 .cse22) (= c_~send~0 1) (or .cse9 (and (or .cse0 .cse1 .cse3 .cse13 .cse5 .cse7) .cse18)) (or .cse11 .cse3 (and (or .cse28 (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse32 (* v_y_87 4294967296))) (let ((.cse31 (+ v_z_87 .cse32))) (or (< v_z_87 0) (< 4294967295 .cse31) (< .cse31 0) (< (mod (+ v_z_87 .cse32 1) .cse33) 1) (< .cse33 (+ v_z_87 1)))))) .cse34) (or (forall ((v_z_73 Int) (v_y_73 Int) (v_y_85 Int) (v_y_75 Int)) (let ((.cse35 (+ v_z_73 1))) (let ((.cse36 (* v_y_85 4294967296)) (.cse39 (* v_y_73 4294967296)) (.cse38 (mod .cse35 .cse33)) (.cse37 (* v_y_75 4294967296))) (or (< .cse35 (+ .cse36 .cse37)) (< (+ 4294967295 .cse37) .cse38) (< (+ .cse36 4294967294 .cse37) v_z_73) (< .cse38 .cse37) (< v_z_73 0) (< (+ .cse39 v_z_73) 0) (< (mod (+ .cse38 (* v_y_75 (- 4294967296)) 1) .cse33) 1) (< .cse33 (+ .cse39 v_z_73 1)) (< 4294967295 v_z_73) (= .cse38 .cse37))))) .cse13 .cse5) (or .cse2 .cse28 .cse29 .cse6 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse41 (* v_y_85 4294967296))) (let ((.cse40 (+ .cse41 v_z_85))) (or (< 4294967295 .cse40) (< .cse33 (+ v_z_85 1)) (< v_z_85 0) (= .cse40 0) (< (mod (+ .cse41 v_z_85 1) .cse33) 1) (< .cse40 0))))))) .cse14 .cse15 .cse16 .cse17) (or .cse3 .cse28 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse22)))))) is different from false [2024-06-20 18:17:23,964 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-20 18:17:26,722 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~buffer_size~0 4294967296)) (.cse48 (mod c_~next~0 4294967296)) (.cse50 (mod c_~first~0 4294967296))) (let ((.cse49 (+ .cse50 1)) (.cse12 (< .cse34 (+ .cse48 1))) (.cse17 (< c_~buffer_size~0 1)) (.cse21 (mod c_~receive~0 256)) (.cse13 (= (mod c_~send~0 256) 0))) (let ((.cse43 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse28 (not .cse13)) (.cse22 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (= .cse21 0)) (.cse46 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse47 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse44 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse45 (or .cse12 .cse17)) (.cse30 (< .cse34 .cse49)) (.cse35 (not (= (+ c_~value~0 1) 0))) (.cse52 (< .cse48 1)) (.cse51 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (let ((.cse19 (and (or .cse35 (< 0 .cse48)) (or .cse52 (and (forall ((v_y_67 Int) (|~#buffer~0.offset| Int) (v_z_67 Int)) (let ((.cse53 (* v_y_67 4294967296))) (or (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| (- 1) v_z_67)))) (< .cse34 (+ v_z_67 .cse53 1)) (= v_z_67 0) (< (+ v_z_67 .cse53) 0) (< 2147483648 v_z_67) (< v_z_67 0)))) (forall ((v_z_68 Int) (v_y_68 Int) (|~#buffer~0.offset| Int)) (let ((.cse54 (* v_y_68 4294967296))) (or (< v_z_68 2147483649) (< (+ v_z_68 .cse54) 0) (< .cse34 v_z_68) (< .cse34 (+ v_z_68 .cse54 1)) (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| v_z_68 (- 4294967297)))))))))))) (.cse23 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (and (or (and (<= 1 .cse48) (<= .cse49 .cse34)) .cse35) (or .cse30 (and (or (< 2147483647 .cse50) (not (= c_~value~0 (select .cse51 (+ |c_~#buffer~0.offset| .cse50))))) (or (not (= (select .cse51 (+ |c_~#buffer~0.offset| .cse50 (- 4294967296))) c_~value~0)) (< .cse50 2147483648))) .cse52))) (.cse27 (and (not (= .cse44 0)) .cse45)) (.cse10 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse24 (= .cse47 0)) (.cse25 (and (<= 0 .cse46) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse26 (< .cse47 0)) (.cse20 (= |c_#ghost~m_locked| 0)) (.cse9 (not .cse4)) (.cse0 (and .cse45 (not (= .cse46 0)))) (.cse1 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse7 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (or .cse3 .cse28 .cse22)) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse44))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse29 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse6 (< 2147483647 c_~value~0)) (.cse14 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse15 (= .cse43 0)) (.cse16 (< .cse43 0)) (.cse31 (not (= (mod (* 255 c_~receive~0) 256) 0)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (or .cse9 (and (or .cse10 .cse11 .cse3 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17) .cse18)) (or .cse3 .cse13) (or .cse10 .cse11 .cse2 .cse3 .cse4 .cse12 .cse6 .cse19 .cse14 .cse15 .cse16 .cse17) (or (not .cse20) .cse3 (and (= .cse21 1) (= c_~buffer_size~0 10))) (or .cse3 .cse22) (or .cse9 (and (or .cse10 .cse23 .cse3 .cse24 .cse12 .cse13 .cse25 .cse26 .cse17) .cse18)) (or .cse23 .cse2 .cse3 .cse4 .cse6 .cse8 .cse27 .cse25 .cse26) (or .cse9 (and (or .cse23 .cse3 .cse13 .cse27 .cse25 .cse26) .cse18)) (or .cse10 .cse23 .cse2 .cse3 .cse4 .cse24 .cse12 .cse6 .cse19 .cse25 .cse26 .cse17) (or .cse23 .cse3 (and (or .cse2 .cse28 .cse29 .cse6 .cse8 .cse27) (or .cse10 .cse24 .cse12 .cse30 .cse13 .cse17)) .cse25 .cse26) (or .cse28 .cse20 .cse31 .cse22) (or .cse9 .cse3 .cse28 .cse22) (or .cse9 (and (or .cse0 .cse1 .cse3 .cse13 .cse5 .cse7) .cse18)) (or .cse11 .cse3 (and (or .cse28 (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse33 (* v_y_87 4294967296))) (let ((.cse32 (+ v_z_87 .cse33))) (or (< v_z_87 0) (< 4294967295 .cse32) (< .cse32 0) (< (mod (+ v_z_87 .cse33 1) .cse34) 1) (< .cse34 (+ v_z_87 1)))))) .cse35) (or (forall ((v_z_73 Int) (v_y_73 Int) (v_y_85 Int) (v_y_75 Int)) (let ((.cse36 (+ v_z_73 1))) (let ((.cse37 (* v_y_85 4294967296)) (.cse40 (* v_y_73 4294967296)) (.cse39 (mod .cse36 .cse34)) (.cse38 (* v_y_75 4294967296))) (or (< .cse36 (+ .cse37 .cse38)) (< (+ 4294967295 .cse38) .cse39) (< (+ .cse37 4294967294 .cse38) v_z_73) (< .cse39 .cse38) (< v_z_73 0) (< (+ .cse40 v_z_73) 0) (< (mod (+ .cse39 (* v_y_75 (- 4294967296)) 1) .cse34) 1) (< .cse34 (+ .cse40 v_z_73 1)) (< 4294967295 v_z_73) (= .cse39 .cse38))))) .cse13 .cse5) (or .cse2 .cse28 .cse29 .cse6 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse42 (* v_y_85 4294967296))) (let ((.cse41 (+ .cse42 v_z_85))) (or (< 4294967295 .cse41) (< .cse34 (+ v_z_85 1)) (< v_z_85 0) (= .cse41 0) (< (mod (+ .cse42 v_z_85 1) .cse34) 1) (< .cse41 0))))))) .cse14 .cse15 .cse16 .cse17) (or .cse3 .cse28 .cse31 .cse22)))))) is different from false [2024-06-20 18:17:32,939 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse18 (mod c_~buffer_size~0 4294967296)) (.cse15 (mod c_~next~0 4294967296))) (let ((.cse3 (= |c_#ghost~multithreaded| 0)) (.cse5 (= (mod c_~send~0 256) 0)) (.cse21 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (< .cse18 (+ .cse15 1))) (.cse9 (< c_~buffer_size~0 1)) (.cse12 (= (mod c_~receive~0 256) 0)) (.cse29 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse28 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse2 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse28))) (.cse6 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (= .cse29 0)) (.cse8 (< .cse29 0)) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse13 (< 2147483647 c_~value~0)) (.cse14 (not (= (+ c_~value~0 1) 0))) (.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse16 (< .cse15 1)) (.cse0 (not .cse12)) (.cse22 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse25 (and (not (= .cse28 0)) (or .cse4 .cse9))) (.cse26 (and (<= 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse27 (< (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse10 (or .cse3 (not .cse5) .cse21))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10)) (or .cse3 .cse5) (or .cse1 .cse2 .cse11 .cse3 .cse12 .cse4 .cse13 (and (or .cse14 (< 0 .cse15)) (or .cse16 (and (forall ((v_y_67 Int) (|~#buffer~0.offset| Int) (v_z_67 Int)) (let ((.cse19 (* v_y_67 4294967296))) (or (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_67)))) (< .cse18 (+ v_z_67 .cse19 1)) (= v_z_67 0) (< (+ v_z_67 .cse19) 0) (< 2147483648 v_z_67) (< v_z_67 0)))) (forall ((v_z_68 Int) (v_y_68 Int) (|~#buffer~0.offset| Int)) (let ((.cse20 (* v_y_68 4294967296))) (or (< v_z_68 2147483649) (< (+ v_z_68 .cse20) 0) (< .cse18 v_z_68) (< .cse18 (+ v_z_68 .cse20 1)) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_68 (- 4294967297))))))))))) .cse6 .cse7 .cse8 .cse9) (or .cse3 .cse21) (or .cse22 .cse11 .cse3 .cse12 .cse13 (let ((.cse24 (mod c_~first~0 4294967296))) (let ((.cse23 (+ .cse24 1))) (and (or (and (<= 1 .cse15) (<= .cse23 .cse18)) .cse14) (or (< .cse18 .cse23) (and (or (< 2147483647 .cse24) (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse24))))) (or (not (= (select .cse17 (+ |c_~#buffer~0.offset| .cse24 (- 4294967296))) c_~value~0)) (< .cse24 2147483648))) .cse16)))) .cse25 .cse26 .cse27) (or .cse0 (and (or .cse22 .cse3 .cse5 .cse25 .cse26 .cse27) .cse10)))))) is different from false [2024-06-20 18:17:36,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:18:05,124 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~buffer_size~0 4294967296)) (.cse8 (mod c_~next~0 4294967296)) (.cse15 (= (mod c_~send~0 256) 0))) (let ((.cse3 (= |c_#ghost~multithreaded| 0)) (.cse28 (not .cse15)) (.cse16 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse21 (< .cse10 (+ .cse8 1))) (.cse24 (< c_~buffer_size~0 1)) (.cse4 (= (mod c_~receive~0 256) 0)) (.cse39 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse40 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (let ((.cse18 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse10) 1)) (.cse19 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (= .cse40 0)) (.cse14 (< .cse8 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (and (<= 0 .cse39) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse23 (< .cse40 0)) (.cse17 (not .cse4)) (.cse0 (and (or .cse21 .cse24) (not (= .cse39 0)))) (.cse1 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse7 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse25 (or .cse3 .cse28 .cse16)) (.cse11 (not (= (+ c_~value~0 1) 0))) (.cse5 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse2 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0))) (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 .cse3 .cse15) (or .cse3 .cse16) (or .cse17 (and (or .cse18 .cse19 .cse3 .cse20 .cse21 .cse15 .cse22 .cse23 .cse24) .cse25)) (or .cse18 .cse19 .cse2 .cse3 .cse4 .cse20 .cse21 .cse6 (and (or .cse11 (< 0 .cse8)) (or .cse14 (and (forall ((v_y_67 Int) (|~#buffer~0.offset| Int) (v_z_67 Int)) (let ((.cse26 (* v_y_67 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_67)))) (< .cse10 (+ v_z_67 .cse26 1)) (= v_z_67 0) (< (+ v_z_67 .cse26) 0) (< 2147483648 v_z_67) (< v_z_67 0)))) (forall ((v_z_68 Int) (v_y_68 Int) (|~#buffer~0.offset| Int)) (let ((.cse27 (* v_y_68 4294967296))) (or (< v_z_68 2147483649) (< (+ v_z_68 .cse27) 0) (< .cse10 v_z_68) (< .cse10 (+ v_z_68 .cse27 1)) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_68 (- 4294967297))))))))))) .cse22 .cse23 .cse24) (or .cse17 (and (or .cse0 .cse1 .cse3 .cse15 .cse5 .cse7) .cse25)) (let ((.cse38 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse3 (and (or .cse28 (forall ((v_z_87 Int) (v_y_87 Int)) (let ((.cse30 (* v_y_87 4294967296))) (let ((.cse29 (+ v_z_87 .cse30))) (or (< v_z_87 0) (< 4294967295 .cse29) (< .cse29 0) (< (mod (+ v_z_87 .cse30 1) .cse10) 1) (< .cse10 (+ v_z_87 1)))))) .cse11) (or (forall ((v_z_73 Int) (v_y_73 Int) (v_y_85 Int) (v_y_75 Int)) (let ((.cse31 (+ v_z_73 1))) (let ((.cse32 (* v_y_85 4294967296)) (.cse35 (* v_y_73 4294967296)) (.cse34 (mod .cse31 .cse10)) (.cse33 (* v_y_75 4294967296))) (or (< .cse31 (+ .cse32 .cse33)) (< (+ 4294967295 .cse33) .cse34) (< (+ .cse32 4294967294 .cse33) v_z_73) (< .cse34 .cse33) (< v_z_73 0) (< (+ .cse35 v_z_73) 0) (< (mod (+ .cse34 (* v_y_75 (- 4294967296)) 1) .cse10) 1) (< .cse10 (+ .cse35 v_z_73 1)) (< 4294967295 v_z_73) (= .cse34 .cse33))))) .cse15 .cse5) (or .cse2 .cse28 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (forall ((v_z_85 Int) (v_y_85 Int)) (let ((.cse37 (* v_y_85 4294967296))) (let ((.cse36 (+ .cse37 v_z_85))) (or (< 4294967295 .cse36) (< .cse10 (+ v_z_85 1)) (< v_z_85 0) (= .cse36 0) (< (mod (+ .cse37 v_z_85 1) .cse10) 1) (< .cse36 0))))))) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (= .cse38 0) (< .cse38 0) .cse24)) (or .cse3 .cse28 (not (= (mod (* 255 c_~receive~0) 256) 0)) .cse16))))) is different from false [2024-06-20 18:18:34,585 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-20 18:18:38,666 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-20 18:18:42,678 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-20 18:18:54,918 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-20 18:19:05,331 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-20 18:19:09,363 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-20 18:19:21,016 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-20 18:19:34,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:19:43,406 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-20 18:19:52,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:20:44,445 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-20 18:21:09,050 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 [0] [2024-06-20 18:21:17,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:22:00,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-20 18:22:28,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-06-20 18:22:31,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:22:35,894 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-20 18:22:39,966 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-20 18:22:45,050 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-20 18:22:54,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0, 1] [2024-06-20 18:22:59,217 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 [0, 1] [2024-06-20 18:23:05,243 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-20 18:23:28,795 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-20 18:24:11,621 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-20 18:24:15,631 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-20 18:24:59,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:25:00,118 INFO L124 PetriNetUnfolderBase]: 14636/26486 cut-off events. [2024-06-20 18:25:00,118 INFO L125 PetriNetUnfolderBase]: For 396239/396243 co-relation queries the response was YES. [2024-06-20 18:25:00,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152071 conditions, 26486 events. 14636/26486 cut-off events. For 396239/396243 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 205440 event pairs, 1425 based on Foata normal form. 113/26596 useless extension candidates. Maximal degree in co-relation 147198. Up to 4927 conditions per place. [2024-06-20 18:25:00,378 INFO L140 encePairwiseOnDemand]: 10/29 looper letters, 881 selfloop transitions, 1052 changer transitions 19/1953 dead transitions. [2024-06-20 18:25:00,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 1953 transitions, 29110 flow [2024-06-20 18:25:00,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-06-20 18:25:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2024-06-20 18:25:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 1172 transitions. [2024-06-20 18:25:00,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35142428785607194 [2024-06-20 18:25:00,387 INFO L175 Difference]: Start difference. First operand has 162 places, 275 transitions, 3886 flow. Second operand 115 states and 1172 transitions. [2024-06-20 18:25:00,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 1953 transitions, 29110 flow [2024-06-20 18:25:02,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 1953 transitions, 25173 flow, removed 1598 selfloop flow, removed 17 redundant places. [2024-06-20 18:25:02,472 INFO L231 Difference]: Finished difference. Result has 322 places, 1348 transitions, 21670 flow [2024-06-20 18:25:02,473 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3303, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=171, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=115, PETRI_FLOW=21670, PETRI_PLACES=322, PETRI_TRANSITIONS=1348} [2024-06-20 18:25:02,473 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 292 predicate places. [2024-06-20 18:25:02,474 INFO L495 AbstractCegarLoop]: Abstraction has has 322 places, 1348 transitions, 21670 flow [2024-06-20 18:25:02,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.5) internal successors, (154), 28 states have internal predecessors, (154), 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-20 18:25:02,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:25:02,474 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] [2024-06-20 18:25:02,490 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-20 18:25:02,685 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-20 18:25:02,686 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-20 18:25:02,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:25:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash -794908097, now seen corresponding path program 2 times [2024-06-20 18:25:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:25:02,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284502194] [2024-06-20 18:25:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:25:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:25:02,707 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 18:25:02,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829895632] [2024-06-20 18:25:02,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-20 18:25:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 18:25:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:25:02,709 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-20 18:25:02,727 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-20 18:25:02,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-20 18:25:02,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 18:25:02,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-20 18:25:02,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 18:25:03,093 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-20 18:25:03,099 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-20 18:25:03,102 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-20 18:25:03,808 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-20 18:25:03,828 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-20 18:25:03,887 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-20 18:25:03,892 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-20 18:25:05,761 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-20 18:25:05,808 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 18:25:05,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 18:25:07,706 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-20 18:25:07,712 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-20 18:25:09,596 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-20 18:25:09,612 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-20 18:25:14,222 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-20 18:25:14,305 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-20 18:25:14,337 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-20 18:25:21,799 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-20 18:25:21,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:25:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284502194] [2024-06-20 18:25:21,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 18:25:21,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829895632] [2024-06-20 18:25:21,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829895632] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 18:25:21,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 18:25:21,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2024-06-20 18:25:21,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538963849] [2024-06-20 18:25:21,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 18:25:21,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-20 18:25:21,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:25:21,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-20 18:25:21,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=697, Unknown=4, NotChecked=0, Total=930 [2024-06-20 18:25:22,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 18:25:22,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 1348 transitions, 21670 flow. Second operand has 31 states, 31 states have (on average 5.258064516129032) internal successors, (163), 31 states have internal predecessors, (163), 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-20 18:25:22,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:25:22,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 18:25:22,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:25:22,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse61 (mod c_~first~0 4294967296)) (.cse15 (mod c_~receive~0 256)) (.cse28 (mod c_~send~0 256))) (let ((.cse2 (= .cse28 0)) (.cse38 (= .cse15 0)) (.cse55 (mod c_~next~0 4294967296)) (.cse30 (mod c_~buffer_size~0 4294967296)) (.cse60 (+ .cse61 1)) (.cse14 (+ c_~value~0 1))) (let ((.cse9 (= |c_#ghost~m_locked| 0)) (.cse36 (not (= .cse14 0))) (.cse50 (< .cse30 .cse60)) (.cse58 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse56 (< .cse55 1)) (.cse45 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (not .cse38)) (.cse53 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (not .cse2)) (.cse10 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse4 (= |c_#ghost~multithreaded| 0)) (.cse51 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse12 (or .cse4 .cse2 .cse51)) (.cse48 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse16 (= (+ .cse28 .cse15) 1)) (.cse26 (+ 9 .cse15)) (.cse25 (+ c_~value~0 10)) (.cse21 (+ c_~value~0 4)) (.cse44 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse11 (or .cse7 .cse4 .cse53 .cse8 .cse10)) (.cse13 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse47 (or .cse4 .cse8 .cse45 .cse10)) (.cse49 (and (or (and (<= 1 .cse55) (<= .cse60 .cse30)) .cse36) (or .cse50 (and (or (< 2147483647 .cse61) (not (= c_~value~0 (select .cse58 (+ |c_~#buffer~0.offset| .cse61))))) (or (not (= (select .cse58 (+ |c_~#buffer~0.offset| .cse61 (- 4294967296))) c_~value~0)) (< .cse61 2147483648))) .cse56))) (.cse5 (not .cse9)) (.cse6 (= c_~buffer_size~0 10)) (.cse46 (or .cse4 .cse10)) (.cse42 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse30) 1)) (.cse43 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse37 (< (+ c_~value~0 2147483648) 0)) (.cse0 (< .cse30 (+ .cse55 1))) (.cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse39 (< 2147483647 c_~value~0)) (.cse54 (and (or .cse36 (< 0 .cse55)) (or .cse56 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse57 (* v_y_106 4294967296))) (or (< .cse30 v_z_106) (< (+ v_z_106 .cse57) 0) (< .cse30 (+ v_z_106 .cse57 1)) (not (= c_~value~0 (select .cse58 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse59 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse58 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse59) 0) (< .cse30 (+ v_z_106 .cse59 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse1 (< c_~buffer_size~0 1))) (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 .cse7 .cse8 .cse9 .cse10) .cse11 .cse12 (or .cse4 .cse13 (< .cse14 .cse15) (not .cse16) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse27 (+ v_z_110 1)) (.cse19 (* v_y_126 4294967296))) (let ((.cse18 (+ c_~value~0 v_z_126 .cse19)) (.cse17 (* v_y_110 4294967296)) (.cse20 (+ v_z_126 .cse19)) (.cse22 (mod .cse27 v_z_126)) (.cse24 (* v_y_120 4294967296)) (.cse23 (* v_y_112 4294967296))) (or (< (+ .cse17 v_z_110) 0) (< 16 .cse18) (< 11 (+ .cse15 v_z_126 .cse19)) (< .cse18 10) (< .cse20 .cse21) (< .cse22 .cse23) (< 4294967295 v_z_110) (= .cse22 .cse23) (< 4294967295 v_z_126) (< v_z_126 (+ .cse17 v_z_110 1)) (< (+ 4294967295 .cse24 .cse23) .cse22) (< .cse25 .cse20) (< .cse20 .cse26) (< (+ 4294967295 .cse23) .cse22) (< (mod (+ .cse22 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse27 (+ .cse24 .cse23)))))) .cse3) .cse8) (< (+ .cse28 6) c_~value~0)) (or .cse4 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse34 (+ v_z_110 1))) (let ((.cse29 (* v_y_110 4294967296)) (.cse32 (mod .cse34 .cse30)) (.cse33 (* v_y_120 4294967296)) (.cse31 (* v_y_112 4294967296))) (or (< (+ .cse29 v_z_110) 0) (< .cse30 (+ .cse29 v_z_110 1)) (< (+ 4294967295 .cse31) .cse32) (< .cse32 .cse31) (< 4294967295 v_z_110) (= .cse32 .cse31) (< (+ 4294967295 .cse33 .cse31) .cse32) (< (mod (+ .cse32 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse30) 1) (< .cse34 (+ .cse33 .cse31)))))) .cse2 .cse3) (or .cse8 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse35 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse35 v_z_119) 0) (< .cse30 (+ .cse35 v_z_119 1)) (< (mod (+ v_z_119 1) .cse30) 1) (< 4294967295 v_z_119)))) .cse36) (or .cse37 .cse38 .cse8 .cse39 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse41 (* v_y_120 4294967296))) (let ((.cse40 (+ v_z_120 .cse41))) (or (< (mod (+ v_z_120 1) .cse30) 1) (= .cse40 0) (< .cse40 0) (< v_z_120 0) (< .cse30 (+ v_z_120 .cse41 1)) (< 4294967295 v_z_120))))))) .cse13 .cse1) (or .cse7 (and (or .cse42 .cse43 .cse4 .cse0 .cse2 .cse3 .cse1) (or .cse4 .cse8 .cse10 .cse44))) (or .cse7 .cse4 .cse8 .cse45 .cse10) .cse46 (or .cse7 (and .cse12 .cse47)) (or .cse4 (and (or .cse43 .cse37 .cse8 .cse48 .cse39 .cse49) (or .cse42 .cse43 .cse0 .cse50 .cse2 .cse1))) (or .cse4 .cse51 (and (or .cse42 .cse0 .cse50 .cse2 .cse3 .cse1) (or .cse37 .cse8 .cse48 .cse39 .cse49))) (or .cse5 .cse4 (let ((.cse52 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse15 c_~buffer_size~0) 11) (<= 10 .cse52) .cse16 (<= .cse26 c_~buffer_size~0) (<= c_~buffer_size~0 .cse25) (<= .cse52 16) (<= .cse21 c_~buffer_size~0)))) (or .cse7 .cse4 .cse8 .cse10 .cse44) (or .cse9 (and .cse11 (or .cse4 .cse13 (and (or .cse37 .cse38 .cse8 .cse39) (or .cse2 .cse3))))) (or .cse7 (and (or .cse42 .cse4 .cse0 .cse13 .cse2 .cse1) (or .cse4 .cse53 .cse8 .cse10))) (or .cse42 .cse37 .cse4 .cse38 .cse0 .cse13 .cse39 .cse54 .cse1) .cse47 (or .cse37 .cse4 .cse38 .cse39 .cse49 .cse51) (or .cse8 (and (or .cse5 .cse4 (and (= .cse15 1) .cse6)) .cse46)) (or .cse42 .cse43 .cse37 .cse4 .cse38 .cse0 .cse3 .cse39 .cse54 .cse1)))))) is different from false [2024-06-20 18:25:22,924 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse27 (mod c_~first~0 4294967296))) (let ((.cse14 (mod c_~receive~0 256)) (.cse16 (mod c_~send~0 256)) (.cse20 (mod c_~next~0 4294967296)) (.cse22 (mod c_~buffer_size~0 4294967296)) (.cse26 (+ .cse27 1))) (let ((.cse19 (not (= (+ c_~value~0 1) 0))) (.cse12 (< .cse22 .cse26)) (.cse24 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse21 (< .cse20 1)) (.cse3 (= .cse16 0)) (.cse18 (= .cse14 0))) (let ((.cse2 (not .cse18)) (.cse5 (not .cse3)) (.cse1 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse10 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse11 (< .cse22 (+ .cse20 1))) (.cse17 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse13 (< c_~buffer_size~0 1)) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse8 (< 2147483647 c_~value~0)) (.cse9 (and (or (and (<= 1 .cse20) (<= .cse26 .cse22)) .cse19) (or .cse12 (and (or (< 2147483647 .cse27) (not (= c_~value~0 (select .cse24 (+ |c_~#buffer~0.offset| .cse27))))) (or (not (= (select .cse24 (+ |c_~#buffer~0.offset| .cse27 (- 4294967296))) c_~value~0)) (< .cse27 2147483648))) .cse21))) (.cse4 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (and (or .cse0 .cse1) (or .cse2 (and (or .cse0 .cse3 .cse4) (or .cse0 .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse1))) (or .cse0 (let ((.cse6 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or .cse6 .cse7 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse8 .cse9) (or .cse10 .cse6 .cse11 .cse12 .cse3 .cse13)))) (or (not (= |c_#ghost~m_locked| 0)) .cse0 (let ((.cse15 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse14 c_~buffer_size~0) 11) (<= 10 .cse15) (= (+ .cse16 .cse14) 1) (<= (+ 9 .cse14) c_~buffer_size~0) (<= c_~buffer_size~0 (+ c_~value~0 10)) (<= .cse15 16) (<= (+ c_~value~0 4) c_~buffer_size~0)))) (or .cse2 .cse0 .cse5 .cse1 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse2 (and (or .cse10 .cse0 .cse11 .cse17 .cse3 .cse13) (or .cse0 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse1))) (or .cse10 .cse7 .cse0 .cse18 .cse11 .cse17 .cse8 (and (or .cse19 (< 0 .cse20)) (or .cse21 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse23 (* v_y_106 4294967296))) (or (< .cse22 v_z_106) (< (+ v_z_106 .cse23) 0) (< .cse22 (+ v_z_106 .cse23 1)) (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse25 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse24 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse25) 0) (< .cse22 (+ v_z_106 .cse25 1)) (= v_z_106 0) (< 2147483648 v_z_106))))))) .cse13) (or .cse7 .cse0 .cse18 .cse8 .cse9 .cse4)))))) is different from false [2024-06-20 18:25:28,162 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-20 18:25:39,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse58 (mod c_~first~0 4294967296)) (.cse9 (mod c_~receive~0 256)) (.cse23 (mod c_~send~0 256))) (let ((.cse30 (= .cse23 0)) (.cse34 (= .cse9 0)) (.cse52 (mod c_~next~0 4294967296)) (.cse25 (mod c_~buffer_size~0 4294967296)) (.cse57 (+ .cse58 1)) (.cse8 (+ c_~value~0 1))) (let ((.cse32 (not (= .cse8 0))) (.cse47 (< .cse25 .cse57)) (.cse55 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse53 (< .cse52 1)) (.cse43 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (not .cse34)) (.cse50 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (not .cse30)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse6 (= |c_#ghost~multithreaded| 0)) (.cse48 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse5 (or .cse6 .cse30 .cse48)) (.cse45 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse10 (= (+ .cse23 .cse9) 1)) (.cse20 (+ 9 .cse9)) (.cse19 (+ c_~value~0 10)) (.cse15 (+ c_~value~0 4)) (.cse42 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse2 (= |c_#ghost~m_locked| 0)) (.cse4 (or .cse0 .cse6 .cse50 .cse1 .cse3)) (.cse7 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse44 (or .cse6 .cse1 .cse43 .cse3)) (.cse46 (and (or (and (<= 1 .cse52) (<= .cse57 .cse25)) .cse32) (or .cse47 (and (or (< 2147483647 .cse58) (not (= c_~value~0 (select .cse55 (+ |c_~#buffer~0.offset| .cse58))))) (or (not (= (select .cse55 (+ |c_~#buffer~0.offset| .cse58 (- 4294967296))) c_~value~0)) (< .cse58 2147483648))) .cse53))) (.cse39 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse25) 1)) (.cse40 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse33 (< (+ c_~value~0 2147483648) 0)) (.cse41 (< .cse25 (+ .cse52 1))) (.cse22 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse35 (< 2147483647 c_~value~0)) (.cse51 (and (or .cse32 (< 0 .cse52)) (or .cse53 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse54 (* v_y_106 4294967296))) (or (< .cse25 v_z_106) (< (+ v_z_106 .cse54) 0) (< .cse25 (+ v_z_106 .cse54 1)) (not (= c_~value~0 (select .cse55 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse56 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse55 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse56) 0) (< .cse25 (+ v_z_106 .cse56 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse38 (< c_~buffer_size~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (or .cse6 .cse7 (< .cse8 .cse9) (not .cse10) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse21 (+ v_z_110 1)) (.cse13 (* v_y_126 4294967296))) (let ((.cse12 (+ c_~value~0 v_z_126 .cse13)) (.cse11 (* v_y_110 4294967296)) (.cse14 (+ v_z_126 .cse13)) (.cse16 (mod .cse21 v_z_126)) (.cse18 (* v_y_120 4294967296)) (.cse17 (* v_y_112 4294967296))) (or (< (+ .cse11 v_z_110) 0) (< 16 .cse12) (< 11 (+ .cse9 v_z_126 .cse13)) (< .cse12 10) (< .cse14 .cse15) (< .cse16 .cse17) (< 4294967295 v_z_110) (= .cse16 .cse17) (< 4294967295 v_z_126) (< v_z_126 (+ .cse11 v_z_110 1)) (< (+ 4294967295 .cse18 .cse17) .cse16) (< .cse19 .cse14) (< .cse14 .cse20) (< (+ 4294967295 .cse17) .cse16) (< (mod (+ .cse16 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse21 (+ .cse18 .cse17)))))) .cse22) .cse1) (< (+ .cse23 6) c_~value~0)) (or .cse6 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse29 (+ v_z_110 1))) (let ((.cse24 (* v_y_110 4294967296)) (.cse27 (mod .cse29 .cse25)) (.cse28 (* v_y_120 4294967296)) (.cse26 (* v_y_112 4294967296))) (or (< (+ .cse24 v_z_110) 0) (< .cse25 (+ .cse24 v_z_110 1)) (< (+ 4294967295 .cse26) .cse27) (< .cse27 .cse26) (< 4294967295 v_z_110) (= .cse27 .cse26) (< (+ 4294967295 .cse28 .cse26) .cse27) (< (mod (+ .cse27 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse25) 1) (< .cse29 (+ .cse28 .cse26)))))) .cse30 .cse22) (or .cse1 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse31 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse31 v_z_119) 0) (< .cse25 (+ .cse31 v_z_119 1)) (< (mod (+ v_z_119 1) .cse25) 1) (< 4294967295 v_z_119)))) .cse32) (or .cse33 .cse34 .cse1 .cse35 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse37 (* v_y_120 4294967296))) (let ((.cse36 (+ v_z_120 .cse37))) (or (< (mod (+ v_z_120 1) .cse25) 1) (= .cse36 0) (< .cse36 0) (< v_z_120 0) (< .cse25 (+ v_z_120 .cse37 1)) (< 4294967295 v_z_120))))))) .cse7 .cse38) (or .cse0 (and (or .cse39 .cse40 .cse6 .cse41 .cse30 .cse22 .cse38) (or .cse6 .cse1 .cse3 .cse42))) (or .cse0 .cse6 .cse1 .cse43 .cse3) (or .cse6 .cse3) (or .cse0 (and .cse5 .cse44)) (or .cse6 (and (or .cse40 .cse33 .cse1 .cse45 .cse35 .cse46) (or .cse39 .cse40 .cse41 .cse47 .cse30 .cse38))) (or .cse6 .cse48 (and (or .cse39 .cse41 .cse47 .cse30 .cse22 .cse38) (or .cse33 .cse1 .cse45 .cse35 .cse46))) (or (not .cse2) .cse6 (let ((.cse49 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse9 c_~buffer_size~0) 11) (<= 10 .cse49) .cse10 (<= .cse20 c_~buffer_size~0) (<= c_~buffer_size~0 .cse19) (<= .cse49 16) (<= .cse15 c_~buffer_size~0)))) (or .cse0 .cse6 .cse1 .cse3 .cse42) (or .cse2 (and .cse4 (or .cse6 .cse7 (and (or .cse33 .cse34 .cse1 .cse35) (or .cse30 .cse22))))) (or .cse0 (and (or .cse39 .cse6 .cse41 .cse7 .cse30 .cse38) (or .cse6 .cse50 .cse1 .cse3))) (or .cse39 .cse33 .cse6 .cse34 .cse41 .cse7 .cse35 .cse51 .cse38) .cse44 (or .cse33 .cse6 .cse34 .cse35 .cse46 .cse48) (or .cse39 .cse40 .cse33 .cse6 .cse34 .cse41 .cse22 .cse35 .cse51 .cse38)))))) is different from false [2024-06-20 18:26:02,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:26:08,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse46 (mod c_~first~0 4294967296)) (.cse38 (mod c_~send~0 256))) (let ((.cse36 (mod c_~receive~0 256)) (.cse2 (= .cse38 0)) (.cse40 (mod c_~next~0 4294967296)) (.cse13 (mod c_~buffer_size~0 4294967296)) (.cse45 (+ .cse46 1))) (let ((.cse19 (not (= (+ c_~value~0 1) 0))) (.cse34 (< .cse13 .cse45)) (.cse43 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse41 (< .cse40 1)) (.cse9 (not .cse2)) (.cse29 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse21 (= .cse36 0)) (.cse4 (= |c_#ghost~multithreaded| 0)) (.cse35 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse11 (or .cse4 .cse2 .cse35)) (.cse32 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse28 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (not .cse21)) (.cse8 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse25 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse31 (or .cse4 .cse9 .cse29 .cse10)) (.cse33 (and (or (and (<= 1 .cse40) (<= .cse45 .cse13)) .cse19) (or .cse34 (and (or (< 2147483647 .cse46) (not (= c_~value~0 (select .cse43 (+ |c_~#buffer~0.offset| .cse46))))) (or (not (= (select .cse43 (+ |c_~#buffer~0.offset| .cse46 (- 4294967296))) c_~value~0)) (< .cse46 2147483648))) .cse41))) (.cse5 (not (= |c_#ghost~m_locked| 0))) (.cse6 (= c_~buffer_size~0 10)) (.cse30 (or .cse4 .cse10)) (.cse26 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse20 (< (+ c_~value~0 2147483648) 0)) (.cse0 (< .cse13 (+ .cse40 1))) (.cse3 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse22 (< 2147483647 c_~value~0)) (.cse39 (and (or .cse19 (< 0 .cse40)) (or .cse41 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse42 (* v_y_106 4294967296))) (or (< .cse13 v_z_106) (< (+ v_z_106 .cse42) 0) (< .cse13 (+ v_z_106 .cse42 1)) (not (= c_~value~0 (select .cse43 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse44 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse43 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse44) 0) (< .cse13 (+ v_z_106 .cse44 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse1 (< c_~buffer_size~0 1))) (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 .cse7 .cse4 .cse8 .cse9 .cse10) .cse11 (or .cse4 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse17 (+ v_z_110 1))) (let ((.cse12 (* v_y_110 4294967296)) (.cse15 (mod .cse17 .cse13)) (.cse16 (* v_y_120 4294967296)) (.cse14 (* v_y_112 4294967296))) (or (< (+ .cse12 v_z_110) 0) (< .cse13 (+ .cse12 v_z_110 1)) (< (+ 4294967295 .cse14) .cse15) (< .cse15 .cse14) (< 4294967295 v_z_110) (= .cse15 .cse14) (< (+ 4294967295 .cse16 .cse14) .cse15) (< (mod (+ .cse15 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse13) 1) (< .cse17 (+ .cse16 .cse14)))))) .cse2 .cse3) (or .cse9 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse18 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse18 v_z_119) 0) (< .cse13 (+ .cse18 v_z_119 1)) (< (mod (+ v_z_119 1) .cse13) 1) (< 4294967295 v_z_119)))) .cse19) (or .cse20 .cse21 .cse9 .cse22 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse24 (* v_y_120 4294967296))) (let ((.cse23 (+ v_z_120 .cse24))) (or (< (mod (+ v_z_120 1) .cse13) 1) (= .cse23 0) (< .cse23 0) (< v_z_120 0) (< .cse13 (+ v_z_120 .cse24 1)) (< 4294967295 v_z_120))))))) .cse25 .cse1) (or .cse7 (and (or .cse26 .cse27 .cse4 .cse0 .cse2 .cse3 .cse1) (or .cse4 .cse9 .cse10 .cse28))) (or .cse7 .cse4 .cse9 .cse29 .cse10) .cse30 (or .cse7 (and .cse11 .cse31)) (or .cse4 (and (or .cse27 .cse20 .cse9 .cse32 .cse22 .cse33) (or .cse26 .cse27 .cse0 .cse34 .cse2 .cse1))) (or .cse4 .cse35 (and (or .cse26 .cse0 .cse34 .cse2 .cse3 .cse1) (or .cse20 .cse9 .cse32 .cse22 .cse33))) (or .cse5 .cse4 (let ((.cse37 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse36 c_~buffer_size~0) 11) (<= 10 .cse37) (= (+ .cse38 .cse36) 1) (<= (+ 9 .cse36) c_~buffer_size~0) (<= c_~buffer_size~0 (+ c_~value~0 10)) (<= .cse37 16) (<= (+ c_~value~0 4) c_~buffer_size~0)))) (or .cse7 .cse4 .cse9 .cse10 .cse28) (or .cse7 (and (or .cse26 .cse4 .cse0 .cse25 .cse2 .cse1) (or .cse4 .cse8 .cse9 .cse10))) (or .cse26 .cse20 .cse4 .cse21 .cse0 .cse25 .cse22 .cse39 .cse1) .cse31 (or .cse20 .cse4 .cse21 .cse22 .cse33 .cse35) (or .cse9 (and (or .cse5 .cse4 (and (= .cse36 1) .cse6)) .cse30)) (or .cse26 .cse27 .cse20 .cse4 .cse21 .cse0 .cse3 .cse22 .cse39 .cse1)))))) is different from false [2024-06-20 18:26:08,897 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (mod c_~next~0 4294967296)) (.cse15 (mod c_~buffer_size~0 4294967296)) (.cse5 (= (mod c_~send~0 256) 0)) (.cse21 (= (mod c_~receive~0 256) 0))) (let ((.cse0 (not .cse21)) (.cse8 (not .cse5)) (.cse9 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse15) 1)) (.cse2 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse4 (< .cse15 (+ .cse13 1))) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse16 (not (= (+ c_~value~0 1) 0))) (.cse19 (< .cse13 1)) (.cse18 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.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 .cse3 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse17 (mod c_~first~0 4294967296))) (let ((.cse14 (+ .cse17 1))) (let ((.cse10 (< .cse15 .cse14))) (and (or .cse1 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse11 .cse8 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse12 (and (or (and (<= 1 .cse13) (<= .cse14 .cse15)) .cse16) (or .cse10 (and (or (< 2147483647 .cse17) (not (= c_~value~0 (select .cse18 (+ |c_~#buffer~0.offset| .cse17))))) (or (not (= (select .cse18 (+ |c_~#buffer~0.offset| .cse17 (- 4294967296))) c_~value~0)) (< .cse17 2147483648))) .cse19)))))))) (or (and (let ((.cse20 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse4 .cse7) (not (= .cse20 0))) .cse3 .cse5 .cse6 (< 0 .cse20))) (or .cse3 .cse8 .cse9)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse1 .cse2 .cse11 .cse3 .cse21 .cse4 .cse6 .cse12 (and (or .cse16 (< 0 .cse13)) (or .cse19 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse22 (* v_y_106 4294967296))) (or (< .cse15 v_z_106) (< (+ v_z_106 .cse22) 0) (< .cse15 (+ v_z_106 .cse22 1)) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse23 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse23) 0) (< .cse15 (+ v_z_106 .cse23 1)) (= v_z_106 0) (< 2147483648 v_z_106))))))) .cse7)))) is different from false [2024-06-20 18:26:12,342 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (mod c_~first~0 4294967296)) (.cse5 (mod c_~receive~0 256)) (.cse6 (mod c_~send~0 256))) (let ((.cse23 (= .cse6 0)) (.cse27 (= .cse5 0)) (.cse47 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296)) (.cse52 (+ .cse53 1)) (.cse4 (+ c_~value~0 1))) (let ((.cse25 (not (= .cse4 0))) (.cse42 (< .cse18 .cse52)) (.cse50 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse48 (< .cse47 1)) (.cse38 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (not .cse27)) (.cse45 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse16 (not .cse23)) (.cse36 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= |c_#ghost~multithreaded| 0)) (.cse43 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse1 (or .cse2 .cse23 .cse43)) (.cse40 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse37 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse44 (= |c_#ghost~m_locked| 0)) (.cse0 (or .cse32 .cse2 .cse45 .cse16 .cse36)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse39 (or .cse2 .cse16 .cse38 .cse36)) (.cse41 (and (or (and (<= 1 .cse47) (<= .cse52 .cse18)) .cse25) (or .cse42 (and (or (< 2147483647 .cse53) (not (= c_~value~0 (select .cse50 (+ |c_~#buffer~0.offset| .cse53))))) (or (not (= (select .cse50 (+ |c_~#buffer~0.offset| .cse53 (- 4294967296))) c_~value~0)) (< .cse53 2147483648))) .cse48))) (.cse33 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse34 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse35 (< .cse18 (+ .cse47 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse28 (< 2147483647 c_~value~0)) (.cse46 (and (or .cse25 (< 0 .cse47)) (or .cse48 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse49 (* v_y_106 4294967296))) (or (< .cse18 v_z_106) (< (+ v_z_106 .cse49) 0) (< .cse18 (+ v_z_106 .cse49 1)) (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse51 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse51) 0) (< .cse18 (+ v_z_106 .cse51 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse31 (< c_~buffer_size~0 1))) (and .cse0 .cse1 (or .cse2 .cse3 (< .cse4 .cse5) (not (= (+ .cse6 .cse5) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse14 (+ v_z_110 1)) (.cse9 (* v_y_126 4294967296))) (let ((.cse8 (+ c_~value~0 v_z_126 .cse9)) (.cse7 (* v_y_110 4294967296)) (.cse10 (+ v_z_126 .cse9)) (.cse11 (mod .cse14 v_z_126)) (.cse13 (* v_y_120 4294967296)) (.cse12 (* v_y_112 4294967296))) (or (< (+ .cse7 v_z_110) 0) (< 16 .cse8) (< 11 (+ .cse5 v_z_126 .cse9)) (< .cse8 10) (< .cse10 (+ c_~value~0 4)) (< .cse11 .cse12) (< 4294967295 v_z_110) (= .cse11 .cse12) (< 4294967295 v_z_126) (< v_z_126 (+ .cse7 v_z_110 1)) (< (+ 4294967295 .cse13 .cse12) .cse11) (< (+ c_~value~0 10) .cse10) (< .cse10 (+ 9 .cse5)) (< (+ 4294967295 .cse12) .cse11) (< (mod (+ .cse11 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse14 (+ .cse13 .cse12)))))) .cse15) .cse16) (< (+ .cse6 6) c_~value~0)) (or .cse2 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse22 (+ v_z_110 1))) (let ((.cse17 (* v_y_110 4294967296)) (.cse20 (mod .cse22 .cse18)) (.cse21 (* v_y_120 4294967296)) (.cse19 (* v_y_112 4294967296))) (or (< (+ .cse17 v_z_110) 0) (< .cse18 (+ .cse17 v_z_110 1)) (< (+ 4294967295 .cse19) .cse20) (< .cse20 .cse19) (< 4294967295 v_z_110) (= .cse20 .cse19) (< (+ 4294967295 .cse21 .cse19) .cse20) (< (mod (+ .cse20 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse18) 1) (< .cse22 (+ .cse21 .cse19)))))) .cse23 .cse15) (or .cse16 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse24 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse24 v_z_119) 0) (< .cse18 (+ .cse24 v_z_119 1)) (< (mod (+ v_z_119 1) .cse18) 1) (< 4294967295 v_z_119)))) .cse25) (or .cse26 .cse27 .cse16 .cse28 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse30 (* v_y_120 4294967296))) (let ((.cse29 (+ v_z_120 .cse30))) (or (< (mod (+ v_z_120 1) .cse18) 1) (= .cse29 0) (< .cse29 0) (< v_z_120 0) (< .cse18 (+ v_z_120 .cse30 1)) (< 4294967295 v_z_120))))))) .cse3 .cse31) (or .cse32 (and (or .cse33 .cse34 .cse2 .cse35 .cse23 .cse15 .cse31) (or .cse2 .cse16 .cse36 .cse37))) (or .cse32 .cse2 .cse16 .cse38 .cse36) (or .cse32 (and .cse1 .cse39)) (or .cse2 (and (or .cse34 .cse26 .cse16 .cse40 .cse28 .cse41) (or .cse33 .cse34 .cse35 .cse42 .cse23 .cse31))) (or .cse2 .cse43 (and (or .cse33 .cse35 .cse42 .cse23 .cse15 .cse31) (or .cse26 .cse16 .cse40 .cse28 .cse41))) (or .cse32 .cse2 .cse16 .cse44 .cse36) (or .cse32 .cse2 .cse16 .cse36 .cse37) (or .cse44 (and .cse0 (or .cse2 .cse3 (and (or .cse26 .cse27 .cse16 .cse28) (or .cse23 .cse15))))) (or .cse32 (and (or .cse33 .cse2 .cse35 .cse3 .cse23 .cse31) (or .cse2 .cse45 .cse16 .cse36))) (or .cse33 .cse26 .cse2 .cse27 .cse35 .cse3 .cse28 .cse46 .cse31) .cse39 (or .cse26 .cse2 .cse27 .cse28 .cse41 .cse43) (or .cse33 .cse34 .cse26 .cse2 .cse27 .cse35 .cse15 .cse28 .cse46 .cse31)))))) is different from false [2024-06-20 18:26:27,022 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (= (mod c_~send~0 256) 0)) (.cse13 (mod c_~next~0 4294967296)) (.cse15 (mod c_~buffer_size~0 4294967296)) (.cse20 (= (mod c_~receive~0 256) 0))) (let ((.cse0 (not .cse20)) (.cse1 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse15) 1)) (.cse2 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse11 (< (+ c_~value~0 2147483648) 0)) (.cse4 (< .cse15 (+ .cse13 1))) (.cse6 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse16 (not (= (+ c_~value~0 1) 0))) (.cse19 (< .cse13 1)) (.cse18 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse7 (< c_~buffer_size~0 1)) (.cse3 (= |c_#ghost~multithreaded| 0)) (.cse8 (not .cse5)) (.cse9 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (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 .cse3 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse17 (mod c_~first~0 4294967296))) (let ((.cse14 (+ .cse17 1))) (let ((.cse10 (< .cse15 .cse14))) (and (or .cse1 .cse4 .cse10 .cse5 .cse6 .cse7) (or .cse11 .cse8 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse12 (and (or (and (<= 1 .cse13) (<= .cse14 .cse15)) .cse16) (or .cse10 (and (or (< 2147483647 .cse17) (not (= c_~value~0 (select .cse18 (+ |c_~#buffer~0.offset| .cse17))))) (or (not (= (select .cse18 (+ |c_~#buffer~0.offset| .cse17 (- 4294967296))) c_~value~0)) (< .cse17 2147483648))) .cse19)))))))) (or (and (or .cse4 .cse7) (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse3 .cse5 .cse6 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse1 .cse2 .cse11 .cse3 .cse20 .cse4 .cse6 .cse12 (and (or .cse16 (< 0 .cse13)) (or .cse19 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse21 (* v_y_106 4294967296))) (or (< .cse15 v_z_106) (< (+ v_z_106 .cse21) 0) (< .cse15 (+ v_z_106 .cse21 1)) (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse22 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse18 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse22) 0) (< .cse15 (+ v_z_106 .cse22 1)) (= v_z_106 0) (< 2147483648 v_z_106))))))) .cse7) (or .cse3 .cse8 .cse9)))) is different from false [2024-06-20 18:26:27,422 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (mod c_~first~0 4294967296)) (.cse9 (mod c_~receive~0 256)) (.cse10 (mod c_~send~0 256))) (let ((.cse26 (= .cse10 0)) (.cse30 (= .cse9 0)) (.cse47 (mod c_~next~0 4294967296)) (.cse21 (mod c_~buffer_size~0 4294967296)) (.cse52 (+ .cse53 1)) (.cse8 (+ c_~value~0 1))) (let ((.cse28 (not (= .cse8 0))) (.cse43 (< .cse21 .cse52)) (.cse50 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse48 (< .cse47 1)) (.cse39 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (not .cse30)) (.cse45 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (not .cse26)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse6 (= |c_#ghost~multithreaded| 0)) (.cse44 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse5 (or .cse6 .cse26 .cse44)) (.cse41 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse38 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse2 (= |c_#ghost~m_locked| 0)) (.cse4 (or .cse0 .cse6 .cse45 .cse1 .cse3)) (.cse7 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse40 (or .cse6 .cse1 .cse39 .cse3)) (.cse42 (and (or (and (<= 1 .cse47) (<= .cse52 .cse21)) .cse28) (or .cse43 (and (or (< 2147483647 .cse53) (not (= c_~value~0 (select .cse50 (+ |c_~#buffer~0.offset| .cse53))))) (or (not (= (select .cse50 (+ |c_~#buffer~0.offset| .cse53 (- 4294967296))) c_~value~0)) (< .cse53 2147483648))) .cse48))) (.cse35 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse36 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse29 (< (+ c_~value~0 2147483648) 0)) (.cse37 (< .cse21 (+ .cse47 1))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse31 (< 2147483647 c_~value~0)) (.cse46 (and (or .cse28 (< 0 .cse47)) (or .cse48 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse49 (* v_y_106 4294967296))) (or (< .cse21 v_z_106) (< (+ v_z_106 .cse49) 0) (< .cse21 (+ v_z_106 .cse49 1)) (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse51 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse51) 0) (< .cse21 (+ v_z_106 .cse51 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse34 (< c_~buffer_size~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (or .cse6 .cse7 (< .cse8 .cse9) (not (= (+ .cse10 .cse9) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse18 (+ v_z_110 1)) (.cse13 (* v_y_126 4294967296))) (let ((.cse12 (+ c_~value~0 v_z_126 .cse13)) (.cse11 (* v_y_110 4294967296)) (.cse14 (+ v_z_126 .cse13)) (.cse15 (mod .cse18 v_z_126)) (.cse17 (* v_y_120 4294967296)) (.cse16 (* v_y_112 4294967296))) (or (< (+ .cse11 v_z_110) 0) (< 16 .cse12) (< 11 (+ .cse9 v_z_126 .cse13)) (< .cse12 10) (< .cse14 (+ c_~value~0 4)) (< .cse15 .cse16) (< 4294967295 v_z_110) (= .cse15 .cse16) (< 4294967295 v_z_126) (< v_z_126 (+ .cse11 v_z_110 1)) (< (+ 4294967295 .cse17 .cse16) .cse15) (< (+ c_~value~0 10) .cse14) (< .cse14 (+ 9 .cse9)) (< (+ 4294967295 .cse16) .cse15) (< (mod (+ .cse15 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse18 (+ .cse17 .cse16)))))) .cse19) .cse1) (< (+ .cse10 6) c_~value~0)) (or .cse6 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse25 (+ v_z_110 1))) (let ((.cse20 (* v_y_110 4294967296)) (.cse23 (mod .cse25 .cse21)) (.cse24 (* v_y_120 4294967296)) (.cse22 (* v_y_112 4294967296))) (or (< (+ .cse20 v_z_110) 0) (< .cse21 (+ .cse20 v_z_110 1)) (< (+ 4294967295 .cse22) .cse23) (< .cse23 .cse22) (< 4294967295 v_z_110) (= .cse23 .cse22) (< (+ 4294967295 .cse24 .cse22) .cse23) (< (mod (+ .cse23 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse21) 1) (< .cse25 (+ .cse24 .cse22)))))) .cse26 .cse19) (or .cse1 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse27 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse27 v_z_119) 0) (< .cse21 (+ .cse27 v_z_119 1)) (< (mod (+ v_z_119 1) .cse21) 1) (< 4294967295 v_z_119)))) .cse28) (or .cse29 .cse30 .cse1 .cse31 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse33 (* v_y_120 4294967296))) (let ((.cse32 (+ v_z_120 .cse33))) (or (< (mod (+ v_z_120 1) .cse21) 1) (= .cse32 0) (< .cse32 0) (< v_z_120 0) (< .cse21 (+ v_z_120 .cse33 1)) (< 4294967295 v_z_120))))))) .cse7 .cse34) (or .cse0 (and (or .cse35 .cse36 .cse6 .cse37 .cse26 .cse19 .cse34) (or .cse6 .cse1 .cse3 .cse38))) (or .cse0 .cse6 .cse1 .cse39 .cse3) (or .cse0 (and .cse5 .cse40)) (or .cse6 (and (or .cse36 .cse29 .cse1 .cse41 .cse31 .cse42) (or .cse35 .cse36 .cse37 .cse43 .cse26 .cse34))) (or .cse6 .cse44 (and (or .cse35 .cse37 .cse43 .cse26 .cse19 .cse34) (or .cse29 .cse1 .cse41 .cse31 .cse42))) (or .cse0 .cse6 .cse1 .cse3 .cse38) (or .cse2 (and .cse4 (or .cse6 .cse7 (and (or .cse29 .cse30 .cse1 .cse31) (or .cse26 .cse19))))) (or .cse0 (and (or .cse35 .cse6 .cse37 .cse7 .cse26 .cse34) (or .cse6 .cse45 .cse1 .cse3))) (or .cse35 .cse29 .cse6 .cse30 .cse37 .cse7 .cse31 .cse46 .cse34) .cse40 (or .cse29 .cse6 .cse30 .cse31 .cse42 .cse44) (or .cse35 .cse36 .cse29 .cse6 .cse30 .cse37 .cse19 .cse31 .cse46 .cse34)))))) is different from false [2024-06-20 18:26:47,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:27:02,802 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse52 (mod c_~first~0 4294967296)) (.cse5 (mod c_~receive~0 256)) (.cse6 (mod c_~send~0 256))) (let ((.cse23 (= .cse6 0)) (.cse27 (= .cse5 0)) (.cse46 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296)) (.cse51 (+ .cse52 1)) (.cse4 (+ c_~value~0 1))) (let ((.cse25 (not (= .cse4 0))) (.cse42 (< .cse18 .cse51)) (.cse49 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse47 (< .cse46 1)) (.cse38 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (not .cse27)) (.cse44 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse16 (not .cse23)) (.cse36 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= |c_#ghost~multithreaded| 0)) (.cse43 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse1 (or .cse2 .cse23 .cse43)) (.cse40 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse37 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (or .cse32 .cse2 .cse44 .cse16 .cse36)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse39 (or .cse2 .cse16 .cse38 .cse36)) (.cse41 (and (or (and (<= 1 .cse46) (<= .cse51 .cse18)) .cse25) (or .cse42 (and (or (< 2147483647 .cse52) (not (= c_~value~0 (select .cse49 (+ |c_~#buffer~0.offset| .cse52))))) (or (not (= (select .cse49 (+ |c_~#buffer~0.offset| .cse52 (- 4294967296))) c_~value~0)) (< .cse52 2147483648))) .cse47))) (.cse33 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse34 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse35 (< .cse18 (+ .cse46 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse28 (< 2147483647 c_~value~0)) (.cse45 (and (or .cse25 (< 0 .cse46)) (or .cse47 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse48 (* v_y_106 4294967296))) (or (< .cse18 v_z_106) (< (+ v_z_106 .cse48) 0) (< .cse18 (+ v_z_106 .cse48 1)) (not (= c_~value~0 (select .cse49 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse50 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse49 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse50) 0) (< .cse18 (+ v_z_106 .cse50 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse31 (< c_~buffer_size~0 1))) (and .cse0 .cse1 (or .cse2 .cse3 (< .cse4 .cse5) (not (= (+ .cse6 .cse5) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse14 (+ v_z_110 1)) (.cse9 (* v_y_126 4294967296))) (let ((.cse8 (+ c_~value~0 v_z_126 .cse9)) (.cse7 (* v_y_110 4294967296)) (.cse10 (+ v_z_126 .cse9)) (.cse11 (mod .cse14 v_z_126)) (.cse13 (* v_y_120 4294967296)) (.cse12 (* v_y_112 4294967296))) (or (< (+ .cse7 v_z_110) 0) (< 16 .cse8) (< 11 (+ .cse5 v_z_126 .cse9)) (< .cse8 10) (< .cse10 (+ c_~value~0 4)) (< .cse11 .cse12) (< 4294967295 v_z_110) (= .cse11 .cse12) (< 4294967295 v_z_126) (< v_z_126 (+ .cse7 v_z_110 1)) (< (+ 4294967295 .cse13 .cse12) .cse11) (< (+ c_~value~0 10) .cse10) (< .cse10 (+ 9 .cse5)) (< (+ 4294967295 .cse12) .cse11) (< (mod (+ .cse11 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse14 (+ .cse13 .cse12)))))) .cse15) .cse16) (< (+ .cse6 6) c_~value~0)) (or .cse2 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse22 (+ v_z_110 1))) (let ((.cse17 (* v_y_110 4294967296)) (.cse20 (mod .cse22 .cse18)) (.cse21 (* v_y_120 4294967296)) (.cse19 (* v_y_112 4294967296))) (or (< (+ .cse17 v_z_110) 0) (< .cse18 (+ .cse17 v_z_110 1)) (< (+ 4294967295 .cse19) .cse20) (< .cse20 .cse19) (< 4294967295 v_z_110) (= .cse20 .cse19) (< (+ 4294967295 .cse21 .cse19) .cse20) (< (mod (+ .cse20 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse18) 1) (< .cse22 (+ .cse21 .cse19)))))) .cse23 .cse15) (or .cse16 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse24 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse24 v_z_119) 0) (< .cse18 (+ .cse24 v_z_119 1)) (< (mod (+ v_z_119 1) .cse18) 1) (< 4294967295 v_z_119)))) .cse25) (or .cse26 .cse27 .cse16 .cse28 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse30 (* v_y_120 4294967296))) (let ((.cse29 (+ v_z_120 .cse30))) (or (< (mod (+ v_z_120 1) .cse18) 1) (= .cse29 0) (< .cse29 0) (< v_z_120 0) (< .cse18 (+ v_z_120 .cse30 1)) (< 4294967295 v_z_120))))))) .cse3 .cse31) (or .cse32 (and (or .cse33 .cse34 .cse2 .cse35 .cse23 .cse15 .cse31) (or .cse2 .cse16 .cse36 .cse37))) (or .cse32 .cse2 .cse16 .cse38 .cse36) (or .cse32 (and .cse1 .cse39)) (or .cse2 (and (or .cse34 .cse26 .cse16 .cse40 .cse28 .cse41) (or .cse33 .cse34 .cse35 .cse42 .cse23 .cse31))) (or .cse2 .cse43 (and (or .cse33 .cse35 .cse42 .cse23 .cse15 .cse31) (or .cse26 .cse16 .cse40 .cse28 .cse41))) (or .cse32 .cse2 .cse16 .cse36 .cse37) (or (= |c_#ghost~m_locked| 0) (and .cse0 (or .cse2 .cse3 (and (or .cse26 .cse27 .cse16 .cse28) (or .cse23 .cse15))))) (or .cse32 (and (or .cse33 .cse2 .cse35 .cse3 .cse23 .cse31) (or .cse2 .cse44 .cse16 .cse36))) (or .cse33 .cse26 .cse2 .cse27 .cse35 .cse3 .cse28 .cse45 .cse31) .cse39 (or .cse26 .cse2 .cse27 .cse28 .cse41 .cse43) (or .cse33 .cse34 .cse26 .cse2 .cse27 .cse35 .cse15 .cse28 .cse45 .cse31)))))) is different from false [2024-06-20 18:27:10,986 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-20 18:27:15,685 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-20 18:27:17,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 18:27:33,348 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse59 (mod c_~first~0 4294967296)) (.cse5 (mod c_~receive~0 256)) (.cse20 (mod c_~send~0 256))) (let ((.cse27 (= .cse20 0)) (.cse31 (= .cse5 0)) (.cse53 (mod c_~next~0 4294967296)) (.cse22 (mod c_~buffer_size~0 4294967296)) (.cse58 (+ .cse59 1)) (.cse4 (+ c_~value~0 1))) (let ((.cse29 (not (= .cse4 0))) (.cse46 (< .cse22 .cse58)) (.cse56 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse54 (< .cse53 1)) (.cse42 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse36 (not .cse31)) (.cse51 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse19 (not .cse27)) (.cse40 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= |c_#ghost~multithreaded| 0)) (.cse47 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse1 (or .cse2 .cse27 .cse47)) (.cse44 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse6 (= (+ .cse20 .cse5) 1)) (.cse16 (+ 9 .cse5)) (.cse15 (+ c_~value~0 10)) (.cse11 (+ c_~value~0 4)) (.cse41 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse49 (= |c_#ghost~m_locked| 0)) (.cse0 (or .cse36 .cse2 .cse51 .cse19 .cse40)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse43 (or .cse2 .cse19 .cse42 .cse40)) (.cse45 (and (or (and (<= 1 .cse53) (<= .cse58 .cse22)) .cse29) (or .cse46 (and (or (< 2147483647 .cse59) (not (= c_~value~0 (select .cse56 (+ |c_~#buffer~0.offset| .cse59))))) (or (not (= (select .cse56 (+ |c_~#buffer~0.offset| .cse59 (- 4294967296))) c_~value~0)) (< .cse59 2147483648))) .cse54))) (.cse37 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse38 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse30 (< (+ c_~value~0 2147483648) 0)) (.cse39 (< .cse22 (+ .cse53 1))) (.cse18 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse32 (< 2147483647 c_~value~0)) (.cse52 (and (or .cse29 (< 0 .cse53)) (or .cse54 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse55 (* v_y_106 4294967296))) (or (< .cse22 v_z_106) (< (+ v_z_106 .cse55) 0) (< .cse22 (+ v_z_106 .cse55 1)) (not (= c_~value~0 (select .cse56 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse57 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse56 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse57) 0) (< .cse22 (+ v_z_106 .cse57 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse35 (< c_~buffer_size~0 1))) (and .cse0 .cse1 (or .cse2 .cse3 (< .cse4 .cse5) (not .cse6) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse17 (+ v_z_110 1)) (.cse9 (* v_y_126 4294967296))) (let ((.cse8 (+ c_~value~0 v_z_126 .cse9)) (.cse7 (* v_y_110 4294967296)) (.cse10 (+ v_z_126 .cse9)) (.cse12 (mod .cse17 v_z_126)) (.cse14 (* v_y_120 4294967296)) (.cse13 (* v_y_112 4294967296))) (or (< (+ .cse7 v_z_110) 0) (< 16 .cse8) (< 11 (+ .cse5 v_z_126 .cse9)) (< .cse8 10) (< .cse10 .cse11) (< .cse12 .cse13) (< 4294967295 v_z_110) (= .cse12 .cse13) (< 4294967295 v_z_126) (< v_z_126 (+ .cse7 v_z_110 1)) (< (+ 4294967295 .cse14 .cse13) .cse12) (< .cse15 .cse10) (< .cse10 .cse16) (< (+ 4294967295 .cse13) .cse12) (< (mod (+ .cse12 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse17 (+ .cse14 .cse13)))))) .cse18) .cse19) (< (+ .cse20 6) c_~value~0)) (or .cse2 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse26 (+ v_z_110 1))) (let ((.cse21 (* v_y_110 4294967296)) (.cse24 (mod .cse26 .cse22)) (.cse25 (* v_y_120 4294967296)) (.cse23 (* v_y_112 4294967296))) (or (< (+ .cse21 v_z_110) 0) (< .cse22 (+ .cse21 v_z_110 1)) (< (+ 4294967295 .cse23) .cse24) (< .cse24 .cse23) (< 4294967295 v_z_110) (= .cse24 .cse23) (< (+ 4294967295 .cse25 .cse23) .cse24) (< (mod (+ .cse24 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse22) 1) (< .cse26 (+ .cse25 .cse23)))))) .cse27 .cse18) (or .cse19 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse28 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse28 v_z_119) 0) (< .cse22 (+ .cse28 v_z_119 1)) (< (mod (+ v_z_119 1) .cse22) 1) (< 4294967295 v_z_119)))) .cse29) (or .cse30 .cse31 .cse19 .cse32 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse34 (* v_y_120 4294967296))) (let ((.cse33 (+ v_z_120 .cse34))) (or (< (mod (+ v_z_120 1) .cse22) 1) (= .cse33 0) (< .cse33 0) (< v_z_120 0) (< .cse22 (+ v_z_120 .cse34 1)) (< 4294967295 v_z_120))))))) .cse3 .cse35) (or .cse36 (and (or .cse37 .cse38 .cse2 .cse39 .cse27 .cse18 .cse35) (or .cse2 .cse19 .cse40 .cse41))) (or .cse36 .cse2 .cse19 .cse42 .cse40) (or .cse2 .cse40) (or .cse36 (and .cse1 .cse43)) (or .cse2 (and (or .cse38 .cse30 .cse19 .cse44 .cse32 .cse45) (or .cse37 .cse38 .cse39 .cse46 .cse27 .cse35))) (or .cse2 .cse47 (and (or .cse37 .cse39 .cse46 .cse27 .cse18 .cse35) (or .cse30 .cse19 .cse44 .cse32 .cse45))) (or (and (let ((.cse48 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse39 .cse35) (not (= .cse48 0))) .cse2 .cse27 .cse18 (< 0 .cse48))) (or .cse2 .cse19 .cse40)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or (not .cse49) .cse2 (let ((.cse50 (+ c_~value~0 c_~buffer_size~0))) (and (<= (+ .cse5 c_~buffer_size~0) 11) (<= 10 .cse50) .cse6 (<= .cse16 c_~buffer_size~0) (<= c_~buffer_size~0 .cse15) (<= .cse50 16) (<= .cse11 c_~buffer_size~0)))) (or .cse36 .cse2 .cse19 .cse40 .cse41) (or .cse49 (and .cse0 (or .cse2 .cse3 (and (or .cse30 .cse31 .cse19 .cse32) (or .cse27 .cse18))))) (or .cse36 (and (or .cse37 .cse2 .cse39 .cse3 .cse27 .cse35) (or .cse2 .cse51 .cse19 .cse40))) (or .cse37 .cse30 .cse2 .cse31 .cse39 .cse3 .cse32 .cse52 .cse35) .cse43 (or .cse30 .cse2 .cse31 .cse32 .cse45 .cse47) (or .cse37 .cse38 .cse30 .cse2 .cse31 .cse39 .cse18 .cse32 .cse52 .cse35)))))) is different from false [2024-06-20 18:27:33,734 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (= (mod c_~send~0 256) 0)) (.cse14 (= (mod c_~receive~0 256) 0))) (let ((.cse13 (< (+ c_~value~0 2147483648) 0)) (.cse15 (< 2147483647 c_~value~0)) (.cse12 (not (= (+ c_~value~0 1) 0))) (.cse18 (< c_~buffer_size~0 1)) (.cse5 (mod c_~buffer_size~0 4294967296)) (.cse0 (not .cse14)) (.cse1 (= |c_#ghost~multithreaded| 0)) (.cse2 (not .cse10)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 .cse1 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3) (or .cse1 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse9 (+ v_z_110 1))) (let ((.cse4 (* v_y_110 4294967296)) (.cse7 (mod .cse9 .cse5)) (.cse8 (* v_y_120 4294967296)) (.cse6 (* v_y_112 4294967296))) (or (< (+ .cse4 v_z_110) 0) (< .cse5 (+ .cse4 v_z_110 1)) (< (+ 4294967295 .cse6) .cse7) (< .cse7 .cse6) (< 4294967295 v_z_110) (= .cse7 .cse6) (< (+ 4294967295 .cse8 .cse6) .cse7) (< (mod (+ .cse7 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse5) 1) (< .cse9 (+ .cse8 .cse6)))))) .cse10 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (or .cse2 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse11 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse11 v_z_119) 0) (< .cse5 (+ .cse11 v_z_119 1)) (< (mod (+ v_z_119 1) .cse5) 1) (< 4294967295 v_z_119)))) .cse12) (or .cse13 .cse14 .cse2 .cse15 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse17 (* v_y_120 4294967296))) (let ((.cse16 (+ v_z_120 .cse17))) (or (< (mod (+ v_z_120 1) .cse5) 1) (= .cse16 0) (< .cse16 0) (< v_z_120 0) (< .cse5 (+ v_z_120 .cse17 1)) (< 4294967295 v_z_120))))))) (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)) .cse18) (or .cse1 (let ((.cse23 (mod c_~first~0 4294967296))) (let ((.cse21 (+ .cse23 1))) (let ((.cse19 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse20 (mod c_~next~0 4294967296)) (.cse22 (< .cse5 .cse21))) (and (or .cse19 .cse13 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse15 (and (or (and (<= 1 .cse20) (<= .cse21 .cse5)) .cse12) (or .cse22 (let ((.cse24 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (or (< 2147483647 .cse23) (not (= c_~value~0 (select .cse24 (+ |c_~#buffer~0.offset| .cse23))))) (or (not (= (select .cse24 (+ |c_~#buffer~0.offset| .cse23 (- 4294967296))) c_~value~0)) (< .cse23 2147483648)))) (< .cse20 1)))) (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse5) 1) .cse19 (< .cse5 (+ .cse20 1)) .cse22 .cse10 .cse18)))))) (or .cse0 .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))))) is different from false [2024-06-20 18:28:00,453 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse54 (mod c_~first~0 4294967296)) (.cse9 (mod c_~receive~0 256)) (.cse10 (mod c_~send~0 256))) (let ((.cse26 (= .cse10 0)) (.cse30 (= .cse9 0)) (.cse48 (mod c_~next~0 4294967296)) (.cse21 (mod c_~buffer_size~0 4294967296)) (.cse53 (+ .cse54 1)) (.cse8 (+ c_~value~0 1))) (let ((.cse28 (not (= .cse8 0))) (.cse43 (< .cse21 .cse53)) (.cse51 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse49 (< .cse48 1)) (.cse39 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (not .cse30)) (.cse46 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (not .cse26)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse6 (= |c_#ghost~multithreaded| 0)) (.cse44 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse5 (or .cse6 .cse26 .cse44)) (.cse41 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse38 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse2 (= |c_#ghost~m_locked| 0)) (.cse4 (or .cse0 .cse6 .cse46 .cse1 .cse3)) (.cse7 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse40 (or .cse6 .cse1 .cse39 .cse3)) (.cse42 (and (or (and (<= 1 .cse48) (<= .cse53 .cse21)) .cse28) (or .cse43 (and (or (< 2147483647 .cse54) (not (= c_~value~0 (select .cse51 (+ |c_~#buffer~0.offset| .cse54))))) (or (not (= (select .cse51 (+ |c_~#buffer~0.offset| .cse54 (- 4294967296))) c_~value~0)) (< .cse54 2147483648))) .cse49))) (.cse35 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse36 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse29 (< (+ c_~value~0 2147483648) 0)) (.cse37 (< .cse21 (+ .cse48 1))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse31 (< 2147483647 c_~value~0)) (.cse47 (and (or .cse28 (< 0 .cse48)) (or .cse49 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse50 (* v_y_106 4294967296))) (or (< .cse21 v_z_106) (< (+ v_z_106 .cse50) 0) (< .cse21 (+ v_z_106 .cse50 1)) (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse52 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse52) 0) (< .cse21 (+ v_z_106 .cse52 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse34 (< c_~buffer_size~0 1))) (and (or .cse0 .cse1 .cse2 .cse3) .cse4 .cse5 (or .cse6 .cse7 (< .cse8 .cse9) (not (= (+ .cse10 .cse9) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse18 (+ v_z_110 1)) (.cse13 (* v_y_126 4294967296))) (let ((.cse12 (+ c_~value~0 v_z_126 .cse13)) (.cse11 (* v_y_110 4294967296)) (.cse14 (+ v_z_126 .cse13)) (.cse15 (mod .cse18 v_z_126)) (.cse17 (* v_y_120 4294967296)) (.cse16 (* v_y_112 4294967296))) (or (< (+ .cse11 v_z_110) 0) (< 16 .cse12) (< 11 (+ .cse9 v_z_126 .cse13)) (< .cse12 10) (< .cse14 (+ c_~value~0 4)) (< .cse15 .cse16) (< 4294967295 v_z_110) (= .cse15 .cse16) (< 4294967295 v_z_126) (< v_z_126 (+ .cse11 v_z_110 1)) (< (+ 4294967295 .cse17 .cse16) .cse15) (< (+ c_~value~0 10) .cse14) (< .cse14 (+ 9 .cse9)) (< (+ 4294967295 .cse16) .cse15) (< (mod (+ .cse15 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse18 (+ .cse17 .cse16)))))) .cse19) .cse1) (< (+ .cse10 6) c_~value~0)) (or .cse6 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse25 (+ v_z_110 1))) (let ((.cse20 (* v_y_110 4294967296)) (.cse23 (mod .cse25 .cse21)) (.cse24 (* v_y_120 4294967296)) (.cse22 (* v_y_112 4294967296))) (or (< (+ .cse20 v_z_110) 0) (< .cse21 (+ .cse20 v_z_110 1)) (< (+ 4294967295 .cse22) .cse23) (< .cse23 .cse22) (< 4294967295 v_z_110) (= .cse23 .cse22) (< (+ 4294967295 .cse24 .cse22) .cse23) (< (mod (+ .cse23 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse21) 1) (< .cse25 (+ .cse24 .cse22)))))) .cse26 .cse19) (or .cse1 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse27 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse27 v_z_119) 0) (< .cse21 (+ .cse27 v_z_119 1)) (< (mod (+ v_z_119 1) .cse21) 1) (< 4294967295 v_z_119)))) .cse28) (or .cse29 .cse30 .cse1 .cse31 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse33 (* v_y_120 4294967296))) (let ((.cse32 (+ v_z_120 .cse33))) (or (< (mod (+ v_z_120 1) .cse21) 1) (= .cse32 0) (< .cse32 0) (< v_z_120 0) (< .cse21 (+ v_z_120 .cse33 1)) (< 4294967295 v_z_120))))))) .cse7 .cse34) (or .cse0 (and (or .cse35 .cse36 .cse6 .cse37 .cse26 .cse19 .cse34) (or .cse6 .cse1 .cse3 .cse38))) (or .cse0 .cse6 .cse1 .cse39 .cse3) (or .cse0 (and .cse5 .cse40)) (or .cse6 (and (or .cse36 .cse29 .cse1 .cse41 .cse31 .cse42) (or .cse35 .cse36 .cse37 .cse43 .cse26 .cse34))) (or .cse6 .cse44 (and (or .cse35 .cse37 .cse43 .cse26 .cse19 .cse34) (or .cse29 .cse1 .cse41 .cse31 .cse42))) (or (and (let ((.cse45 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse37 .cse34) (not (= .cse45 0))) .cse6 .cse26 .cse19 (< 0 .cse45))) (or .cse6 .cse1 .cse3)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 .cse6 .cse1 .cse3 .cse38) (or .cse2 (and .cse4 (or .cse6 .cse7 (and (or .cse29 .cse30 .cse1 .cse31) (or .cse26 .cse19))))) (or .cse0 (and (or .cse35 .cse6 .cse37 .cse7 .cse26 .cse34) (or .cse6 .cse46 .cse1 .cse3))) (or .cse35 .cse29 .cse6 .cse30 .cse37 .cse7 .cse31 .cse47 .cse34) .cse40 (or .cse29 .cse6 .cse30 .cse31 .cse42 .cse44) (or .cse35 .cse36 .cse29 .cse6 .cse30 .cse37 .cse19 .cse31 .cse47 .cse34)))))) is different from false [2024-06-20 18:28:05,092 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-20 18:28:25,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:28:29,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:28:42,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:29:15,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:29:21,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:29:25,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-06-20 18:29:25,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse53 (mod c_~first~0 4294967296)) (.cse5 (mod c_~receive~0 256)) (.cse6 (mod c_~send~0 256))) (let ((.cse23 (= .cse6 0)) (.cse27 (= .cse5 0)) (.cse47 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296)) (.cse52 (+ .cse53 1)) (.cse4 (+ c_~value~0 1))) (let ((.cse25 (not (= .cse4 0))) (.cse42 (< .cse18 .cse52)) (.cse50 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse48 (< .cse47 1)) (.cse38 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (not .cse27)) (.cse45 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse16 (not .cse23)) (.cse36 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= |c_#ghost~multithreaded| 0)) (.cse43 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse1 (or .cse2 .cse23 .cse43)) (.cse40 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse37 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse0 (or .cse32 .cse2 .cse45 .cse16 .cse36)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse39 (or .cse2 .cse16 .cse38 .cse36)) (.cse41 (and (or (and (<= 1 .cse47) (<= .cse52 .cse18)) .cse25) (or .cse42 (and (or (< 2147483647 .cse53) (not (= c_~value~0 (select .cse50 (+ |c_~#buffer~0.offset| .cse53))))) (or (not (= (select .cse50 (+ |c_~#buffer~0.offset| .cse53 (- 4294967296))) c_~value~0)) (< .cse53 2147483648))) .cse48))) (.cse33 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse34 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse35 (< .cse18 (+ .cse47 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse28 (< 2147483647 c_~value~0)) (.cse46 (and (or .cse25 (< 0 .cse47)) (or .cse48 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse49 (* v_y_106 4294967296))) (or (< .cse18 v_z_106) (< (+ v_z_106 .cse49) 0) (< .cse18 (+ v_z_106 .cse49 1)) (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse51 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse50 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse51) 0) (< .cse18 (+ v_z_106 .cse51 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse31 (< c_~buffer_size~0 1))) (and .cse0 .cse1 (or .cse2 .cse3 (< .cse4 .cse5) (not (= (+ .cse6 .cse5) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse14 (+ v_z_110 1)) (.cse9 (* v_y_126 4294967296))) (let ((.cse8 (+ c_~value~0 v_z_126 .cse9)) (.cse7 (* v_y_110 4294967296)) (.cse10 (+ v_z_126 .cse9)) (.cse11 (mod .cse14 v_z_126)) (.cse13 (* v_y_120 4294967296)) (.cse12 (* v_y_112 4294967296))) (or (< (+ .cse7 v_z_110) 0) (< 16 .cse8) (< 11 (+ .cse5 v_z_126 .cse9)) (< .cse8 10) (< .cse10 (+ c_~value~0 4)) (< .cse11 .cse12) (< 4294967295 v_z_110) (= .cse11 .cse12) (< 4294967295 v_z_126) (< v_z_126 (+ .cse7 v_z_110 1)) (< (+ 4294967295 .cse13 .cse12) .cse11) (< (+ c_~value~0 10) .cse10) (< .cse10 (+ 9 .cse5)) (< (+ 4294967295 .cse12) .cse11) (< (mod (+ .cse11 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse14 (+ .cse13 .cse12)))))) .cse15) .cse16) (< (+ .cse6 6) c_~value~0)) (or .cse2 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse22 (+ v_z_110 1))) (let ((.cse17 (* v_y_110 4294967296)) (.cse20 (mod .cse22 .cse18)) (.cse21 (* v_y_120 4294967296)) (.cse19 (* v_y_112 4294967296))) (or (< (+ .cse17 v_z_110) 0) (< .cse18 (+ .cse17 v_z_110 1)) (< (+ 4294967295 .cse19) .cse20) (< .cse20 .cse19) (< 4294967295 v_z_110) (= .cse20 .cse19) (< (+ 4294967295 .cse21 .cse19) .cse20) (< (mod (+ .cse20 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse18) 1) (< .cse22 (+ .cse21 .cse19)))))) .cse23 .cse15) (or .cse16 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse24 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse24 v_z_119) 0) (< .cse18 (+ .cse24 v_z_119 1)) (< (mod (+ v_z_119 1) .cse18) 1) (< 4294967295 v_z_119)))) .cse25) (or .cse26 .cse27 .cse16 .cse28 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse30 (* v_y_120 4294967296))) (let ((.cse29 (+ v_z_120 .cse30))) (or (< (mod (+ v_z_120 1) .cse18) 1) (= .cse29 0) (< .cse29 0) (< v_z_120 0) (< .cse18 (+ v_z_120 .cse30 1)) (< 4294967295 v_z_120))))))) .cse3 .cse31) (or .cse32 (and (or .cse33 .cse34 .cse2 .cse35 .cse23 .cse15 .cse31) (or .cse2 .cse16 .cse36 .cse37))) (or .cse32 .cse2 .cse16 .cse38 .cse36) (or .cse32 (and .cse1 .cse39)) (or .cse2 (and (or .cse34 .cse26 .cse16 .cse40 .cse28 .cse41) (or .cse33 .cse34 .cse35 .cse42 .cse23 .cse31))) (or .cse2 .cse43 (and (or .cse33 .cse35 .cse42 .cse23 .cse15 .cse31) (or .cse26 .cse16 .cse40 .cse28 .cse41))) (or (and (let ((.cse44 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse35 .cse31) (not (= .cse44 0))) .cse2 .cse23 .cse15 (< 0 .cse44))) (or .cse2 .cse16 .cse36)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse32 .cse2 .cse16 .cse36 .cse37) (or (= |c_#ghost~m_locked| 0) (and .cse0 (or .cse2 .cse3 (and (or .cse26 .cse27 .cse16 .cse28) (or .cse23 .cse15))))) (or .cse32 (and (or .cse33 .cse2 .cse35 .cse3 .cse23 .cse31) (or .cse2 .cse45 .cse16 .cse36))) (or .cse33 .cse26 .cse2 .cse27 .cse35 .cse3 .cse28 .cse46 .cse31) .cse39 (or .cse26 .cse2 .cse27 .cse28 .cse41 .cse43) (or .cse33 .cse34 .cse26 .cse2 .cse27 .cse35 .cse15 .cse28 .cse46 .cse31)))))) is different from false [2024-06-20 18:29:25,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse54 (mod c_~first~0 4294967296)) (.cse5 (mod c_~receive~0 256)) (.cse6 (mod c_~send~0 256))) (let ((.cse23 (= .cse6 0)) (.cse27 (= .cse5 0)) (.cse48 (mod c_~next~0 4294967296)) (.cse18 (mod c_~buffer_size~0 4294967296)) (.cse53 (+ .cse54 1)) (.cse4 (+ c_~value~0 1))) (let ((.cse25 (not (= .cse4 0))) (.cse42 (< .cse18 .cse53)) (.cse51 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse49 (< .cse48 1)) (.cse38 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (not .cse27)) (.cse46 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse16 (not .cse23)) (.cse36 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse2 (= |c_#ghost~multithreaded| 0)) (.cse43 (< 0 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)))) (let ((.cse1 (or .cse2 .cse23 .cse43)) (.cse40 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse37 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse45 (= |c_#ghost~m_locked| 0)) (.cse0 (or .cse32 .cse2 .cse46 .cse16 .cse36)) (.cse3 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (.cse39 (or .cse2 .cse16 .cse38 .cse36)) (.cse41 (and (or (and (<= 1 .cse48) (<= .cse53 .cse18)) .cse25) (or .cse42 (and (or (< 2147483647 .cse54) (not (= c_~value~0 (select .cse51 (+ |c_~#buffer~0.offset| .cse54))))) (or (not (= (select .cse51 (+ |c_~#buffer~0.offset| .cse54 (- 4294967296))) c_~value~0)) (< .cse54 2147483648))) .cse49))) (.cse33 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse18) 1)) (.cse34 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse26 (< (+ c_~value~0 2147483648) 0)) (.cse35 (< .cse18 (+ .cse48 1))) (.cse15 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse28 (< 2147483647 c_~value~0)) (.cse47 (and (or .cse25 (< 0 .cse48)) (or .cse49 (and (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse50 (* v_y_106 4294967296))) (or (< .cse18 v_z_106) (< (+ v_z_106 .cse50) 0) (< .cse18 (+ v_z_106 .cse50 1)) (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| v_z_106 (- 4294967297))))) (< v_z_106 2147483649)))) (forall ((|~#buffer~0.offset| Int) (v_y_106 Int) (v_z_106 Int)) (let ((.cse52 (* v_y_106 4294967296))) (or (not (= c_~value~0 (select .cse51 (+ |~#buffer~0.offset| (- 1) v_z_106)))) (< v_z_106 0) (< (+ v_z_106 .cse52) 0) (< .cse18 (+ v_z_106 .cse52 1)) (= v_z_106 0) (< 2147483648 v_z_106)))))))) (.cse31 (< c_~buffer_size~0 1))) (and .cse0 .cse1 (or .cse2 .cse3 (< .cse4 .cse5) (not (= (+ .cse6 .cse5) 1)) (and (or (forall ((v_z_110 Int) (v_z_126 Int) (v_y_126 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse14 (+ v_z_110 1)) (.cse9 (* v_y_126 4294967296))) (let ((.cse8 (+ c_~value~0 v_z_126 .cse9)) (.cse7 (* v_y_110 4294967296)) (.cse10 (+ v_z_126 .cse9)) (.cse11 (mod .cse14 v_z_126)) (.cse13 (* v_y_120 4294967296)) (.cse12 (* v_y_112 4294967296))) (or (< (+ .cse7 v_z_110) 0) (< 16 .cse8) (< 11 (+ .cse5 v_z_126 .cse9)) (< .cse8 10) (< .cse10 (+ c_~value~0 4)) (< .cse11 .cse12) (< 4294967295 v_z_110) (= .cse11 .cse12) (< 4294967295 v_z_126) (< v_z_126 (+ .cse7 v_z_110 1)) (< (+ 4294967295 .cse13 .cse12) .cse11) (< (+ c_~value~0 10) .cse10) (< .cse10 (+ 9 .cse5)) (< (+ 4294967295 .cse12) .cse11) (< (mod (+ .cse11 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) v_z_126) 1) (< .cse14 (+ .cse13 .cse12)))))) .cse15) .cse16) (< (+ .cse6 6) c_~value~0)) (or .cse2 (and (or (forall ((v_z_110 Int) (v_y_112 Int) (v_y_120 Int) (v_y_110 Int)) (let ((.cse22 (+ v_z_110 1))) (let ((.cse17 (* v_y_110 4294967296)) (.cse20 (mod .cse22 .cse18)) (.cse21 (* v_y_120 4294967296)) (.cse19 (* v_y_112 4294967296))) (or (< (+ .cse17 v_z_110) 0) (< .cse18 (+ .cse17 v_z_110 1)) (< (+ 4294967295 .cse19) .cse20) (< .cse20 .cse19) (< 4294967295 v_z_110) (= .cse20 .cse19) (< (+ 4294967295 .cse21 .cse19) .cse20) (< (mod (+ .cse20 (* v_y_112 (- 4294967296)) (* v_y_120 (- 4294967296)) 1) .cse18) 1) (< .cse22 (+ .cse21 .cse19)))))) .cse23 .cse15) (or .cse16 (forall ((v_y_119 Int) (v_z_119 Int)) (let ((.cse24 (* v_y_119 4294967296))) (or (< v_z_119 0) (< (+ .cse24 v_z_119) 0) (< .cse18 (+ .cse24 v_z_119 1)) (< (mod (+ v_z_119 1) .cse18) 1) (< 4294967295 v_z_119)))) .cse25) (or .cse26 .cse27 .cse16 .cse28 (forall ((v_z_120 Int) (v_y_120 Int)) (let ((.cse30 (* v_y_120 4294967296))) (let ((.cse29 (+ v_z_120 .cse30))) (or (< (mod (+ v_z_120 1) .cse18) 1) (= .cse29 0) (< .cse29 0) (< v_z_120 0) (< .cse18 (+ v_z_120 .cse30 1)) (< 4294967295 v_z_120))))))) .cse3 .cse31) (or .cse32 (and (or .cse33 .cse34 .cse2 .cse35 .cse23 .cse15 .cse31) (or .cse2 .cse16 .cse36 .cse37))) (or .cse32 .cse2 .cse16 .cse38 .cse36) (or .cse32 (and .cse1 .cse39)) (or .cse2 (and (or .cse34 .cse26 .cse16 .cse40 .cse28 .cse41) (or .cse33 .cse34 .cse35 .cse42 .cse23 .cse31))) (or .cse2 .cse43 (and (or .cse33 .cse35 .cse42 .cse23 .cse15 .cse31) (or .cse26 .cse16 .cse40 .cse28 .cse41))) (or (and (let ((.cse44 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and (or .cse35 .cse31) (not (= .cse44 0))) .cse2 .cse23 .cse15 (< 0 .cse44))) (or .cse2 .cse16 .cse36)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse32 .cse2 .cse16 .cse45 .cse36) (or .cse32 .cse2 .cse16 .cse36 .cse37) (or .cse45 (and .cse0 (or .cse2 .cse3 (and (or .cse26 .cse27 .cse16 .cse28) (or .cse23 .cse15))))) (or .cse32 (and (or .cse33 .cse2 .cse35 .cse3 .cse23 .cse31) (or .cse2 .cse46 .cse16 .cse36))) (or .cse33 .cse26 .cse2 .cse27 .cse35 .cse3 .cse28 .cse47 .cse31) .cse39 (or .cse26 .cse2 .cse27 .cse28 .cse41 .cse43) (or .cse33 .cse34 .cse26 .cse2 .cse27 .cse35 .cse15 .cse28 .cse47 .cse31)))))) is different from false [2024-06-20 18:29:32,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15