./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/protection/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/protection/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 15:39:01,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 15:39:01,920 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 15:39:01,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 15:39:01,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 15:39:01,947 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 15:39:01,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 15:39:01,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 15:39:01,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 15:39:01,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 15:39:01,952 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 15:39:01,952 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 15:39:01,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 15:39:01,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 15:39:01,954 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 15:39:01,955 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 15:39:01,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 15:39:01,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 15:39:01,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 15:39:01,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 15:39:01,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 15:39:01,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 15:39:01,957 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 15:39:01,957 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 15:39:01,957 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 15:39:01,957 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 15:39:01,958 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 15:39:01,958 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 15:39:01,958 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 15:39:01,958 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 15:39:01,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 15:39:01,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 15:39:01,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 15:39:01,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 15:39:01,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 15:39:01,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 15:39:01,960 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 15:39:01,960 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 15:39:01,961 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 15:39:01,961 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 15:39:01,961 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 15:39:01,961 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 15:39:01,961 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 15:39:01,962 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 15:39:02,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 15:39:02,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 15:39:02,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 15:39:02,203 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 15:39:02,204 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 15:39:02,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml [2024-06-20 15:39:02,280 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 15:39:02,280 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 15:39:02,281 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 15:39:03,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 15:39:03,504 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 15:39:03,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-20 15:39:03,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fb9cce5/670a7658f0384fe690b79044d6bb3b85/FLAGefa5554b2 [2024-06-20 15:39:03,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fb9cce5/670a7658f0384fe690b79044d6bb3b85 [2024-06-20 15:39:03,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 15:39:03,526 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 15:39:03,526 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 15:39:03,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 15:39:03,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 15:39:03,530 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:39:02" (1/2) ... [2024-06-20 15:39:03,531 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777ecfbf and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:39:03, skipping insertion in model container [2024-06-20 15:39:03,531 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:39:02" (1/2) ... [2024-06-20 15:39:03,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1f9ddff5 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 03:39:03, skipping insertion in model container [2024-06-20 15:39:03,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 03:39:03" (2/2) ... [2024-06-20 15:39:03,533 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@777ecfbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:03, skipping insertion in model container [2024-06-20 15:39:03,533 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 03:39:03" (2/2) ... [2024-06-20 15:39:03,533 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 15:39:03,552 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 15:39:03,553 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] ! multithreaded || (0 <= value && value <= 6) [2024-06-20 15:39:03,553 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] ! multithreaded || (0 <= value && value <= 6) [2024-06-20 15:39:03,553 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-20 15:39:03,553 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 15:39:03,553 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-20 15:39:03,553 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-20 15:39:03,553 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-20 15:39:03,554 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-20 15:39:03,554 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-20 15:39:03,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 15:39:03,871 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 15:39:03,884 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 15:39:03,970 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 15:39:04,003 INFO L206 MainTranslator]: Completed translation [2024-06-20 15:39:04,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04 WrapperNode [2024-06-20 15:39:04,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 15:39:04,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 15:39:04,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 15:39:04,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 15:39:04,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,039 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-20 15:39:04,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 15:39:04,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 15:39:04,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 15:39:04,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 15:39:04,048 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,061 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 15:39:04,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,071 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 15:39:04,076 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 15:39:04,076 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 15:39:04,076 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 15:39:04,077 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (1/1) ... [2024-06-20 15:39:04,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 15:39:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:39:04,170 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 15:39:04,217 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 15:39:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-20 15:39:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-20 15:39:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-20 15:39:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-20 15:39:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-20 15:39:04,260 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-20 15:39:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-20 15:39:04,261 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-20 15:39:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-20 15:39:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-20 15:39:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-20 15:39:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-20 15:39:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-20 15:39:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-20 15:39:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-20 15:39:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 15:39:04,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 15:39:04,265 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 15:39:04,396 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 15:39:04,398 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 15:39:04,591 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 15:39:04,591 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 15:39:04,835 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 15:39:04,835 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-20 15:39:04,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 03:39:04 BoogieIcfgContainer [2024-06-20 15:39:04,838 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 15:39:04,840 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 15:39:04,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 15:39:04,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 15:39:04,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 03:39:02" (1/4) ... [2024-06-20 15:39:04,843 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e3e710 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 03:39:04, skipping insertion in model container [2024-06-20 15:39:04,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 03:39:03" (2/4) ... [2024-06-20 15:39:04,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e3e710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 03:39:04, skipping insertion in model container [2024-06-20 15:39:04,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 03:39:04" (3/4) ... [2024-06-20 15:39:04,845 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20e3e710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 03:39:04, skipping insertion in model container [2024-06-20 15:39:04,845 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 03:39:04" (4/4) ... [2024-06-20 15:39:04,846 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-20 15:39:04,861 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 15:39:04,861 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 15:39:04,861 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 15:39:04,902 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-20 15:39:04,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 29 transitions, 72 flow [2024-06-20 15:39:04,948 INFO L124 PetriNetUnfolderBase]: 2/27 cut-off events. [2024-06-20 15:39:04,948 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-20 15:39:04,950 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 15:39:04,951 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 29 transitions, 72 flow [2024-06-20 15:39:04,953 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 59 flow [2024-06-20 15:39:04,959 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 15:39:04,964 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;@6f8fb633, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 15:39:04,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-20 15:39:04,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 15:39:04,968 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-20 15:39:04,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 15:39:04,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:39:04,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-20 15:39:04,969 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 15:39:04,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:39:04,973 INFO L85 PathProgramCache]: Analyzing trace with hash 406286641, now seen corresponding path program 1 times [2024-06-20 15:39:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:39:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484544637] [2024-06-20 15:39:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:04,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:39:05,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:39:05,229 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 15:39:05,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:39:05,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484544637] [2024-06-20 15:39:05,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484544637] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:39:05,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:39:05,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 15:39:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562937750] [2024-06-20 15:39:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:39:05,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 15:39:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:39:05,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 15:39:05,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 15:39:05,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 15:39:05,285 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 15:39:05,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:39:05,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 15:39:05,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:39:05,486 INFO L124 PetriNetUnfolderBase]: 267/484 cut-off events. [2024-06-20 15:39:05,486 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-06-20 15:39:05,487 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 15:39:05,490 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 3/39 dead transitions. [2024-06-20 15:39:05,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-06-20 15:39:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 15:39:05,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 15:39:05,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2024-06-20 15:39:05,499 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.632183908045977 [2024-06-20 15:39:05,500 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 59 flow. Second operand 3 states and 55 transitions. [2024-06-20 15:39:05,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-06-20 15:39:05,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 15:39:05,504 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 65 flow [2024-06-20 15:39:05,505 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 15:39:05,508 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2024-06-20 15:39:05,508 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 65 flow [2024-06-20 15:39:05,508 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 15:39:05,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:39:05,508 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:39:05,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 15:39:05,509 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 15:39:05,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:39:05,509 INFO L85 PathProgramCache]: Analyzing trace with hash 2116370505, now seen corresponding path program 1 times [2024-06-20 15:39:05,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:39:05,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974810083] [2024-06-20 15:39:05,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:05,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:39:05,534 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:39:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [48533565] [2024-06-20 15:39:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:05,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:39:05,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:39:05,537 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 15:39:05,556 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 15:39:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:39:05,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-20 15:39:05,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:39:05,784 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 15:39:05,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 15:39:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:39:05,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974810083] [2024-06-20 15:39:05,787 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:39:05,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48533565] [2024-06-20 15:39:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48533565] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:39:05,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:39:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 15:39:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680634227] [2024-06-20 15:39:05,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:39:05,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 15:39:05,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:39:05,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 15:39:05,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 15:39:05,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 15:39:05,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 15:39:05,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:39:05,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 15:39:05,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:39:05,931 INFO L124 PetriNetUnfolderBase]: 339/610 cut-off events. [2024-06-20 15:39:05,931 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-20 15:39:05,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 610 events. 339/610 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2444 event pairs, 98 based on Foata normal form. 50/656 useless extension candidates. Maximal degree in co-relation 703. Up to 296 conditions per place. [2024-06-20 15:39:05,935 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 42 selfloop transitions, 4 changer transitions 1/51 dead transitions. [2024-06-20 15:39:05,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 51 transitions, 217 flow [2024-06-20 15:39:05,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 15:39:05,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 15:39:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2024-06-20 15:39:05,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6551724137931034 [2024-06-20 15:39:05,937 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 65 flow. Second operand 4 states and 76 transitions. [2024-06-20 15:39:05,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 51 transitions, 217 flow [2024-06-20 15:39:05,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 15:39:05,938 INFO L231 Difference]: Finished difference. Result has 33 places, 27 transitions, 97 flow [2024-06-20 15:39:05,939 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=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=27} [2024-06-20 15:39:05,939 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 3 predicate places. [2024-06-20 15:39:05,939 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 27 transitions, 97 flow [2024-06-20 15:39:05,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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 15:39:05,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:39:05,940 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:39:05,952 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 15:39:06,151 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 15:39:06,153 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 15:39:06,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:39:06,153 INFO L85 PathProgramCache]: Analyzing trace with hash 811367141, now seen corresponding path program 1 times [2024-06-20 15:39:06,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:39:06,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181181660] [2024-06-20 15:39:06,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:06,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:39:06,171 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:39:06,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2114264850] [2024-06-20 15:39:06,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:06,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:39:06,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:39:06,172 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 15:39:06,199 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 15:39:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:39:06,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-20 15:39:06,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:39:06,329 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-20 15:39:06,377 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 15:39:06,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:39:07,309 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 15:39:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:39:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181181660] [2024-06-20 15:39:07,310 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:39:07,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114264850] [2024-06-20 15:39:07,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114264850] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:39:07,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:39:07,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-06-20 15:39:07,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699740316] [2024-06-20 15:39:07,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:39:07,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-20 15:39:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:39:07,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-20 15:39:07,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-06-20 15:39:07,339 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 15:39:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 27 transitions, 97 flow. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 15:39:07,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:39:07,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 15:39:07,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:39:07,969 INFO L124 PetriNetUnfolderBase]: 945/1723 cut-off events. [2024-06-20 15:39:07,969 INFO L125 PetriNetUnfolderBase]: For 1354/1354 co-relation queries the response was YES. [2024-06-20 15:39:07,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 1723 events. 945/1723 cut-off events. For 1354/1354 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8226 event pairs, 68 based on Foata normal form. 199/1921 useless extension candidates. Maximal degree in co-relation 3663. Up to 279 conditions per place. [2024-06-20 15:39:07,976 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 121 selfloop transitions, 26 changer transitions 20/171 dead transitions. [2024-06-20 15:39:07,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 171 transitions, 791 flow [2024-06-20 15:39:07,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-20 15:39:07,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-20 15:39:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 272 transitions. [2024-06-20 15:39:07,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6252873563218391 [2024-06-20 15:39:07,979 INFO L175 Difference]: Start difference. First operand has 33 places, 27 transitions, 97 flow. Second operand 15 states and 272 transitions. [2024-06-20 15:39:07,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 171 transitions, 791 flow [2024-06-20 15:39:07,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 171 transitions, 787 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 15:39:07,982 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 337 flow [2024-06-20 15:39:07,982 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=337, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2024-06-20 15:39:07,983 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2024-06-20 15:39:07,983 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 337 flow [2024-06-20 15:39:07,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 states have internal predecessors, (82), 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 15:39:07,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:39:07,983 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:39:07,998 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 15:39:08,195 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 15:39:08,196 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 15:39:08,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:39:08,196 INFO L85 PathProgramCache]: Analyzing trace with hash -919733271, now seen corresponding path program 1 times [2024-06-20 15:39:08,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:39:08,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607956269] [2024-06-20 15:39:08,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:08,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:39:08,234 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:39:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013664299] [2024-06-20 15:39:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:08,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:39:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:39:08,237 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 15:39:08,264 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 15:39:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:39:08,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-20 15:39:08,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:39:08,381 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 15:39:08,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-20 15:39:08,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-20 15:39:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:39:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607956269] [2024-06-20 15:39:08,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:39:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013664299] [2024-06-20 15:39:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013664299] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 15:39:08,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 15:39:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 15:39:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266424572] [2024-06-20 15:39:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 15:39:08,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 15:39:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:39:08,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 15:39:08,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 15:39:08,391 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-06-20 15:39:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 15:39:08,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:39:08,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-06-20 15:39:08,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:39:08,541 INFO L124 PetriNetUnfolderBase]: 589/1156 cut-off events. [2024-06-20 15:39:08,541 INFO L125 PetriNetUnfolderBase]: For 2254/2277 co-relation queries the response was YES. [2024-06-20 15:39:08,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1156 events. 589/1156 cut-off events. For 2254/2277 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5223 event pairs, 195 based on Foata normal form. 73/1216 useless extension candidates. Maximal degree in co-relation 3227. Up to 563 conditions per place. [2024-06-20 15:39:08,548 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 64 selfloop transitions, 4 changer transitions 0/73 dead transitions. [2024-06-20 15:39:08,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 73 transitions, 588 flow [2024-06-20 15:39:08,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 15:39:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 15:39:08,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-20 15:39:08,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6206896551724138 [2024-06-20 15:39:08,549 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 337 flow. Second operand 3 states and 54 transitions. [2024-06-20 15:39:08,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 73 transitions, 588 flow [2024-06-20 15:39:08,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 73 transitions, 538 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-20 15:39:08,563 INFO L231 Difference]: Finished difference. Result has 55 places, 54 transitions, 308 flow [2024-06-20 15:39:08,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=55, PETRI_TRANSITIONS=54} [2024-06-20 15:39:08,564 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 25 predicate places. [2024-06-20 15:39:08,564 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 54 transitions, 308 flow [2024-06-20 15:39:08,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-20 15:39:08,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:39:08,565 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:39:08,595 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 15:39:08,776 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 15:39:08,779 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 15:39:08,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:39:08,779 INFO L85 PathProgramCache]: Analyzing trace with hash 421639694, now seen corresponding path program 1 times [2024-06-20 15:39:08,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:39:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650500189] [2024-06-20 15:39:08,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:39:08,806 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:39:08,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093502904] [2024-06-20 15:39:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:39:08,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:39:08,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:39:08,807 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 15:39:08,834 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 15:39:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:39:08,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 19 conjunts are in the unsatisfiable core [2024-06-20 15:39:08,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:39:08,996 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 15:39:08,999 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 15:39:09,003 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 15:39:10,423 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:39:10,423 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:39:12,523 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 8 treesize of output 4 [2024-06-20 15:39:14,302 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 8 treesize of output 4 [2024-06-20 15:39:16,650 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 15:39:16,726 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-20 15:39:16,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 122 [2024-06-20 15:39:17,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:39:17,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:39:17,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650500189] [2024-06-20 15:39:17,097 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:39:17,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093502904] [2024-06-20 15:39:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093502904] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:39:17,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:39:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 19 [2024-06-20 15:39:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281064087] [2024-06-20 15:39:17,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:39:17,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-20 15:39:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:39:17,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-20 15:39:17,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-06-20 15:39:17,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 15:39:17,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 54 transitions, 308 flow. Second operand has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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 15:39:17,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:39:17,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 15:39:17,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:39:28,311 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 15:39:45,746 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 15:39:52,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:39:53,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:39:58,753 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 15:40:04,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:40:34,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:40:41,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:41:00,719 INFO L124 PetriNetUnfolderBase]: 5143/8860 cut-off events. [2024-06-20 15:41:00,719 INFO L125 PetriNetUnfolderBase]: For 32486/32486 co-relation queries the response was YES. [2024-06-20 15:41:00,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26903 conditions, 8860 events. 5143/8860 cut-off events. For 32486/32486 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 53455 event pairs, 389 based on Foata normal form. 191/9048 useless extension candidates. Maximal degree in co-relation 23597. Up to 1044 conditions per place. [2024-06-20 15:41:00,756 INFO L140 encePairwiseOnDemand]: 19/29 looper letters, 436 selfloop transitions, 147 changer transitions 136/720 dead transitions. [2024-06-20 15:41:00,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 720 transitions, 4559 flow [2024-06-20 15:41:00,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-06-20 15:41:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2024-06-20 15:41:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 840 transitions. [2024-06-20 15:41:00,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.438871473354232 [2024-06-20 15:41:00,763 INFO L175 Difference]: Start difference. First operand has 55 places, 54 transitions, 308 flow. Second operand 66 states and 840 transitions. [2024-06-20 15:41:00,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 720 transitions, 4559 flow [2024-06-20 15:41:00,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 720 transitions, 4392 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 15:41:00,803 INFO L231 Difference]: Finished difference. Result has 148 places, 190 transitions, 1987 flow [2024-06-20 15:41:00,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=66, PETRI_FLOW=1987, PETRI_PLACES=148, PETRI_TRANSITIONS=190} [2024-06-20 15:41:00,806 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 118 predicate places. [2024-06-20 15:41:00,808 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 190 transitions, 1987 flow [2024-06-20 15:41:00,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.1) internal successors, (122), 20 states have internal predecessors, (122), 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 15:41:00,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:41:00,808 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:41:00,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-20 15:41:01,019 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 15:41:01,019 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 15:41:01,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:41:01,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1338660735, now seen corresponding path program 1 times [2024-06-20 15:41:01,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:41:01,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946885569] [2024-06-20 15:41:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:41:01,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:41:01,034 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:41:01,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664725416] [2024-06-20 15:41:01,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:41:01,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:41:01,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:41:01,036 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 15:41:01,037 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 15:41:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 15:41:01,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-20 15:41:01,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:41:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-20 15:41:01,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:41:03,226 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-20 15:41:03,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:41:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946885569] [2024-06-20 15:41:03,227 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:41:03,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664725416] [2024-06-20 15:41:03,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664725416] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:41:03,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:41:03,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2024-06-20 15:41:03,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663734222] [2024-06-20 15:41:03,228 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:41:03,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-20 15:41:03,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:41:03,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-20 15:41:03,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2024-06-20 15:41:03,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 15:41:03,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 190 transitions, 1987 flow. Second operand has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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 15:41:03,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:41:03,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 15:41:03,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:41:05,327 INFO L124 PetriNetUnfolderBase]: 3354/6665 cut-off events. [2024-06-20 15:41:05,327 INFO L125 PetriNetUnfolderBase]: For 68471/68471 co-relation queries the response was YES. [2024-06-20 15:41:05,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24971 conditions, 6665 events. 3354/6665 cut-off events. For 68471/68471 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 46330 event pairs, 479 based on Foata normal form. 212/6875 useless extension candidates. Maximal degree in co-relation 24440. Up to 1804 conditions per place. [2024-06-20 15:41:05,377 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 273 selfloop transitions, 87 changer transitions 44/407 dead transitions. [2024-06-20 15:41:05,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 407 transitions, 4364 flow [2024-06-20 15:41:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-20 15:41:05,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-20 15:41:05,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 277 transitions. [2024-06-20 15:41:05,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5969827586206896 [2024-06-20 15:41:05,379 INFO L175 Difference]: Start difference. First operand has 148 places, 190 transitions, 1987 flow. Second operand 16 states and 277 transitions. [2024-06-20 15:41:05,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 407 transitions, 4364 flow [2024-06-20 15:41:05,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 407 transitions, 3510 flow, removed 398 selfloop flow, removed 20 redundant places. [2024-06-20 15:41:05,712 INFO L231 Difference]: Finished difference. Result has 135 places, 215 transitions, 1932 flow [2024-06-20 15:41:05,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1253, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1932, PETRI_PLACES=135, PETRI_TRANSITIONS=215} [2024-06-20 15:41:05,713 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 105 predicate places. [2024-06-20 15:41:05,713 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 215 transitions, 1932 flow [2024-06-20 15:41:05,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.066666666666666) internal successors, (136), 15 states have internal predecessors, (136), 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 15:41:05,714 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:41:05,714 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:41:05,725 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 15:41:05,925 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 15:41:05,926 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 15:41:05,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:41:05,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1268089988, now seen corresponding path program 2 times [2024-06-20 15:41:05,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:41:05,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467080993] [2024-06-20 15:41:05,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:41:05,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:41:05,942 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:41:05,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [141268085] [2024-06-20 15:41:05,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-20 15:41:05,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:41:05,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:41:05,946 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 15:41:05,968 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 15:41:06,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-20 15:41:06,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 15:41:06,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 24 conjunts are in the unsatisfiable core [2024-06-20 15:41:06,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:41:06,208 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 15:41:06,213 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 15:41:06,217 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 15:41:07,980 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 15:41:07,987 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 15:41:07,993 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 51 treesize of output 38 [2024-06-20 15:41:07,999 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 8 treesize of output 3 [2024-06-20 15:41:08,007 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 8 treesize of output 3 [2024-06-20 15:41:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:41:08,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:41:11,098 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 9 treesize of output 4 [2024-06-20 15:41:11,114 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 8 treesize of output 4 [2024-06-20 15:41:12,594 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 9 treesize of output 4 [2024-06-20 15:41:12,605 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 8 treesize of output 4 [2024-06-20 15:41:14,574 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 9 treesize of output 4 [2024-06-20 15:41:14,619 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 8 treesize of output 4 [2024-06-20 15:41:16,527 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 15:41:16,578 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 15:41:16,590 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 15:41:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 3 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:41:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:41:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467080993] [2024-06-20 15:41:17,394 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:41:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141268085] [2024-06-20 15:41:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141268085] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:41:17,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:41:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15] total 27 [2024-06-20 15:41:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801073565] [2024-06-20 15:41:17,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:41:17,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-06-20 15:41:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:41:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-06-20 15:41:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2024-06-20 15:41:18,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 29 [2024-06-20 15:41:18,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 215 transitions, 1932 flow. Second operand has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 29 states have internal predecessors, (225), 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 15:41:18,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:41:18,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 29 [2024-06-20 15:41:18,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:41:24,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-20 15:41:31,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:41:39,565 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 15:41:53,393 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 15:41:58,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:42:02,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:42:05,488 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse22 (+ .cse24 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse9 (or .cse2 .cse5)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse15 (and .cse9 (not (= .cse25 0)))) (.cse16 (< 0 .cse25)) (.cse18 (< 0 .cse20)) (.cse19 (< .cse17 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse22 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse22 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse24 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse13 (and (or .cse15 .cse3 .cse4 .cse16) (or .cse6 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) (or .cse15 .cse7 .cse8 .cse4 .cse11 .cse12 .cse16) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse20 0)) .cse9) .cse18 .cse19) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse21 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse21) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse21 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5))))))))) is different from false [2024-06-20 15:42:05,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse26 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse24 (+ .cse26 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse10 (or .cse2 .cse5)) (.cse27 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse3 (= (mod c_~send~0 256) 0))) (let ((.cse9 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse22 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse7 (not .cse3)) (.cse15 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse20 (and .cse10 (not (= .cse27 0)))) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 0 .cse27)) (.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse11)) (.cse6 (or .cse20 .cse3 .cse4 .cse21)) (.cse16 (or .cse7 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15)) (.cse18 (< 0 .cse22)) (.cse19 (< .cse17 0)) (.cse14 (not .cse9)) (.cse8 (< (+ c_~value~0 2147483648) 0)) (.cse12 (< 2147483647 c_~value~0)) (.cse13 (and (or (let ((.cse25 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse24 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse25 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse24 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse26 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (or .cse7 (and (or .cse1 .cse8 .cse9 (and .cse10 (not (= .cse11 0))) .cse12 .cse13 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse14 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15))) (or .cse14 (and .cse6 .cse16)) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) .cse16 (or .cse20 .cse8 .cse9 .cse4 .cse12 .cse13 .cse21) (or .cse14 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7 .cse15) (or (and (or .cse8 .cse9 .cse12 .cse13 (and (not (= .cse22 0)) .cse10) .cse18 .cse19) (or .cse14 .cse15 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse7) (let ((.cse23 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse23) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse8 .cse9 (and (not (= .cse23 0)) .cse10) .cse7 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))))) is different from false [2024-06-20 15:42:12,617 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse28 (mod c_~buffer_size~0 4294967296)) (.cse32 (mod c_~next~0 4294967296))) (let ((.cse12 (< .cse28 (+ .cse32 1))) (.cse15 (< c_~buffer_size~0 1))) (let ((.cse25 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse30 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse19 (or .cse12 .cse15))) (let ((.cse18 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4)) (.cse16 (< (+ c_~value~0 2147483648) 0)) (.cse21 (< 2147483647 c_~value~0)) (.cse22 (and (or (let ((.cse31 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse28 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse31 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse31 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse28 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse32 1)) (not (= (+ c_~value~0 1) 0)))) (.cse5 (and (not (= .cse30 0)) .cse19)) (.cse6 (< 0 .cse30)) (.cse7 (< .cse25 0)) (.cse4 (= (mod c_~send~0 256) 0)) (.cse17 (= (mod c_~receive~0 256) 0)) (.cse29 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse13 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse23 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse11 (< 0 .cse23)) (.cse14 (< .cse13 0)) (.cse8 (and .cse19 (not (= .cse29 0)))) (.cse9 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse24 (< 0 .cse29)) (.cse0 (not .cse17)) (.cse2 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (not .cse4)) (.cse26 (or .cse16 .cse17 .cse21 .cse22 .cse5 .cse6 .cse7)) (.cse10 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse28) 1)) (.cse20 (< 0 .cse18))) (and (or .cse0 .cse1 .cse2 (< 1 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse6 .cse7))) (or .cse8 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse4 .cse9 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse10 .cse11 .cse12 .cse4 (= .cse13 0) .cse14 .cse15) (or .cse1 (and (or .cse16 .cse17 (and (not (= .cse18 0)) .cse19) .cse20 .cse21 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse22) (or .cse0 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2))) (or .cse1 (and (or .cse11 .cse16 .cse17 (and .cse19 (not (= .cse23 0))) .cse21 .cse22 .cse14) (or .cse0 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2))) (or .cse0 (and (or .cse8 .cse4 .cse9 .cse24) (or .cse1 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2))) (or .cse10 (= .cse25 0) .cse12 .cse4 .cse6 .cse7 .cse15) (or .cse8 .cse16 .cse17 .cse9 .cse21 .cse22 .cse24) (or .cse1 .cse2) (or (and .cse26 (or .cse0 .cse2 .cse3)) .cse1) (let ((.cse27 (+ 5 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (or .cse10 .cse12 .cse4 .cse7 .cse15) (or .cse16 .cse17 .cse1 .cse21 .cse22 (and .cse19 (not (= .cse27 0))))) (< 0 .cse27) (< (+ 2147483652 |c_t1Thread1of1ForFork0_~i~0#1|) 0))) .cse26 (or .cse10 .cse12 .cse20 .cse4 .cse7 .cse15))))))) is different from false [2024-06-20 15:42:12,626 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~buffer_size~0 4294967296)) (.cse22 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse20 (+ .cse22 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse16 (< 0 .cse18)) (.cse17 (< .cse15 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse9 (or .cse2 .cse5)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse20 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse20 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse22 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse20) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse15 0) .cse2 .cse3 .cse16 .cse17 .cse5) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse18 0)) .cse9) .cse16 .cse17) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse19 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse19) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse19 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))) is different from false [2024-06-20 15:42:13,565 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (mod c_~buffer_size~0 4294967296)) (.cse23 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse2 (< .cse21 (+ .cse23 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse10 (= (mod c_~receive~0 256) 0)) (.cse16 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse19 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse11 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse11)) (.cse17 (< 0 .cse19)) (.cse18 (< .cse16 0)) (.cse14 (not .cse10)) (.cse15 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse6 (or .cse2 .cse5)) (.cse8 (not .cse3)) (.cse12 (< 2147483647 c_~value~0)) (.cse13 (and (or (let ((.cse22 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse21 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse22 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse21 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse23 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse21) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (let ((.cse7 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse6 (not (= .cse7 0))) .cse3 .cse4 (< 0 .cse7))) (or .cse8 (and (or .cse1 .cse9 .cse10 (and .cse6 (not (= .cse11 0))) .cse12 .cse13 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse14 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15))) (or .cse0 (= .cse16 0) .cse2 .cse3 .cse17 .cse18 .cse5) (or .cse8 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse15) (or .cse14 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse8 .cse15) (or (and (or .cse9 .cse10 .cse12 .cse13 (and (not (= .cse19 0)) .cse6) .cse17 .cse18) (or .cse14 .cse15 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse8) (let ((.cse20 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse20) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse9 .cse10 (and (not (= .cse20 0)) .cse6) .cse8 .cse12 .cse13) (or .cse0 .cse2 .cse3 .cse4 .cse5)))))))) is different from false [2024-06-20 15:42:22,886 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~buffer_size~0 4294967296)) (.cse22 (mod c_~next~0 4294967296))) (let ((.cse1 (= (mod c_~send~0 256) 0)) (.cse5 (< .cse20 (+ .cse22 1))) (.cse6 (< c_~buffer_size~0 1)) (.cse9 (= (mod c_~receive~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse4 (< 0 .cse10)) (.cse16 (< 0 .cse18)) (.cse17 (< .cse15 0)) (.cse13 (not .cse9)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse8 (< (+ c_~value~0 2147483648) 0)) (.cse0 (or .cse5 .cse6)) (.cse7 (not .cse1)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse20 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse20 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse22 1)) (not (= (+ c_~value~0 1) 0)))) (.cse3 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse20) 1)) (.cse2 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and .cse0 (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 1) 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse1 .cse2 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse4 .cse5 .cse1 .cse2 .cse6) (or .cse7 (and (or .cse4 .cse8 .cse9 (and .cse0 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse3 (= .cse15 0) .cse5 .cse1 .cse16 .cse17 .cse6) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse7 .cse14) (or .cse7 .cse14) (or (and (or .cse8 .cse9 .cse11 .cse12 (and (not (= .cse18 0)) .cse0) .cse16 .cse17) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse7) (let ((.cse19 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse19) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse8 .cse9 (and (not (= .cse19 0)) .cse0) .cse7 .cse11 .cse12) (or .cse3 .cse5 .cse1 .cse2 .cse6)))))))) is different from false [2024-06-20 15:42:32,259 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 15:42:40,988 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 15:42:49,211 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 15:42:53,008 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (mod c_~buffer_size~0 4294967296)) (.cse24 (mod c_~next~0 4294967296))) (let ((.cse2 (< .cse22 (+ .cse24 1))) (.cse5 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse8 (= (mod c_~receive~0 256) 0)) (.cse17 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse9 (or .cse2 .cse5)) (.cse25 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse10 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (< 0 .cse10)) (.cse15 (and .cse9 (not (= .cse25 0)))) (.cse16 (< 0 .cse25)) (.cse18 (< 0 .cse20)) (.cse19 (< .cse17 0)) (.cse13 (not .cse8)) (.cse14 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse7 (< (+ c_~value~0 2147483648) 0)) (.cse6 (not .cse3)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (let ((.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_42 Int)) (or (< 2147483647 v_z_42) (< v_z_42 0) (< .cse22 (+ v_z_42 1)) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42))))))) (forall ((v_z_42 Int)) (or (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_42 (- 4294967296)))))) (< .cse22 (+ v_z_42 1)) (< v_z_42 2147483648))))) (< .cse24 1)) (not (= (+ c_~value~0 1) 0)))) (.cse0 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse22) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (or .cse6 (and (or .cse1 .cse7 .cse8 (and .cse9 (not (= .cse10 0))) .cse11 .cse12 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse13 (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse13 (and (or .cse15 .cse3 .cse4 .cse16) (or .cse6 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse14))) (or .cse0 (= .cse17 0) .cse2 .cse3 .cse18 .cse19 .cse5) (or .cse15 .cse7 .cse8 .cse4 .cse11 .cse12 .cse16) (or .cse13 (< 2 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6 .cse14) (or (and (or .cse7 .cse8 .cse11 .cse12 (and (not (= .cse20 0)) .cse9) .cse18 .cse19) (or .cse13 .cse14 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|))) .cse6) (let ((.cse21 (+ |c_t1Thread1of1ForFork0_~i~0#1| 4))) (or (< 0 .cse21) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (and (or .cse7 .cse8 (and (not (= .cse21 0)) .cse9) .cse6 .cse11 .cse12) (or .cse0 .cse2 .cse3 .cse4 .cse5)))) (= c_~value~0 4)))))) is different from false [2024-06-20 15:43:08,217 INFO L124 PetriNetUnfolderBase]: 16939/30634 cut-off events. [2024-06-20 15:43:08,217 INFO L125 PetriNetUnfolderBase]: For 172941/172941 co-relation queries the response was YES. [2024-06-20 15:43:08,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105557 conditions, 30634 events. 16939/30634 cut-off events. For 172941/172941 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 245636 event pairs, 1057 based on Foata normal form. 605/31236 useless extension candidates. Maximal degree in co-relation 105365. Up to 5728 conditions per place. [2024-06-20 15:43:08,413 INFO L140 encePairwiseOnDemand]: 15/29 looper letters, 638 selfloop transitions, 795 changer transitions 50/1485 dead transitions. [2024-06-20 15:43:08,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 1485 transitions, 14478 flow [2024-06-20 15:43:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2024-06-20 15:43:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2024-06-20 15:43:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 1211 transitions. [2024-06-20 15:43:08,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509251471825063 [2024-06-20 15:43:08,419 INFO L175 Difference]: Start difference. First operand has 135 places, 215 transitions, 1932 flow. Second operand 82 states and 1211 transitions. [2024-06-20 15:43:08,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 1485 transitions, 14478 flow [2024-06-20 15:43:09,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1485 transitions, 14106 flow, removed 174 selfloop flow, removed 9 redundant places. [2024-06-20 15:43:09,110 INFO L231 Difference]: Finished difference. Result has 233 places, 969 transitions, 12170 flow [2024-06-20 15:43:09,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1888, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=12170, PETRI_PLACES=233, PETRI_TRANSITIONS=969} [2024-06-20 15:43:09,111 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 203 predicate places. [2024-06-20 15:43:09,112 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 969 transitions, 12170 flow [2024-06-20 15:43:09,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.758620689655173) internal successors, (225), 29 states have internal predecessors, (225), 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 15:43:09,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:43:09,112 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:43:09,124 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 15:43:09,318 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 15:43:09,320 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 15:43:09,320 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:43:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1739932023, now seen corresponding path program 2 times [2024-06-20 15:43:09,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:43:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054800644] [2024-06-20 15:43:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:43:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:43:09,343 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:43:09,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066297212] [2024-06-20 15:43:09,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-20 15:43:09,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:43:09,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:43:09,344 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 15:43:09,345 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 15:43:09,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-20 15:43:09,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 15:43:09,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 27 conjunts are in the unsatisfiable core [2024-06-20 15:43:09,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:43:09,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-20 15:43:09,725 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 15:43:09,728 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 15:43:11,048 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 53 treesize of output 40 [2024-06-20 15:43:11,057 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 15:43:11,065 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 12 treesize of output 3 [2024-06-20 15:43:11,077 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 15:43:11,276 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 15:43:14,900 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 15:43:14,905 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 87 treesize of output 74 [2024-06-20 15:43:14,912 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 8 treesize of output 3 [2024-06-20 15:43:14,929 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-20 15:43:14,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 15:43:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:43:17,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:43:19,891 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 15:43:19,902 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 15:43:22,365 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 15:43:22,407 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 15:43:27,506 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 15:43:27,699 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 15:43:27,767 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 15:43:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:43:28,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:43:28,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054800644] [2024-06-20 15:43:28,836 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:43:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066297212] [2024-06-20 15:43:28,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066297212] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:43:28,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:43:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 29 [2024-06-20 15:43:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021616655] [2024-06-20 15:43:28,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:43:28,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-20 15:43:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:43:28,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-20 15:43:28,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=679, Unknown=1, NotChecked=0, Total=930 [2024-06-20 15:43:28,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 29 [2024-06-20 15:43:28,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 969 transitions, 12170 flow. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 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 15:43:28,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:43:28,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 29 [2024-06-20 15:43:28,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:43:43,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (mod c_~buffer_size~0 4294967296)) (.cse11 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse26 (= (mod c_~receive~0 256) 0)) (.cse21 (< .cse13 (+ .cse11 1))) (.cse22 (< c_~buffer_size~0 1))) (let ((.cse1 (or .cse21 .cse22)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse14 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse11 1)) (.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse10 (< 2147483647 c_~value~0)) (.cse7 (not .cse26)) (.cse19 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse8 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse8) (let ((.cse16 (mod c_~first~0 4294967296))) (let ((.cse12 (+ .cse16 1))) (let ((.cse15 (< .cse13 .cse12))) (and (or .cse9 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse10 (and (or (and (<= 1 .cse11) (<= .cse12 .cse13)) .cse14) (or .cse15 (and (or (< 2147483647 .cse16) (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse16))))) (or (not (= (select .cse17 (+ |c_~#buffer~0.offset| .cse16 (- 4294967296))) c_~value~0)) (< .cse16 2147483648))) .cse18)) (and (not (= .cse8 0)) .cse1)) (or .cse19 (= .cse20 0) .cse21 .cse15 .cse3 .cse22))))) (< .cse20 0))))) (or .cse7 .cse5 .cse6) (or .cse0 .cse6) (or .cse0 (let ((.cse25 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse14 (< 0 .cse11)) (or .cse18 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse23 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse13 (+ .cse23 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse23 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse24 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse13 (+ .cse24 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse24 v_z_72) 0))))))) .cse19 .cse25 .cse9 .cse26 .cse21 .cse4 .cse10 .cse22) (or .cse7 (and (or .cse19 .cse25 .cse21 .cse3 .cse4 .cse22) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))))))) is different from false [2024-06-20 15:43:44,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse9 (mod c_~buffer_size~0 4294967296)) (.cse23 (= (mod c_~receive~0 256) 0)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse0 (= |c_#ghost~multithreaded| 0)) (.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse1 (not .cse23)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (< .cse9 (+ .cse7 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (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)) (and (not (= .cse4 0)) (or .cse15 .cse16))) (or .cse17 (= .cse18 0) .cse15 .cse11 .cse19 .cse16))))) (< .cse18 0))))) (or .cse1 .cse2 .cse3) (or .cse0 (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse20 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse20 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse20 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse21 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse21 v_z_72) 0))))))) .cse17 .cse22 .cse5 .cse23 .cse15 .cse24 .cse6 .cse16) (or .cse1 (and (or .cse17 .cse22 .cse15 .cse19 .cse24 .cse16) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3))))))))) is different from false [2024-06-20 15:43:44,650 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse9 (mod c_~buffer_size~0 4294967296)) (.cse23 (= (mod c_~receive~0 256) 0)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse0 (= |c_#ghost~multithreaded| 0)) (.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse1 (not .cse23)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (< .cse9 (+ .cse7 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (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)) (and (not (= .cse4 0)) (or .cse15 .cse16))) (or .cse17 (= .cse18 0) .cse15 .cse11 .cse19 .cse16))))) (< .cse18 0))))) (or .cse0 (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse20 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse20 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse20 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse21 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse21 v_z_72) 0))))))) .cse17 .cse22 .cse5 .cse23 .cse15 .cse24 .cse6 .cse16) (or .cse1 (and (or .cse17 .cse22 .cse15 .cse19 .cse24 .cse16) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3))))))))) is different from false [2024-06-20 15:43:52,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-20 15:43:58,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-06-20 15:44:29,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-06-20 15:44:29,854 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse13 (mod c_~buffer_size~0 4294967296)) (.cse11 (mod c_~next~0 4294967296))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse26 (= (mod c_~receive~0 256) 0)) (.cse21 (< .cse13 (+ .cse11 1))) (.cse22 (< c_~buffer_size~0 1))) (let ((.cse1 (or .cse21 .cse22)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse14 (not (= (+ c_~value~0 1) 0))) (.cse18 (< .cse11 1)) (.cse17 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse9 (< (+ c_~value~0 2147483648) 0)) (.cse10 (< 2147483647 c_~value~0)) (.cse7 (not .cse26)) (.cse19 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse13) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse8 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse20 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse8) (let ((.cse16 (mod c_~first~0 4294967296))) (let ((.cse12 (+ .cse16 1))) (let ((.cse15 (< .cse13 .cse12))) (and (or .cse9 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse10 (and (or (and (<= 1 .cse11) (<= .cse12 .cse13)) .cse14) (or .cse15 (and (or (< 2147483647 .cse16) (not (= c_~value~0 (select .cse17 (+ |c_~#buffer~0.offset| .cse16))))) (or (not (= (select .cse17 (+ |c_~#buffer~0.offset| .cse16 (- 4294967296))) c_~value~0)) (< .cse16 2147483648))) .cse18)) (and (not (= .cse8 0)) .cse1)) (or .cse19 (= .cse20 0) .cse21 .cse15 .cse3 .cse22))))) (< .cse20 0))))) (or .cse0 .cse6) (or .cse0 (let ((.cse25 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse14 (< 0 .cse11)) (or .cse18 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse23 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse13 (+ .cse23 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse23 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse24 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse17 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse13 (+ .cse24 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse24 v_z_72) 0))))))) .cse19 .cse25 .cse9 .cse26 .cse21 .cse4 .cse10 .cse22) (or .cse7 (and (or .cse19 .cse25 .cse21 .cse3 .cse4 .cse22) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))))))) is different from false [2024-06-20 15:44:58,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (= |c_#ghost~multithreaded| 1) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (= c_~value~0 3) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-20 15:45:44,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse7 .cse5 .cse6) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-20 15:47:05,017 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse24 (mod c_~buffer_size~0 4294967296)) (.cse21 (mod c_~next~0 4294967296)) (.cse31 (mod c_~first~0 4294967296))) (let ((.cse30 (+ .cse31 1)) (.cse16 (< .cse24 (+ .cse21 1))) (.cse18 (< c_~buffer_size~0 1))) (let ((.cse3 (= (mod c_~send~0 256) 0)) (.cse15 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse1 (or .cse16 .cse18)) (.cse20 (not (= (+ c_~value~0 1) 0))) (.cse17 (< .cse24 .cse30)) (.cse23 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse22 (< .cse21 1)) (.cse28 (= (mod c_~receive~0 256) 0))) (let ((.cse14 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse24) 1)) (.cse4 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse7 (not .cse28)) (.cse8 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse10 (< (+ c_~value~0 2147483648) 0)) (.cse11 (< 2147483647 c_~value~0)) (.cse12 (and (or (and (<= 1 .cse21) (<= .cse30 .cse24)) .cse20) (or .cse17 (and (or (< 2147483647 .cse31) (not (= c_~value~0 (select .cse23 (+ |c_~#buffer~0.offset| .cse31))))) (or (not (= (select .cse23 (+ |c_~#buffer~0.offset| .cse31 (- 4294967296))) c_~value~0)) (< .cse31 2147483648))) .cse22))) (.cse13 (and (not (= .cse29 0)) .cse1)) (.cse19 (< .cse15 0)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse9 (< 0 .cse29)) (.cse5 (not .cse3)) (.cse6 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (let ((.cse2 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1))) (or (and .cse1 (not (= .cse2 0))) .cse3 .cse4 (< 0 .cse2))) (or .cse5 .cse6)) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse0 (and (or .cse7 .cse5 .cse6 .cse8) (or .cse9 (and (or .cse10 .cse5 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse11 .cse12 .cse13) (or .cse14 (= .cse15 0) .cse16 .cse17 .cse3 .cse18)) .cse19))) (or .cse0 .cse6) (or .cse0 (let ((.cse27 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)))) (and (or (and (or .cse20 (< 0 .cse21)) (or .cse22 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse25 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse24 (+ .cse25 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse25 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse26 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse23 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse24 (+ .cse26 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse26 v_z_72) 0))))))) .cse14 .cse27 .cse10 .cse28 .cse16 .cse4 .cse11 .cse18) (or .cse7 (and (or .cse14 .cse27 .cse16 .cse3 .cse4 .cse18) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse5 .cse6)))))) (or .cse0 (and (or .cse7 (and (or .cse5 .cse6 .cse8) (or .cse3 .cse13 .cse9 .cse19))) (or .cse10 .cse28 .cse11 .cse12 .cse13 .cse9 .cse19))) (or .cse0 (and (or .cse3 .cse9) (or .cse5 (< 5 |c_t1Thread1of1ForFork0_~i~0#1|) .cse6)))))))) is different from false [2024-06-20 15:47:53,796 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (= (mod c_~send~0 256) 0)) (.cse23 (= (mod c_~receive~0 256) 0)) (.cse9 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse10 (not (= (+ c_~value~0 1) 0))) (.cse14 (< .cse7 1)) (.cse13 (select |c_#memory_int#2| |c_~#buffer~0.base|)) (.cse5 (< (+ c_~value~0 2147483648) 0)) (.cse6 (< 2147483647 c_~value~0)) (.cse17 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse9) 1)) (.cse15 (< .cse9 (+ .cse7 1))) (.cse16 (< c_~buffer_size~0 1)) (.cse1 (not .cse23)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse2 (not .cse19)) (.cse3 (and (<= c_~value~0 6) (<= 0 c_~value~0)))) (and (or .cse0 (and (or .cse1 .cse2 .cse3 (< 4 |c_t1Thread1of1ForFork0_~i~0#1|)) (let ((.cse4 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse18 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 0 .cse4) (let ((.cse12 (mod c_~first~0 4294967296))) (let ((.cse8 (+ .cse12 1))) (let ((.cse11 (< .cse9 .cse8))) (and (or .cse5 .cse2 (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse6 (and (or (and (<= 1 .cse7) (<= .cse8 .cse9)) .cse10) (or .cse11 (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)) (and (not (= .cse4 0)) (or .cse15 .cse16))) (or .cse17 (= .cse18 0) .cse15 .cse11 .cse19 .cse16))))) (< .cse18 0))))) (or .cse0 (let ((.cse22 (< 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse24 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0))) (and (or (and (or .cse10 (< 0 .cse7)) (or .cse14 (and (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse20 (* v_y_72 4294967296))) (or (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| v_z_72 (- 4294967297))))) (< .cse9 (+ .cse20 v_z_72 1)) (< v_z_72 2147483649) (< 4294967295 v_z_72) (< (+ .cse20 v_z_72) 0)))) (forall ((|~#buffer~0.offset| Int) (v_z_72 Int) (v_y_72 Int)) (let ((.cse21 (* v_y_72 4294967296))) (or (< v_z_72 0) (not (= c_~value~0 (select .cse13 (+ |~#buffer~0.offset| (- 1) v_z_72)))) (= v_z_72 0) (< .cse9 (+ .cse21 v_z_72 1)) (< 2147483648 v_z_72) (< (+ .cse21 v_z_72) 0))))))) .cse17 .cse22 .cse5 .cse23 .cse15 .cse24 .cse6 .cse16) (or .cse1 (and (or .cse17 .cse22 .cse15 .cse19 .cse24 .cse16) (or (< 3 |c_t1Thread1of1ForFork0_~i~0#1|) .cse2 .cse3)))))) (or .cse1 .cse0 .cse2 .cse3)))) is different from false [2024-06-20 15:48:03,826 INFO L124 PetriNetUnfolderBase]: 72656/131298 cut-off events. [2024-06-20 15:48:03,826 INFO L125 PetriNetUnfolderBase]: For 1941846/1941882 co-relation queries the response was YES. [2024-06-20 15:48:05,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 948372 conditions, 131298 events. 72656/131298 cut-off events. For 1941846/1941882 co-relation queries the response was YES. Maximal size of possible extension queue 3560. Compared 1282082 event pairs, 10938 based on Foata normal form. 826/132121 useless extension candidates. Maximal degree in co-relation 947530. Up to 70422 conditions per place. [2024-06-20 15:48:06,625 INFO L140 encePairwiseOnDemand]: 14/29 looper letters, 2680 selfloop transitions, 2972 changer transitions 126/5779 dead transitions. [2024-06-20 15:48:06,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 5779 transitions, 88309 flow [2024-06-20 15:48:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2024-06-20 15:48:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2024-06-20 15:48:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 1395 transitions. [2024-06-20 15:48:06,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41468489892984545 [2024-06-20 15:48:06,631 INFO L175 Difference]: Start difference. First operand has 233 places, 969 transitions, 12170 flow. Second operand 116 states and 1395 transitions. [2024-06-20 15:48:06,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 5779 transitions, 88309 flow [2024-06-20 15:48:39,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 5779 transitions, 71367 flow, removed 8461 selfloop flow, removed 5 redundant places. [2024-06-20 15:48:39,955 INFO L231 Difference]: Finished difference. Result has 427 places, 4158 transitions, 58280 flow [2024-06-20 15:48:39,956 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9759, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=964, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=571, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=116, PETRI_FLOW=58280, PETRI_PLACES=427, PETRI_TRANSITIONS=4158} [2024-06-20 15:48:39,957 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 397 predicate places. [2024-06-20 15:48:39,957 INFO L495 AbstractCegarLoop]: Abstraction has has 427 places, 4158 transitions, 58280 flow [2024-06-20 15:48:39,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 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 15:48:39,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 15:48:39,958 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 15:48:39,970 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 15:48:40,166 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 15:48:40,167 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 15:48:40,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 15:48:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash -229374417, now seen corresponding path program 3 times [2024-06-20 15:48:40,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 15:48:40,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652384659] [2024-06-20 15:48:40,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 15:48:40,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 15:48:40,198 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-20 15:48:40,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1415627556] [2024-06-20 15:48:40,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-20 15:48:40,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-20 15:48:40,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 15:48:40,201 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 15:48:40,202 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 15:48:40,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-06-20 15:48:40,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-20 15:48:40,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2024-06-20 15:48:40,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-20 15:48:41,000 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 15:48:41,005 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 15:48:41,045 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 15:48:42,022 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 53 treesize of output 40 [2024-06-20 15:48:42,028 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 12 treesize of output 3 [2024-06-20 15:48:42,039 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 15:48:42,049 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 15:48:42,058 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 15:48:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:48:47,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-20 15:48:50,499 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 15:48:50,516 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 15:48:52,925 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 15:48:52,939 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 15:48:55,296 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 15:48:55,316 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 15:49:00,910 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 15:49:01,076 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 15:49:03,438 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-20 15:49:03,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 15:49:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652384659] [2024-06-20 15:49:03,439 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-20 15:49:03,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415627556] [2024-06-20 15:49:03,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415627556] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-20 15:49:03,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-20 15:49:03,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2024-06-20 15:49:03,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080216199] [2024-06-20 15:49:03,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-20 15:49:03,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-06-20 15:49:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 15:49:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-06-20 15:49:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=494, Unknown=0, NotChecked=0, Total=650 [2024-06-20 15:49:04,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-06-20 15:49:04,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 4158 transitions, 58280 flow. Second operand has 26 states, 26 states have (on average 8.615384615384615) internal successors, (224), 26 states have internal predecessors, (224), 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 15:49:04,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 15:49:04,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-06-20 15:49:04,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 15:49:21,049 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]