./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-inc-subseq.wvr.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-inc-subseq.wvr.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:07:28,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:07:28,927 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:07:28,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:07:28,931 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:07:28,944 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:07:28,945 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:07:28,945 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:07:28,945 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:07:28,946 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:07:28,946 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:07:28,946 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:07:28,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:07:28,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:07:28,947 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:07:28,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:07:28,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:07:28,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:07:28,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:07:28,949 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:07:28,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:07:28,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:07:28,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:07:28,950 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:07:28,950 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:07:28,950 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:07:28,950 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:07:28,950 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:07:28,951 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:07:28,951 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:07:28,951 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:07:28,951 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:07:28,952 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:28,952 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:07:28,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:07:28,952 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:07:28,952 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:07:28,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:07:28,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:07:28,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:07:28,953 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:07:28,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:07:28,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:07:28,954 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 [2024-06-28 01:07:29,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:07:29,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:07:29,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:07:29,142 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:07:29,143 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:07:29,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-28 01:07:30,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:07:30,272 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:07:30,273 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-28 01:07:30,279 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a296f57e/83a976a9ba314343b621f3e4fa529568/FLAG0f3e50e4d [2024-06-28 01:07:30,290 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a296f57e/83a976a9ba314343b621f3e4fa529568 [2024-06-28 01:07:30,292 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:07:30,293 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:07:30,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-06-28 01:07:30,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:07:30,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:07:30,349 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:30,349 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:07:30,353 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:07:30,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:30" (1/2) ... [2024-06-28 01:07:30,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7e507f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:30, skipping insertion in model container [2024-06-28 01:07:30,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:07:30" (1/2) ... [2024-06-28 01:07:30,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@400d04c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:07:30, skipping insertion in model container [2024-06-28 01:07:30,356 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:30" (2/2) ... [2024-06-28 01:07:30,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7e507f and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30, skipping insertion in model container [2024-06-28 01:07:30,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:30" (2/2) ... [2024-06-28 01:07:30,356 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:07:30,371 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:07:30,372 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:07:30,372 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:07:30,372 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:07:30,373 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-28 01:07:30,392 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:07:30,547 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-28 01:07:30,553 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:30,559 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:07:30,603 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-28 01:07:30,605 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:07:30,618 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:07:30,618 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30 WrapperNode [2024-06-28 01:07:30,619 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:07:30,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:30,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:07:30,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:07:30,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,658 INFO L138 Inliner]: procedures = 23, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 192 [2024-06-28 01:07:30,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:07:30,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:07:30,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:07:30,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:07:30,667 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,683 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-28 01:07:30,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:07:30,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:07:30,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:07:30,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:07:30,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (1/1) ... [2024-06-28 01:07:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:07:30,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:30,721 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-28 01:07:30,727 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-28 01:07:30,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:07:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:07:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:07:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:07:30,750 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:07:30,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:07:30,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-28 01:07:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-28 01:07:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-28 01:07:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:07:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:07:30,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:07:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:07:30,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:07:30,753 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-28 01:07:30,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-28 01:07:30,757 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:07:30,840 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:07:30,841 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:07:31,132 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:07:31,132 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:07:31,351 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:07:31,351 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 01:07:31,352 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:31 BoogieIcfgContainer [2024-06-28 01:07:31,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:07:31,353 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:07:31,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:07:31,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:07:31,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:07:30" (1/4) ... [2024-06-28 01:07:31,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e07e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:07:31, skipping insertion in model container [2024-06-28 01:07:31,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:07:30" (2/4) ... [2024-06-28 01:07:31,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e07e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:07:31, skipping insertion in model container [2024-06-28 01:07:31,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:07:30" (3/4) ... [2024-06-28 01:07:31,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a0e07e3 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:07:31, skipping insertion in model container [2024-06-28 01:07:31,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:07:31" (4/4) ... [2024-06-28 01:07:31,358 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-06-28 01:07:31,372 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:07:31,373 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:07:31,373 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:07:31,415 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 01:07:31,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:07:31,483 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-06-28 01:07:31,483 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 01:07:31,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-28 01:07:31,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:07:31,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2024-06-28 01:07:31,509 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:07:31,519 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;@3d7e53a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:07:31,520 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:07:31,526 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:07:31,526 INFO L124 PetriNetUnfolderBase]: 2/11 cut-off events. [2024-06-28 01:07:31,526 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:07:31,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:31,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:31,527 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:31,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:31,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1746555899, now seen corresponding path program 1 times [2024-06-28 01:07:31,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:31,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813881079] [2024-06-28 01:07:31,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:31,799 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-28 01:07:31,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:31,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813881079] [2024-06-28 01:07:31,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813881079] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:31,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:31,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:07:31,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665302034] [2024-06-28 01:07:31,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:31,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:31,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:31,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:31,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:31,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:31,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:31,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:31,982 INFO L124 PetriNetUnfolderBase]: 287/517 cut-off events. [2024-06-28 01:07:31,983 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-28 01:07:31,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 287/517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2366 event pairs, 96 based on Foata normal form. 24/450 useless extension candidates. Maximal degree in co-relation 939. Up to 285 conditions per place. [2024-06-28 01:07:31,991 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-06-28 01:07:31,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 205 flow [2024-06-28 01:07:31,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:31,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-28 01:07:32,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-28 01:07:32,001 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 74 transitions. [2024-06-28 01:07:32,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 205 flow [2024-06-28 01:07:32,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:07:32,006 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 84 flow [2024-06-28 01:07:32,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-06-28 01:07:32,010 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:07:32,011 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 84 flow [2024-06-28 01:07:32,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:07:32,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:07:32,012 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:32,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1523712316, now seen corresponding path program 1 times [2024-06-28 01:07:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051453332] [2024-06-28 01:07:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:32,087 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-28 01:07:32,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051453332] [2024-06-28 01:07:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051453332] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:32,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838862996] [2024-06-28 01:07:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:32,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:32,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:32,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:32,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:32,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:32,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-28 01:07:32,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:32,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:32,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:32,245 INFO L124 PetriNetUnfolderBase]: 222/422 cut-off events. [2024-06-28 01:07:32,246 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-06-28 01:07:32,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 837 conditions, 422 events. 222/422 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1963 event pairs, 71 based on Foata normal form. 30/379 useless extension candidates. Maximal degree in co-relation 412. Up to 189 conditions per place. [2024-06-28 01:07:32,249 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 38 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-06-28 01:07:32,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 191 flow [2024-06-28 01:07:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-06-28 01:07:32,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5694444444444444 [2024-06-28 01:07:32,252 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 84 flow. Second operand 4 states and 82 transitions. [2024-06-28 01:07:32,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 191 flow [2024-06-28 01:07:32,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 189 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:32,255 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 78 flow [2024-06-28 01:07:32,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2024-06-28 01:07:32,257 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:07:32,258 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 78 flow [2024-06-28 01:07:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-28 01:07:32,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:07:32,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:32,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1499540965, now seen corresponding path program 1 times [2024-06-28 01:07:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332582812] [2024-06-28 01:07:32,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:32,381 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-28 01:07:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332582812] [2024-06-28 01:07:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332582812] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:32,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:32,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446909342] [2024-06-28 01:07:32,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:32,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:32,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:32,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:32,392 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:07:32,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-28 01:07:32,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:32,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:07:32,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:32,515 INFO L124 PetriNetUnfolderBase]: 201/373 cut-off events. [2024-06-28 01:07:32,515 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-06-28 01:07:32,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 373 events. 201/373 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1580 event pairs, 55 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 325. Up to 190 conditions per place. [2024-06-28 01:07:32,517 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2024-06-28 01:07:32,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 175 flow [2024-06-28 01:07:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:07:32,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:07:32,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2024-06-28 01:07:32,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5347222222222222 [2024-06-28 01:07:32,534 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 78 flow. Second operand 4 states and 77 transitions. [2024-06-28 01:07:32,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 175 flow [2024-06-28 01:07:32,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:07:32,535 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 85 flow [2024-06-28 01:07:32,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2024-06-28 01:07:32,536 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-28 01:07:32,536 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 85 flow [2024-06-28 01:07:32,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-28 01:07:32,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:07:32,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:32,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1780392980, now seen corresponding path program 1 times [2024-06-28 01:07:32,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015249609] [2024-06-28 01:07:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:32,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:32,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015249609] [2024-06-28 01:07:32,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015249609] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:32,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:32,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228697062] [2024-06-28 01:07:32,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:32,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:32,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:32,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:32,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:32,687 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:32,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-28 01:07:32,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:32,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:32,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:32,742 INFO L124 PetriNetUnfolderBase]: 213/425 cut-off events. [2024-06-28 01:07:32,743 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2024-06-28 01:07:32,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 851 conditions, 425 events. 213/425 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1925 event pairs, 136 based on Foata normal form. 1/378 useless extension candidates. Maximal degree in co-relation 328. Up to 340 conditions per place. [2024-06-28 01:07:32,745 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 23 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2024-06-28 01:07:32,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 137 flow [2024-06-28 01:07:32,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-28 01:07:32,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-28 01:07:32,750 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 85 flow. Second operand 3 states and 61 transitions. [2024-06-28 01:07:32,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 137 flow [2024-06-28 01:07:32,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 33 transitions, 131 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:32,752 INFO L231 Difference]: Finished difference. Result has 36 places, 33 transitions, 91 flow [2024-06-28 01:07:32,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=36, PETRI_TRANSITIONS=33} [2024-06-28 01:07:32,754 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2024-06-28 01:07:32,755 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 33 transitions, 91 flow [2024-06-28 01:07:32,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-28 01:07:32,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:07:32,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:32,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1409768404, now seen corresponding path program 1 times [2024-06-28 01:07:32,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816919569] [2024-06-28 01:07:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816919569] [2024-06-28 01:07:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816919569] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:32,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:32,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:32,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750166010] [2024-06-28 01:07:32,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:32,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:32,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:32,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:32,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:32,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:32,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 33 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-28 01:07:32,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:32,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:32,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:32,944 INFO L124 PetriNetUnfolderBase]: 270/539 cut-off events. [2024-06-28 01:07:32,944 INFO L125 PetriNetUnfolderBase]: For 37/40 co-relation queries the response was YES. [2024-06-28 01:07:32,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 539 events. 270/539 cut-off events. For 37/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2510 event pairs, 104 based on Foata normal form. 1/486 useless extension candidates. Maximal degree in co-relation 1069. Up to 240 conditions per place. [2024-06-28 01:07:32,946 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 35 selfloop transitions, 2 changer transitions 2/47 dead transitions. [2024-06-28 01:07:32,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 207 flow [2024-06-28 01:07:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:07:32,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:07:32,948 INFO L175 Difference]: Start difference. First operand has 36 places, 33 transitions, 91 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:07:32,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 207 flow [2024-06-28 01:07:32,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 203 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:32,949 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 99 flow [2024-06-28 01:07:32,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2024-06-28 01:07:32,950 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-28 01:07:32,950 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 99 flow [2024-06-28 01:07:32,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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-28 01:07:32,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:32,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:32,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:07:32,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:32,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1983940103, now seen corresponding path program 1 times [2024-06-28 01:07:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:32,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657518469] [2024-06-28 01:07:32,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:32,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:32,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:33,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:33,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657518469] [2024-06-28 01:07:33,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657518469] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:33,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:33,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:07:33,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189694393] [2024-06-28 01:07:33,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:07:33,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:33,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:07:33,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:07:33,030 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:33,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 99 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-28 01:07:33,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:33,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:33,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:33,108 INFO L124 PetriNetUnfolderBase]: 270/534 cut-off events. [2024-06-28 01:07:33,108 INFO L125 PetriNetUnfolderBase]: For 45/47 co-relation queries the response was YES. [2024-06-28 01:07:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 534 events. 270/534 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2437 event pairs, 110 based on Foata normal form. 7/498 useless extension candidates. Maximal degree in co-relation 1171. Up to 333 conditions per place. [2024-06-28 01:07:33,111 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 34 selfloop transitions, 2 changer transitions 4/48 dead transitions. [2024-06-28 01:07:33,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 218 flow [2024-06-28 01:07:33,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:07:33,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:07:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:07:33,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:07:33,113 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 99 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:07:33,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 218 flow [2024-06-28 01:07:33,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:33,114 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 109 flow [2024-06-28 01:07:33,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2024-06-28 01:07:33,115 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-06-28 01:07:33,115 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 109 flow [2024-06-28 01:07:33,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-28 01:07:33,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:33,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:33,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:07:33,116 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:33,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:33,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1499428828, now seen corresponding path program 1 times [2024-06-28 01:07:33,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:33,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791565547] [2024-06-28 01:07:33,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:33,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:33,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:33,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:33,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:33,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791565547] [2024-06-28 01:07:33,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791565547] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:07:33,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:07:33,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:07:33,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28849700] [2024-06-28 01:07:33,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:07:33,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:07:33,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:33,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:07:33,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:07:33,209 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:07:33,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-28 01:07:33,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:33,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:07:33,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:33,299 INFO L124 PetriNetUnfolderBase]: 336/705 cut-off events. [2024-06-28 01:07:33,300 INFO L125 PetriNetUnfolderBase]: For 104/108 co-relation queries the response was YES. [2024-06-28 01:07:33,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 705 events. 336/705 cut-off events. For 104/108 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3643 event pairs, 272 based on Foata normal form. 14/659 useless extension candidates. Maximal degree in co-relation 1236. Up to 470 conditions per place. [2024-06-28 01:07:33,303 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 26 selfloop transitions, 2 changer transitions 18/54 dead transitions. [2024-06-28 01:07:33,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 259 flow [2024-06-28 01:07:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:07:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:07:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-06-28 01:07:33,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5611111111111111 [2024-06-28 01:07:33,304 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 109 flow. Second operand 5 states and 101 transitions. [2024-06-28 01:07:33,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 259 flow [2024-06-28 01:07:33,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:07:33,306 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 123 flow [2024-06-28 01:07:33,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2024-06-28 01:07:33,306 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2024-06-28 01:07:33,306 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 123 flow [2024-06-28 01:07:33,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-28 01:07:33,307 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:33,307 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:33,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:07:33,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:33,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1842536997, now seen corresponding path program 1 times [2024-06-28 01:07:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:33,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535379903] [2024-06-28 01:07:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:34,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:34,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535379903] [2024-06-28 01:07:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535379903] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106868672] [2024-06-28 01:07:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:34,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:34,063 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-28 01:07:34,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-28 01:07:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:34,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 34 conjunts are in the unsatisfiable core [2024-06-28 01:07:34,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:34,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-06-28 01:07:34,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-06-28 01:07:34,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-06-28 01:07:34,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-06-28 01:07:34,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-28 01:07:34,612 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-06-28 01:07:34,612 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 34 treesize of output 10 [2024-06-28 01:07:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:34,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:35,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:35,468 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 39 [2024-06-28 01:07:35,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:35,481 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 102 treesize of output 90 [2024-06-28 01:07:35,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:35,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 63 [2024-06-28 01:07:35,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:35,558 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 66 [2024-06-28 01:07:35,590 INFO L349 Elim1Store]: treesize reduction 9, result has 80.9 percent of original size [2024-06-28 01:07:35,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 181 [2024-06-28 01:07:35,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-06-28 01:07:35,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:35,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 120 [2024-06-28 01:07:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:07:35,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106868672] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:07:35,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:07:35,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 33 [2024-06-28 01:07:35,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079768589] [2024-06-28 01:07:35,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:07:35,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-06-28 01:07:35,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:35,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-06-28 01:07:35,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=911, Unknown=3, NotChecked=0, Total=1122 [2024-06-28 01:07:35,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-28 01:07:35,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 123 flow. Second operand has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-28 01:07:35,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:07:35,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-28 01:07:35,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:07:36,040 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~end~0 0)) (.cse3 (< c_~n~0 (+ c_~end~0 1))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (<= c_~v_old~0 c_~new~0) (or (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))) (and (or .cse0 .cse1) (or .cse1 (= c_~start~0 c_~end~0)))) .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (= c_~ok~0 1) (or .cse2 .cse3 (and (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53))) (let ((.cse4 (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (.cse5 (select .cse8 c_~queue~0.base))) (or (not (= .cse4 (select .cse5 .cse6))) (< .cse4 (+ (select .cse5 .cse7) 1)))))) (or (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53))) (= (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse9 c_~queue~0.base) .cse6))))) .cse0))) (or .cse2 .cse3 (let ((.cse12 (select |c_#memory_int#1| c_~queue~0.base))) (let ((.cse11 (select .cse12 .cse6))) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse10 (select (select |c_#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse10 .cse11)) (< .cse10 (+ (select .cse12 .cse7) 1))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (not (= (select (select |c_#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) .cse11))) .cse0))))))) is different from false [2024-06-28 01:07:40,568 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~end~0 0)) (.cse3 (< c_~n~0 (+ c_~end~0 1))) (.cse7 (+ (* c_~start~0 4) c_~queue~0.offset)) (.cse0 (not (= (mod c_~ok~0 256) 0))) (.cse6 (+ (* c_~end~0 4) c_~queue~0.offset))) (and (<= c_~v_old~0 c_~new~0) (or (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))) (and (or .cse0 .cse1) (or .cse1 (= c_~start~0 c_~end~0)))) .cse2 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or (< (+ c_~start~0 c_~n~0) 2) (not (= c_~end~0 0)) (< c_~start~0 1)) (or (< c_~end~0 1) (< c_~n~0 2)) (= c_~ok~0 1) (or .cse2 .cse3 (and (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53))) (let ((.cse4 (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (.cse5 (select .cse8 c_~queue~0.base))) (or (not (= .cse4 (select .cse5 .cse6))) (< .cse4 (+ (select .cse5 .cse7) 1)))))) (or (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53))) (= (select (select .cse9 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select .cse9 c_~queue~0.base) .cse6))))) .cse0))) (or .cse2 .cse3 (let ((.cse12 (select |c_#memory_int#1| c_~queue~0.base))) (let ((.cse11 (select .cse12 .cse6))) (and (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (let ((.cse10 (select (select |c_#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (not (= .cse10 .cse11)) (< .cse10 (+ (select .cse12 .cse7) 1))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (not (= (select (select |c_#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) .cse11))) .cse0))))) (= c_~queue~0.offset 0))) is different from false [2024-06-28 01:07:49,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:07:49,595 INFO L124 PetriNetUnfolderBase]: 2935/4821 cut-off events. [2024-06-28 01:07:49,597 INFO L125 PetriNetUnfolderBase]: For 859/859 co-relation queries the response was YES. [2024-06-28 01:07:49,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 4821 events. 2935/4821 cut-off events. For 859/859 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 28110 event pairs, 531 based on Foata normal form. 6/4254 useless extension candidates. Maximal degree in co-relation 11648. Up to 1150 conditions per place. [2024-06-28 01:07:49,615 INFO L140 encePairwiseOnDemand]: 14/36 looper letters, 288 selfloop transitions, 97 changer transitions 111/500 dead transitions. [2024-06-28 01:07:49,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 500 transitions, 2454 flow [2024-06-28 01:07:49,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-06-28 01:07:49,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2024-06-28 01:07:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 811 transitions. [2024-06-28 01:07:49,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40228174603174605 [2024-06-28 01:07:49,619 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 123 flow. Second operand 56 states and 811 transitions. [2024-06-28 01:07:49,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 500 transitions, 2454 flow [2024-06-28 01:07:49,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 500 transitions, 2430 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-28 01:07:49,633 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 997 flow [2024-06-28 01:07:49,633 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=997, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2024-06-28 01:07:49,636 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 101 predicate places. [2024-06-28 01:07:49,636 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 997 flow [2024-06-28 01:07:49,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 8.117647058823529) internal successors, (276), 34 states have internal predecessors, (276), 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-28 01:07:49,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:07:49,637 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:07:49,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-28 01:07:49,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:49,848 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:07:49,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:07:49,848 INFO L85 PathProgramCache]: Analyzing trace with hash 997115622, now seen corresponding path program 2 times [2024-06-28 01:07:49,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:07:49,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409755976] [2024-06-28 01:07:49,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:07:49,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:07:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:07:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:07:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:07:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409755976] [2024-06-28 01:07:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409755976] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:07:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099481610] [2024-06-28 01:07:50,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:07:50,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:07:50,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:07:50,921 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-28 01:07:50,922 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-28 01:07:51,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:07:51,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:07:51,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-28 01:07:51,014 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:07:51,493 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-06-28 01:07:51,494 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 42 treesize of output 10 [2024-06-28 01:07:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:07:51,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:07:55,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:07:55,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 121 [2024-06-28 01:07:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:07:56,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099481610] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:07:56,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:07:56,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 30 [2024-06-28 01:07:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177000226] [2024-06-28 01:07:56,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:07:56,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-06-28 01:07:56,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:07:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-06-28 01:07:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=771, Unknown=1, NotChecked=0, Total=930 [2024-06-28 01:08:00,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:08:04,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=false, quantifiers [1] [2024-06-28 01:08:08,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:08:08,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 36 [2024-06-28 01:08:08,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 997 flow. Second operand has 31 states, 31 states have (on average 8.580645161290322) internal successors, (266), 31 states have internal predecessors, (266), 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-28 01:08:08,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:08,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 36 [2024-06-28 01:08:08,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:13,035 INFO L124 PetriNetUnfolderBase]: 3875/6490 cut-off events. [2024-06-28 01:08:13,036 INFO L125 PetriNetUnfolderBase]: For 75753/75753 co-relation queries the response was YES. [2024-06-28 01:08:13,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37708 conditions, 6490 events. 3875/6490 cut-off events. For 75753/75753 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 40325 event pairs, 343 based on Foata normal form. 51/6253 useless extension candidates. Maximal degree in co-relation 35427. Up to 3469 conditions per place. [2024-06-28 01:08:13,101 INFO L140 encePairwiseOnDemand]: 18/36 looper letters, 248 selfloop transitions, 149 changer transitions 80/481 dead transitions. [2024-06-28 01:08:13,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 481 transitions, 4995 flow [2024-06-28 01:08:13,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-06-28 01:08:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2024-06-28 01:08:13,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 539 transitions. [2024-06-28 01:08:13,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39400584795321636 [2024-06-28 01:08:13,106 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 997 flow. Second operand 38 states and 539 transitions. [2024-06-28 01:08:13,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 481 transitions, 4995 flow [2024-06-28 01:08:13,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 481 transitions, 4351 flow, removed 308 selfloop flow, removed 13 redundant places. [2024-06-28 01:08:13,299 INFO L231 Difference]: Finished difference. Result has 173 places, 239 transitions, 2382 flow [2024-06-28 01:08:13,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2382, PETRI_PLACES=173, PETRI_TRANSITIONS=239} [2024-06-28 01:08:13,300 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 138 predicate places. [2024-06-28 01:08:13,300 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 239 transitions, 2382 flow [2024-06-28 01:08:13,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 8.580645161290322) internal successors, (266), 31 states have internal predecessors, (266), 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-28 01:08:13,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:13,301 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:13,320 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-28 01:08:13,512 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,SelfDestructingSolverStorable8 [2024-06-28 01:08:13,513 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:13,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1823941660, now seen corresponding path program 3 times [2024-06-28 01:08:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326978490] [2024-06-28 01:08:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:08:13,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:13,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326978490] [2024-06-28 01:08:13,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326978490] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459550278] [2024-06-28 01:08:13,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:08:13,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:13,577 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-28 01:08:13,578 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-28 01:08:13,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-28 01:08:13,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:13,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:08:13,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:13,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:08:13,801 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:14,010 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:08:14,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459550278] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:14,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:14,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 13 [2024-06-28 01:08:14,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165897330] [2024-06-28 01:08:14,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:14,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:08:14,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:14,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:08:14,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:08:14,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:08:14,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 239 transitions, 2382 flow. Second operand has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-28 01:08:14,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:14,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:08:14,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:14,770 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([540] L49-5-->L59: Formula: (= v_~i~0_29 (+ v_~i~0_30 1)) InVars {~i~0=v_~i~0_30} OutVars{thread1Thread1of1ForFork0_#t~post6#1=|v_thread1Thread1of1ForFork0_#t~post6#1_1|, ~i~0=v_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post6#1, ~i~0][121], [60#(and (<= 1 ~ok~0) (<= (div ~ok~0 256) 0)), Black: 304#(and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) 0)) (or (not (= ~end~0 0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))) (or (not (= ~end~0 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (= ~start~0 0) (or (< ~n~0 2) (< ~end~0 1)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1) (exists ((v_subst_19 Int) (v_subst_21 Int) (v_subst_20 Int)) (= (select (select |#memory_int#1| ~queue~0.base) 0) (select (select |#memory_int#1| v_subst_21) (+ (* v_subst_20 4) v_subst_19))))), Black: 300#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 366#(and (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (< ~end~0 0) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)))))) (< ~n~0 (+ ~end~0 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 348#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_89 Int) (v_subst_90 Int) (v_ArrVal_53 (Array Int Int)) (v_subst_88 Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_90) (+ (* v_subst_89 4) v_subst_88)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_90) (+ (* v_subst_89 4) v_subst_88))))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_91 Int) (v_subst_93 Int) (v_subst_92 Int)) (or (< (select (select |#memory_int#1| v_subst_93) (+ (* v_subst_92 4) v_subst_91)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| v_subst_93) (+ (* v_subst_92 4) v_subst_91)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (or (forall ((v_subst_87 Int) (v_subst_86 Int) (v_subst_85 Int)) (or (< (select (select |#memory_int#1| v_subst_87) (+ v_subst_85 (* v_subst_86 4))) ~last~0) (not (= (select (select |#memory_int#1| v_subst_87) (+ v_subst_85 (* v_subst_86 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 354#(and (or (forall ((v_subst_99 Int) (v_subst_98 Int) (v_subst_97 Int)) (or (< (select (select |#memory_int#1| v_subst_99) (+ v_subst_97 (* v_subst_98 4))) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| v_subst_99) (+ v_subst_97 (* v_subst_98 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_105 Int) (v_subst_104 Int) (v_subst_103 Int)) (or (< (select (select |#memory_int#1| v_subst_105) (+ (* 4 v_subst_104) v_subst_103)) ~last~0) (not (= (select (select |#memory_int#1| v_subst_105) (+ (* 4 v_subst_104) v_subst_103)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_102 Int) (v_subst_101 Int) (v_subst_100 Int) (v_ArrVal_53 (Array Int Int))) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_102) (+ (* 4 v_subst_101) v_subst_100)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_102) (+ (* 4 v_subst_101) v_subst_100))))))) (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 296#(and (= ~start~0 ~end~0) (or (not (= ~end~0 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= ~n~0 1) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 270#(or (and (or (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))), Black: 358#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_114 Int) (v_subst_113 Int) (v_subst_112 Int) (v_ArrVal_53 (Array Int Int))) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_114) (+ (* 4 v_subst_113) v_subst_112)))) (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_114) (+ (* 4 v_subst_113) v_subst_112)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1))))) (or (< ~end~0 0) (forall ((v_subst_111 Int) (v_subst_110 Int) (v_subst_109 Int)) (or (not (= (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)) (select (select |#memory_int#1| v_subst_111) (+ (* 4 v_subst_110) v_subst_109)))) (< (select (select |#memory_int#1| v_subst_111) (+ (* 4 v_subst_110) v_subst_109)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)))) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (forall ((v_subst_108 Int) (v_subst_107 Int) (v_subst_106 Int)) (or (< (select (select |#memory_int#1| v_subst_108) (+ v_subst_106 (* 4 v_subst_107))) ~last~0) (not (= (select (select |#memory_int#1| v_subst_108) (+ v_subst_106 (* 4 v_subst_107))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (not (= ~end~0 0)) (and (or (< ~start~0 1) (< (+ ~start~0 ~n~0) 2)) (or (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (not (= ~start~0 0))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 368#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_127 Int) (v_subst_129 Int) (v_subst_128 Int)) (or (not (= (select (select |#memory_int#1| v_subst_129) (+ (* 4 v_subst_128) v_subst_127)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| v_subst_129) (+ (* 4 v_subst_128) v_subst_127)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))))) (or (< ~end~0 0) (forall ((v_subst_126 Int) (v_subst_125 Int) (v_subst_124 Int) (v_ArrVal_53 (Array Int Int))) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_126) (+ (* 4 v_subst_125) v_subst_124)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_126) (+ (* 4 v_subst_125) v_subst_124)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)))))) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (forall ((v_subst_123 Int) (v_subst_122 Int) (v_subst_121 Int)) (or (not (= (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)) (select (select |#memory_int#1| v_subst_123) (+ (* 4 v_subst_122) v_subst_121)))) (< (select (select |#memory_int#1| v_subst_123) (+ (* 4 v_subst_122) v_subst_121)) ~last~0))) (< ~n~0 (+ ~end~0 1)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 298#(and (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_9 Int) (v_subst_8 Int) (v_subst_7 Int)) (or (not (= (select (select |#memory_int#1| v_subst_9) (+ (* 4 v_subst_8) v_subst_7)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| v_subst_9) (+ (* 4 v_subst_8) v_subst_7)) ~last~0)))) (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1)) (< |thread1Thread1of1ForFork0_#t~mem1#1| ~last~0) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0))) (or (< ~end~0 0) (and (or (forall ((v_subst_3 Int) (v_subst_2 Int) (v_subst_1 Int)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int#1| v_subst_3) (+ (* 4 v_subst_2) v_subst_1))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_subst_6 Int) (v_subst_5 Int) (v_subst_4 Int)) (or (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int#1| v_subst_6) (+ (* 4 v_subst_5) v_subst_4)))) (< (select (select |#memory_int#1| v_subst_6) (+ (* 4 v_subst_5) v_subst_4)) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (< ~n~0 (+ ~end~0 1)))), Black: 362#(and (or (< ~end~0 0) (forall ((v_subst_116 Int) (v_subst_115 Int) (v_ArrVal_53 (Array Int Int)) (v_subst_117 Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_117) (+ (* 4 v_subst_116) v_subst_115)))) (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_117) (+ (* 4 v_subst_116) v_subst_115)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)))) (< ~n~0 (+ ~end~0 1))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (not (= ~end~0 0)) (and (or (< ~start~0 1) (< (+ ~start~0 ~n~0) 2)) (or (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (not (= ~start~0 0))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_120 Int) (v_subst_119 Int) (v_subst_118 Int)) (or (not (= (select (select |#memory_int#1| v_subst_120) (+ (* 4 v_subst_119) v_subst_118)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| v_subst_120) (+ (* 4 v_subst_119) v_subst_118)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 328#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< ~end~0 0) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1))) (not (= (mod ~ok~0 256) 0))), Black: 320#(and (or (and (or (forall ((v_subst_37 Int) (v_subst_39 Int) (v_subst_38 Int)) (not (= (select (select |#memory_int#1| v_subst_39) (+ v_subst_37 (* v_subst_38 4))) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_subst_36 Int) (v_subst_35 Int) (v_subst_34 Int)) (or (< (select (select |#memory_int#1| v_subst_36) (+ (* v_subst_35 4) v_subst_34)) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select |#memory_int#1| v_subst_36) (+ (* v_subst_35 4) v_subst_34)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_40 Int) (v_subst_42 Int) (v_subst_41 Int)) (or (not (= (select (select |#memory_int#1| v_subst_42) (+ (* v_subst_41 4) v_subst_40)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| v_subst_42) (+ (* v_subst_41 4) v_subst_40)) ~last~0)))) (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1)) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0))) (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1)))), Black: 344#(and (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (< ~end~0 0) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)))))) (< ~n~0 (+ ~end~0 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0)))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))))), Black: 306#(and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) 0)) (exists ((v_subst_24 Int) (v_subst_23 Int) (v_subst_22 Int)) (= (select (select |#memory_int#1| ~queue~0.base) 0) (select (select |#memory_int#1| v_subst_24) (+ (* v_subst_23 4) v_subst_22)))) (or (not (= ~end~0 0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1))) (= ~start~0 0) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 364#(and (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (< ~end~0 0) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)))))) (< ~n~0 (+ ~end~0 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0)))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))))), Black: 310#(and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) 0)) (= ~start~0 0) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (= (select (select |#memory_int#1| ~queue~0.base) 0) (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (= ~ok~0 1)), Black: 346#(and (or (and (or (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))))))) (or (and (or (= ~start~0 ~end~0) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0)))) (or (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))) (not (= (mod ~ok~0 256) 0)))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), 647#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))))) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 334#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_69 Int) (v_subst_68 Int) (v_subst_67 Int)) (or (not (= (select (select |#memory_int#1| v_subst_69) (+ v_subst_67 (* v_subst_68 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| v_subst_69) (+ v_subst_67 (* v_subst_68 4))) ~last~0))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (not (= ~end~0 0)) (and (or (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (not (= ~start~0 0))) (or (< ~start~0 1) (< (+ ~start~0 ~n~0) 2)))) (or (not (= ~end~0 0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (not (= ~start~0 0))) (or (< ~n~0 2) (< ~end~0 1)) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_62 Int) (v_subst_61 Int) (v_subst_63 Int)) (or (< (select (select |#memory_int#1| v_subst_63) (+ (* v_subst_62 4) v_subst_61)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| v_subst_63) (+ (* v_subst_62 4) v_subst_61)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0)))) (or (< ~end~0 0) (forall ((v_ArrVal_53 (Array Int Int)) (v_subst_66 Int) (v_subst_65 Int) (v_subst_64 Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_66) (+ (* v_subst_65 4) v_subst_64)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_66) (+ (* v_subst_65 4) v_subst_64)))))) (< ~n~0 (+ ~end~0 1)))), Black: 332#(and (or (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (< ~end~0 0) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1))) (not (= (mod ~ok~0 256) 0))), Black: 294#(and (or (and (or (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (or (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) ~last~0))) (< ~n~0 (+ ~end~0 1)))), 48#(<= 1 ~i~0), Black: 340#(and (or (< ~end~0 0) (forall ((v_subst_79 Int) (v_subst_80 Int) (v_ArrVal_53 (Array Int Int)) (v_subst_81 Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_81) (+ v_subst_79 (* v_subst_80 4))) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_81) (+ v_subst_79 (* v_subst_80 4))))))) (< ~n~0 (+ ~end~0 1))) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_84 Int) (v_subst_83 Int) (v_subst_82 Int)) (or (< (select (select |#memory_int#1| v_subst_84) (+ v_subst_82 (* v_subst_83 4))) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| v_subst_84) (+ v_subst_82 (* v_subst_83 4))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4))))))) (<= ~v_old~0 ~new~0) (or (not (= ~end~0 0)) (and (or (< ~start~0 1) (< (+ ~start~0 ~n~0) 2)) (or (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (not (= ~start~0 0))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 342#(and (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (< ~end~0 0) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)))))) (< ~n~0 (+ ~end~0 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), 26#L70true, 14#L103-1true, Black: 649#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), 6#L59true, Black: 579#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~N~0 (+ ~i~0 1)) (and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (not (= (mod ~ok~0 256) 0)))), Black: 673#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~N~0 (+ ~i~0 1)) (and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0))) (exists ((~A~0.offset Int) (v_subst_142 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_142)))) (= (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_142))) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 477#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 492#(and (exists ((~A~0.offset Int) (~i~0 Int) (~A~0.base Int)) (and (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))))) (= ~ok~0 1)), Black: 43#(= ~i~0 0), Black: 651#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= ~ok~0 1)), Black: 655#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1) (or (and (or (not (= ~end~0 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< ~end~0 1))) (< ~n~0 (+ ~end~0 1)))), Black: 671#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~N~0 (+ ~i~0 1)) (and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0))) (= ~queue~0.offset 0) (exists ((~A~0.offset Int) (v_subst_141 Int) (~A~0.base Int)) (and (= (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_141)))) (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ ~A~0.offset (* 4 v_subst_141)))))) (= ~ok~0 1)), Black: 675#(and (<= ~v_old~0 ~new~0) (or (< ~N~0 (+ ~i~0 1)) (and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0))) (= ~ok~0 1)), Black: 467#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (or (and (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0)) (and (= |thread2Thread1of1ForFork1_~cond~0#1| 0) (<= ~N~0 ~i~0))) (= ~ok~0 1)), Black: 643#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 499#(and (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 665#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 52#(and (= ~i~0 0) (<= 1 ~N~0)), Black: 657#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 667#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 677#(and (or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~N~0 (+ ~i~0 1)) (and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0))) (<= ~v_old~0 ~new~0) (= ~ok~0 1)), Black: 445#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= ~ok~0 1)), Black: 56#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 659#(and (= ~start~0 ~end~0) (<= ~v_old~0 (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (= ~last~0 ~v_old~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (= ~queue~0.offset 0) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 413#true, Black: 641#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1) (or (and (or (not (= ~end~0 0)) (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (< ~end~0 1))) (< ~n~0 (+ ~end~0 1)))), Black: 635#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (= ~ok~0 1)), Black: 663#(and (= ~start~0 ~end~0) (<= ~v_old~0 ~last~0) (= |thread2Thread1of1ForFork1_~cond~0#1| 1) (<= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset))) (<= (+ ~i~0 1) ~N~0) (= ~ok~0 1)), Black: 64#(<= ~end~0 ~start~0), 706#(<= ~end~0 (+ ~start~0 1)), 75#true, Black: 338#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_ArrVal_53 (Array Int Int)) (v_subst_73 Int) (v_subst_75 Int) (v_subst_74 Int)) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_75) (+ (* v_subst_74 4) v_subst_73)))) (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_75) (+ (* v_subst_74 4) v_subst_73)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1))))) (or (< ~n~0 2) (< ~end~0 1)) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_72 Int) (v_subst_71 Int) (v_subst_70 Int)) (or (< (select (select |#memory_int#1| v_subst_72) (+ (* v_subst_71 4) v_subst_70)) ~last~0) (not (= (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)) (select (select |#memory_int#1| v_subst_72) (+ (* v_subst_71 4) v_subst_70)))))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_78 Int) (v_subst_77 Int) (v_subst_76 Int)) (or (not (= (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)) (select (select |#memory_int#1| v_subst_78) (+ v_subst_76 (* v_subst_77 4))))) (< (select (select |#memory_int#1| v_subst_78) (+ v_subst_76 (* v_subst_77 4))) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))))) (= ~queue~0.offset 0) (<= ~v_old~0 ~new~0) (or (not (= ~end~0 0)) (and (or (< ~start~0 1) (< (+ ~start~0 ~n~0) 2)) (or (< ~v_old~0 (+ (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) 1)) (not (= ~start~0 0))))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0))))), Black: 370#(and (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_132 Int) (v_subst_131 Int) (v_subst_130 Int)) (or (not (= (select (select |#memory_int#1| v_subst_132) (+ v_subst_130 (* 4 v_subst_131))) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (< (select (select |#memory_int#1| v_subst_132) (+ v_subst_130 (* 4 v_subst_131))) ~last~0))) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~start~0 1) (not (= ~end~0 0)) (< (+ ~start~0 ~n~0) 2)) (or (< ~n~0 2) (< ~end~0 1)) (= ~queue~0.offset 0) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)) (< ~v_old~0 (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1))) (or (< ~end~0 0) (forall ((v_subst_135 Int) (v_subst_134 Int) (v_subst_133 Int) (v_ArrVal_53 (Array Int Int))) (or (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~end~0 4)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_135) (+ (* 4 v_subst_134) v_subst_133)))) (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) v_subst_135) (+ (* 4 v_subst_134) v_subst_133)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (* ~start~0 4)) 1)))) (< ~n~0 (+ ~end~0 1))) (= ~ok~0 1) (or (= ~start~0 ~end~0) (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (< (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162| Int)) (not (= (select |#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_162|) 0)))) (or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (forall ((v_subst_138 Int) (v_subst_137 Int) (v_subst_136 Int)) (or (< (select (select |#memory_int#1| v_subst_138) (+ (* 4 v_subst_137) v_subst_136)) (+ (select (select |#memory_int#1| ~queue~0.base) (* ~start~0 4)) 1)) (not (= (select (select |#memory_int#1| v_subst_138) (+ (* 4 v_subst_137) v_subst_136)) (select (select |#memory_int#1| ~queue~0.base) (* ~end~0 4)))))))), Black: 292#(and (= ~start~0 ~end~0) (= ~last~0 ~v_old~0) (= ~queue~0.offset 0) (<= ~n~0 1) (= ~ok~0 1)), Black: 233#(or (= (mod |thread2Thread1of1ForFork1_~cond~0#1| 256) 0) (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1))), Black: 302#(and (or (and (or (forall ((v_subst_18 Int) (v_subst_17 Int) (v_subst_16 Int)) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int#1| v_subst_18) (+ (* v_subst_17 4) v_subst_16))))) (not (= (mod ~ok~0 256) 0))) (forall ((v_subst_15 Int) (v_subst_14 Int) (v_subst_13 Int)) (or (not (= (select (select |#memory_int#1| v_subst_15) (+ v_subst_13 (* v_subst_14 4))) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< (select (select |#memory_int#1| v_subst_15) (+ v_subst_13 (* v_subst_14 4))) (+ (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1))))) (< ~end~0 0) (< ~n~0 (+ ~end~0 1))) (or (forall ((v_subst_12 Int) (v_subst_11 Int) (v_subst_10 Int)) (or (< (select (select |#memory_int#1| v_subst_12) (+ (* v_subst_11 4) v_subst_10)) ~last~0) (not (= (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))) (select (select |#memory_int#1| v_subst_12) (+ (* v_subst_11 4) v_subst_10)))))) (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (< ~n~0 (+ ~end~0 1))) (or (< ~end~0 0) (and (<= ~v_old~0 (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4)))) (not (= (mod ~ok~0 256) 0))) (not (= (select (select |#memory_int#1| ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select |#memory_int#1| ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4))))) (< ~n~0 (+ ~end~0 1)) (and (<= ~end~0 ~start~0) (<= ~N~0 ~i~0)))), Black: 274#(or (< ~end~0 0) (< ~n~0 (+ ~end~0 1)) (and (or (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))) (not (= (mod ~ok~0 256) 0))) (forall ((~A~0.offset Int) (v_ArrVal_53 (Array Int Int)) (~i~0 Int) (~A~0.base Int)) (or (< (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (+ (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~start~0 4))) 1)) (not (= (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)) (select (select (store |#memory_int#1| |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_53) ~queue~0.base) (+ ~queue~0.offset (* ~end~0 4)))))))))]) [2024-06-28 01:08:14,771 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2024-06-28 01:08:14,771 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:14,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:14,772 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-28 01:08:15,220 INFO L124 PetriNetUnfolderBase]: 3622/6674 cut-off events. [2024-06-28 01:08:15,220 INFO L125 PetriNetUnfolderBase]: For 126916/127410 co-relation queries the response was YES. [2024-06-28 01:08:15,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47840 conditions, 6674 events. 3622/6674 cut-off events. For 126916/127410 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 44212 event pairs, 1119 based on Foata normal form. 219/6317 useless extension candidates. Maximal degree in co-relation 44189. Up to 3964 conditions per place. [2024-06-28 01:08:15,280 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 174 selfloop transitions, 33 changer transitions 105/337 dead transitions. [2024-06-28 01:08:15,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 337 transitions, 4334 flow [2024-06-28 01:08:15,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:08:15,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:08:15,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 206 transitions. [2024-06-28 01:08:15,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6358024691358025 [2024-06-28 01:08:15,284 INFO L175 Difference]: Start difference. First operand has 173 places, 239 transitions, 2382 flow. Second operand 9 states and 206 transitions. [2024-06-28 01:08:15,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 337 transitions, 4334 flow [2024-06-28 01:08:15,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 337 transitions, 3736 flow, removed 283 selfloop flow, removed 14 redundant places. [2024-06-28 01:08:15,490 INFO L231 Difference]: Finished difference. Result has 160 places, 169 transitions, 1701 flow [2024-06-28 01:08:15,491 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1701, PETRI_PLACES=160, PETRI_TRANSITIONS=169} [2024-06-28 01:08:15,491 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 125 predicate places. [2024-06-28 01:08:15,491 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 169 transitions, 1701 flow [2024-06-28 01:08:15,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 16.571428571428573) internal successors, (232), 14 states have internal predecessors, (232), 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-28 01:08:15,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:15,492 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:15,504 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-28 01:08:15,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:15,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:15,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1301611869, now seen corresponding path program 4 times [2024-06-28 01:08:15,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:15,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272366062] [2024-06-28 01:08:15,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:15,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:15,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272366062] [2024-06-28 01:08:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272366062] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:15,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669833813] [2024-06-28 01:08:15,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:08:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:15,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:15,851 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-28 01:08:15,852 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-28 01:08:15,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:08:15,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:15,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-28 01:08:15,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:16,116 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:16,116 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:16,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-28 01:08:16,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669833813] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:08:16,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:08:16,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-06-28 01:08:16,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382344228] [2024-06-28 01:08:16,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:08:16,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:08:16,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:08:16,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:08:16,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:08:16,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:08:16,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 169 transitions, 1701 flow. Second operand has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-28 01:08:16,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:08:16,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:08:16,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:08:17,017 INFO L124 PetriNetUnfolderBase]: 2062/4042 cut-off events. [2024-06-28 01:08:17,017 INFO L125 PetriNetUnfolderBase]: For 53851/54039 co-relation queries the response was YES. [2024-06-28 01:08:17,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25353 conditions, 4042 events. 2062/4042 cut-off events. For 53851/54039 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 25033 event pairs, 808 based on Foata normal form. 128/3884 useless extension candidates. Maximal degree in co-relation 24861. Up to 2466 conditions per place. [2024-06-28 01:08:17,044 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 111 selfloop transitions, 20 changer transitions 84/236 dead transitions. [2024-06-28 01:08:17,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 236 transitions, 2805 flow [2024-06-28 01:08:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:08:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:08:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 161 transitions. [2024-06-28 01:08:17,045 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49691358024691357 [2024-06-28 01:08:17,045 INFO L175 Difference]: Start difference. First operand has 160 places, 169 transitions, 1701 flow. Second operand 9 states and 161 transitions. [2024-06-28 01:08:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 236 transitions, 2805 flow [2024-06-28 01:08:17,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 236 transitions, 2629 flow, removed 86 selfloop flow, removed 16 redundant places. [2024-06-28 01:08:17,137 INFO L231 Difference]: Finished difference. Result has 132 places, 114 transitions, 1055 flow [2024-06-28 01:08:17,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1055, PETRI_PLACES=132, PETRI_TRANSITIONS=114} [2024-06-28 01:08:17,138 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 97 predicate places. [2024-06-28 01:08:17,138 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 114 transitions, 1055 flow [2024-06-28 01:08:17,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 13.6) internal successors, (204), 15 states have internal predecessors, (204), 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-28 01:08:17,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:08:17,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:08:17,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-28 01:08:17,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:17,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:08:17,348 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:08:17,349 INFO L85 PathProgramCache]: Analyzing trace with hash -2144757637, now seen corresponding path program 5 times [2024-06-28 01:08:17,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:08:17,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337018342] [2024-06-28 01:08:17,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:08:17,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:08:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:08:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:08:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:08:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337018342] [2024-06-28 01:08:19,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337018342] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:08:19,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662186364] [2024-06-28 01:08:19,081 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:08:19,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:08:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:08:19,083 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-28 01:08:19,101 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-28 01:08:19,174 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-28 01:08:19,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:08:19,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 37 conjunts are in the unsatisfiable core [2024-06-28 01:08:19,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:08:21,120 INFO L349 Elim1Store]: treesize reduction 38, result has 54.8 percent of original size [2024-06-28 01:08:21,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 61 [2024-06-28 01:08:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:08:21,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:08:24,536 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-28 01:08:24,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 233 treesize of output 1432 [2024-06-28 01:11:33,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-06-28 01:11:33,392 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-06-28 01:11:33,393 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-28 01:11:33,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-28 01:11:33,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-06-28 01:11:33,594 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:287) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:519) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:503) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:609) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:416) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 69 more [2024-06-28 01:11:33,599 INFO L158 Benchmark]: Toolchain (without parser) took 243250.73ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 117.3MB in the beginning and 970.7MB in the end (delta: -853.4MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-28 01:11:33,599 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:11:33,599 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:11:33,599 INFO L158 Benchmark]: CACSL2BoogieTranslator took 269.76ms. Allocated memory is still 190.8MB. Free memory was 117.3MB in the beginning and 102.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-06-28 01:11:33,599 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.05ms. Allocated memory is still 190.8MB. Free memory was 101.7MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:11:33,600 INFO L158 Benchmark]: Boogie Preprocessor took 36.19ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 97.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:11:33,600 INFO L158 Benchmark]: RCFGBuilder took 656.33ms. Allocated memory is still 190.8MB. Free memory was 97.1MB in the beginning and 129.0MB in the end (delta: -31.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-06-28 01:11:33,600 INFO L158 Benchmark]: TraceAbstraction took 242245.15ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 129.0MB in the beginning and 970.7MB in the end (delta: -841.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-06-28 01:11:33,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 190.8MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 269.76ms. Allocated memory is still 190.8MB. Free memory was 117.3MB in the beginning and 102.0MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.05ms. Allocated memory is still 190.8MB. Free memory was 101.7MB in the beginning and 99.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.19ms. Allocated memory is still 190.8MB. Free memory was 99.8MB in the beginning and 97.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 656.33ms. Allocated memory is still 190.8MB. Free memory was 97.1MB in the beginning and 129.0MB in the end (delta: -31.9MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * TraceAbstraction took 242245.15ms. Allocated memory was 190.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 129.0MB in the beginning and 970.7MB in the end (delta: -841.7MB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/weaver/popl20-more-inc-subseq.wvr.c ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-inc-subseq.wvr.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:11:35,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:11:35,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-28 01:11:35,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:11:35,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:11:35,587 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:11:35,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:11:35,587 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:11:35,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:11:35,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:11:35,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:11:35,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:11:35,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:11:35,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:11:35,593 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:11:35,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:11:35,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:11:35,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:11:35,594 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:11:35,594 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:11:35,594 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:11:35,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:11:35,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:11:35,595 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-28 01:11:35,596 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-28 01:11:35,596 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:11:35,596 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-28 01:11:35,596 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:11:35,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:11:35,597 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:11:35,598 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:11:35,598 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:11:35,598 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:11:35,598 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:11:35,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:11:35,599 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:11:35,599 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:11:35,599 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:11:35,600 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-28 01:11:35,600 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-28 01:11:35,600 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:11:35,600 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:11:35,600 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:11:35,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:11:35,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:11:35,601 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-28 01:11:35,601 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 [2024-06-28 01:11:35,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:11:35,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:11:35,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:11:35,903 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:11:35,903 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:11:35,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/popl20-more-inc-subseq.wvr.yml/witness.yml [2024-06-28 01:11:35,985 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:11:35,985 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:11:35,985 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-28 01:11:37,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:11:37,282 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:11:37,283 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2024-06-28 01:11:37,288 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1cc1828/9302c0e76b93417197f26585891f6c14/FLAG03212fb51 [2024-06-28 01:11:37,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e1cc1828/9302c0e76b93417197f26585891f6c14 [2024-06-28 01:11:37,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:11:37,300 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:11:37,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:11:37,301 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:11:37,304 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:11:37,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:35" (1/2) ... [2024-06-28 01:11:37,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5f008a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:37, skipping insertion in model container [2024-06-28 01:11:37,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:35" (1/2) ... [2024-06-28 01:11:37,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4dd71514 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:11:37, skipping insertion in model container [2024-06-28 01:11:37,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:11:37" (2/2) ... [2024-06-28 01:11:37,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b5f008a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37, skipping insertion in model container [2024-06-28 01:11:37,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:11:37" (2/2) ... [2024-06-28 01:11:37,307 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:11:37,319 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:11:37,320 INFO L97 edCorrectnessWitness]: Location invariant before [L102-L102] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:11:37,320 INFO L97 edCorrectnessWitness]: Location invariant before [L103-L103] (! multithreaded || 0 <= i) && (! multithreaded || 0 <= i) [2024-06-28 01:11:37,320 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:11:37,320 INFO L106 edCorrectnessWitness]: ghost_update [L101-L101] multithreaded = 1; [2024-06-28 01:11:37,337 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:11:37,490 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-28 01:11:37,499 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:37,507 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-28 01:11:37,510 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:11:37,521 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-28 01:11:37,524 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:37,535 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:11:37,612 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c[2950,2963] [2024-06-28 01:11:37,615 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:11:37,632 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:11:37,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37 WrapperNode [2024-06-28 01:11:37,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:11:37,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:11:37,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:11:37,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:11:37,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,665 INFO L138 Inliner]: procedures = 25, calls = 35, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 187 [2024-06-28 01:11:37,665 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:11:37,666 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:11:37,666 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:11:37,666 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:11:37,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,674 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,684 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,702 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-06-28 01:11:37,703 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,703 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,712 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,715 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:11:37,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:11:37,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:11:37,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:11:37,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (1/1) ... [2024-06-28 01:11:37,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:11:37,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:11:37,751 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-28 01:11:37,753 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-28 01:11:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:11:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-28 01:11:37,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-28 01:11:37,781 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:11:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-28 01:11:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-28 01:11:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-28 01:11:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:11:37,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:11:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-28 01:11:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-28 01:11:37,784 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:11:37,904 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:11:37,906 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:11:38,293 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:11:38,293 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:11:38,557 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:11:38,558 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-06-28 01:11:38,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:11:38 BoogieIcfgContainer [2024-06-28 01:11:38,559 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:11:38,561 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:11:38,561 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:11:38,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:11:38,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:11:35" (1/4) ... [2024-06-28 01:11:38,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d6e64 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:11:38, skipping insertion in model container [2024-06-28 01:11:38,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:11:37" (2/4) ... [2024-06-28 01:11:38,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d6e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:11:38, skipping insertion in model container [2024-06-28 01:11:38,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:11:37" (3/4) ... [2024-06-28 01:11:38,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d6e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:11:38, skipping insertion in model container [2024-06-28 01:11:38,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:11:38" (4/4) ... [2024-06-28 01:11:38,570 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2024-06-28 01:11:38,584 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:11:38,584 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:11:38,584 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:11:38,621 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-28 01:11:38,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:11:38,679 INFO L124 PetriNetUnfolderBase]: 5/34 cut-off events. [2024-06-28 01:11:38,679 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-28 01:11:38,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 34 events. 5/34 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-06-28 01:11:38,682 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 36 transitions, 86 flow [2024-06-28 01:11:38,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 33 transitions, 78 flow [2024-06-28 01:11:38,699 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:11:38,704 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;@1dd0b4e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:11:38,704 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:11:38,708 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:11:38,708 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2024-06-28 01:11:38,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:11:38,708 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:38,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:38,709 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:38,712 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1967476541, now seen corresponding path program 1 times [2024-06-28 01:11:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264986830] [2024-06-28 01:11:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:38,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:38,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:38,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-06-28 01:11:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:38,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-28 01:11:38,857 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:38,888 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-28 01:11:38,888 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:38,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:38,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264986830] [2024-06-28 01:11:38,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264986830] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:38,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:38,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:11:38,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318910995] [2024-06-28 01:11:38,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:38,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:11:38,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:38,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:11:38,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:11:38,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:11:38,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:38,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:38,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:11:38,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:39,100 INFO L124 PetriNetUnfolderBase]: 287/517 cut-off events. [2024-06-28 01:11:39,100 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-06-28 01:11:39,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1016 conditions, 517 events. 287/517 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2378 event pairs, 96 based on Foata normal form. 24/451 useless extension candidates. Maximal degree in co-relation 939. Up to 285 conditions per place. [2024-06-28 01:11:39,105 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 40 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-06-28 01:11:39,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 50 transitions, 205 flow [2024-06-28 01:11:39,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:11:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:11:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-06-28 01:11:39,126 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6851851851851852 [2024-06-28 01:11:39,127 INFO L175 Difference]: Start difference. First operand has 35 places, 33 transitions, 78 flow. Second operand 3 states and 74 transitions. [2024-06-28 01:11:39,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 50 transitions, 205 flow [2024-06-28 01:11:39,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 191 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-28 01:11:39,168 INFO L231 Difference]: Finished difference. Result has 34 places, 34 transitions, 84 flow [2024-06-28 01:11:39,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=34, PETRI_TRANSITIONS=34} [2024-06-28 01:11:39,175 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2024-06-28 01:11:39,175 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 34 transitions, 84 flow [2024-06-28 01:11:39,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:39,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:39,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:39,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:39,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:39,378 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:39,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1223388292, now seen corresponding path program 1 times [2024-06-28 01:11:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696528468] [2024-06-28 01:11:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:39,384 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:39,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-06-28 01:11:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:39,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-28 01:11:39,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:39,479 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-28 01:11:39,479 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:39,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:39,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696528468] [2024-06-28 01:11:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696528468] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:39,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:39,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:11:39,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595153397] [2024-06-28 01:11:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:39,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:11:39,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:39,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:11:39,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:11:39,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:11:39,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 34 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-28 01:11:39,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:39,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:11:39,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:39,713 INFO L124 PetriNetUnfolderBase]: 393/696 cut-off events. [2024-06-28 01:11:39,713 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-06-28 01:11:39,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 696 events. 393/696 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3374 event pairs, 96 based on Foata normal form. 30/622 useless extension candidates. Maximal degree in co-relation 412. Up to 285 conditions per place. [2024-06-28 01:11:39,723 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 56 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2024-06-28 01:11:39,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 67 transitions, 276 flow [2024-06-28 01:11:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:11:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:11:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2024-06-28 01:11:39,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7013888888888888 [2024-06-28 01:11:39,724 INFO L175 Difference]: Start difference. First operand has 34 places, 34 transitions, 84 flow. Second operand 4 states and 101 transitions. [2024-06-28 01:11:39,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 67 transitions, 276 flow [2024-06-28 01:11:39,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 67 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:39,726 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 100 flow [2024-06-28 01:11:39,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2024-06-28 01:11:39,727 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-06-28 01:11:39,727 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 100 flow [2024-06-28 01:11:39,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-28 01:11:39,727 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:39,727 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:39,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:39,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:39,937 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:39,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:39,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1132987047, now seen corresponding path program 2 times [2024-06-28 01:11:39,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:39,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679998966] [2024-06-28 01:11:39,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:11:39,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:39,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:39,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:39,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-06-28 01:11:40,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-06-28 01:11:40,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:11:40,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-28 01:11:40,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:40,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:11:40,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:40,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:40,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679998966] [2024-06-28 01:11:40,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679998966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:40,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:40,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:11:40,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163289731] [2024-06-28 01:11:40,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:40,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:11:40,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:40,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:11:40,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:11:40,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:11:40,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-28 01:11:40,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:40,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:11:40,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:40,203 INFO L124 PetriNetUnfolderBase]: 375/739 cut-off events. [2024-06-28 01:11:40,203 INFO L125 PetriNetUnfolderBase]: For 116/126 co-relation queries the response was YES. [2024-06-28 01:11:40,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1472 conditions, 739 events. 375/739 cut-off events. For 116/126 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3788 event pairs, 239 based on Foata normal form. 0/636 useless extension candidates. Maximal degree in co-relation 418. Up to 606 conditions per place. [2024-06-28 01:11:40,206 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 24 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-06-28 01:11:40,206 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 154 flow [2024-06-28 01:11:40,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:11:40,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:11:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2024-06-28 01:11:40,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5648148148148148 [2024-06-28 01:11:40,208 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 100 flow. Second operand 3 states and 61 transitions. [2024-06-28 01:11:40,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 154 flow [2024-06-28 01:11:40,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-28 01:11:40,225 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 106 flow [2024-06-28 01:11:40,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2024-06-28 01:11:40,226 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-06-28 01:11:40,226 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 106 flow [2024-06-28 01:11:40,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-28 01:11:40,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:40,226 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:40,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:40,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:40,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:40,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:40,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1813222239, now seen corresponding path program 1 times [2024-06-28 01:11:40,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:40,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634105752] [2024-06-28 01:11:40,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:40,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:40,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-06-28 01:11:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:40,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-28 01:11:40,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:40,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:40,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:40,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:40,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634105752] [2024-06-28 01:11:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634105752] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:40,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:40,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2024-06-28 01:11:40,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696777313] [2024-06-28 01:11:40,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:40,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-06-28 01:11:40,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-06-28 01:11:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-06-28 01:11:40,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 36 [2024-06-28 01:11:40,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 106 flow. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:40,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:40,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 36 [2024-06-28 01:11:40,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:40,945 INFO L124 PetriNetUnfolderBase]: 575/1024 cut-off events. [2024-06-28 01:11:40,946 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-06-28 01:11:40,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2130 conditions, 1024 events. 575/1024 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5063 event pairs, 71 based on Foata normal form. 100/976 useless extension candidates. Maximal degree in co-relation 2112. Up to 189 conditions per place. [2024-06-28 01:11:40,951 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 97 selfloop transitions, 7 changer transitions 0/112 dead transitions. [2024-06-28 01:11:40,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 112 transitions, 481 flow [2024-06-28 01:11:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:11:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:11:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 191 transitions. [2024-06-28 01:11:40,953 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6631944444444444 [2024-06-28 01:11:40,953 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 106 flow. Second operand 8 states and 191 transitions. [2024-06-28 01:11:40,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 112 transitions, 481 flow [2024-06-28 01:11:40,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 112 transitions, 477 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:40,955 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 122 flow [2024-06-28 01:11:40,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-06-28 01:11:40,955 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2024-06-28 01:11:40,956 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 122 flow [2024-06-28 01:11:40,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:11:40,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:40,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:40,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:41,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:41,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:41,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:41,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1379222949, now seen corresponding path program 1 times [2024-06-28 01:11:41,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:41,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277178905] [2024-06-28 01:11:41,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:41,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:41,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:41,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:41,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-06-28 01:11:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:41,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2024-06-28 01:11:41,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:41,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:41,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:41,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277178905] [2024-06-28 01:11:41,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277178905] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:41,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:41,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:11:41,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395980844] [2024-06-28 01:11:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:41,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:11:41,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:41,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:11:41,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:11:41,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:11:41,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-28 01:11:41,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:41,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:11:41,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:41,442 INFO L124 PetriNetUnfolderBase]: 786/1523 cut-off events. [2024-06-28 01:11:41,443 INFO L125 PetriNetUnfolderBase]: For 426/426 co-relation queries the response was YES. [2024-06-28 01:11:41,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3207 conditions, 1523 events. 786/1523 cut-off events. For 426/426 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 8796 event pairs, 324 based on Foata normal form. 6/1427 useless extension candidates. Maximal degree in co-relation 3183. Up to 696 conditions per place. [2024-06-28 01:11:41,448 INFO L140 encePairwiseOnDemand]: 33/36 looper letters, 43 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2024-06-28 01:11:41,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 55 transitions, 288 flow [2024-06-28 01:11:41,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:11:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:11:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-28 01:11:41,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6759259259259259 [2024-06-28 01:11:41,449 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 122 flow. Second operand 3 states and 73 transitions. [2024-06-28 01:11:41,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 55 transitions, 288 flow [2024-06-28 01:11:41,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 55 transitions, 249 flow, removed 12 selfloop flow, removed 5 redundant places. [2024-06-28 01:11:41,452 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 113 flow [2024-06-28 01:11:41,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2024-06-28 01:11:41,452 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-06-28 01:11:41,452 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 113 flow [2024-06-28 01:11:41,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-28 01:11:41,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:41,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:41,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:41,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:41,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:41,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:41,657 INFO L85 PathProgramCache]: Analyzing trace with hash 356190104, now seen corresponding path program 1 times [2024-06-28 01:11:41,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:41,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376661880] [2024-06-28 01:11:41,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:41,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:41,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:41,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-06-28 01:11:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:41,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-28 01:11:41,722 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:41,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:41,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:41,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376661880] [2024-06-28 01:11:41,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376661880] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:41,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:41,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:11:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666721319] [2024-06-28 01:11:41,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:41,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:11:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:11:41,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:11:41,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:11:41,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-28 01:11:41,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:41,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:11:41,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:42,118 INFO L124 PetriNetUnfolderBase]: 1505/2590 cut-off events. [2024-06-28 01:11:42,119 INFO L125 PetriNetUnfolderBase]: For 287/289 co-relation queries the response was YES. [2024-06-28 01:11:42,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2590 events. 1505/2590 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 13571 event pairs, 457 based on Foata normal form. 62/2321 useless extension candidates. Maximal degree in co-relation 5770. Up to 1490 conditions per place. [2024-06-28 01:11:42,129 INFO L140 encePairwiseOnDemand]: 29/36 looper letters, 60 selfloop transitions, 3 changer transitions 26/94 dead transitions. [2024-06-28 01:11:42,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 94 transitions, 457 flow [2024-06-28 01:11:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-28 01:11:42,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-28 01:11:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 133 transitions. [2024-06-28 01:11:42,130 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2024-06-28 01:11:42,130 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 113 flow. Second operand 7 states and 133 transitions. [2024-06-28 01:11:42,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 94 transitions, 457 flow [2024-06-28 01:11:42,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 94 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:11:42,133 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 137 flow [2024-06-28 01:11:42,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-06-28 01:11:42,133 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2024-06-28 01:11:42,134 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 137 flow [2024-06-28 01:11:42,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-28 01:11:42,134 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:42,134 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:42,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:42,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:42,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:42,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:42,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1130598002, now seen corresponding path program 1 times [2024-06-28 01:11:42,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:42,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863665966] [2024-06-28 01:11:42,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:42,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:42,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:42,339 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:42,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-06-28 01:11:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:42,428 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-28 01:11:42,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:42,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:11:42,495 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-28 01:11:42,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:42,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863665966] [2024-06-28 01:11:42,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863665966] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:11:42,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:11:42,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:11:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619758872] [2024-06-28 01:11:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:11:42,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:11:42,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:42,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:11:42,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:11:42,498 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:11:42,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-28 01:11:42,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:11:42,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:11:42,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:11:42,691 INFO L124 PetriNetUnfolderBase]: 876/1700 cut-off events. [2024-06-28 01:11:42,692 INFO L125 PetriNetUnfolderBase]: For 903/965 co-relation queries the response was YES. [2024-06-28 01:11:42,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4508 conditions, 1700 events. 876/1700 cut-off events. For 903/965 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 9497 event pairs, 727 based on Foata normal form. 25/1602 useless extension candidates. Maximal degree in co-relation 3975. Up to 1365 conditions per place. [2024-06-28 01:11:42,699 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 30 selfloop transitions, 2 changer transitions 18/58 dead transitions. [2024-06-28 01:11:42,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 299 flow [2024-06-28 01:11:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-28 01:11:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-28 01:11:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2024-06-28 01:11:42,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5902777777777778 [2024-06-28 01:11:42,701 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 137 flow. Second operand 4 states and 85 transitions. [2024-06-28 01:11:42,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 299 flow [2024-06-28 01:11:42,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 289 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:11:42,711 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 141 flow [2024-06-28 01:11:42,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2024-06-28 01:11:42,712 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2024-06-28 01:11:42,712 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 141 flow [2024-06-28 01:11:42,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-28 01:11:42,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:11:42,713 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:11:42,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-06-28 01:11:42,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:42,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:11:42,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:11:42,916 INFO L85 PathProgramCache]: Analyzing trace with hash -118228549, now seen corresponding path program 1 times [2024-06-28 01:11:42,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:11:42,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994775522] [2024-06-28 01:11:42,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:11:42,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:11:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:11:42,918 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:11:42,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-06-28 01:11:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:11:43,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:11:43,022 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:11:43,698 INFO L349 Elim1Store]: treesize reduction 80, result has 76.0 percent of original size [2024-06-28 01:11:43,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 174 treesize of output 286 [2024-06-28 01:11:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:11:44,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:11:54,382 WARN L293 SmtUtils]: Spent 5.74s on a formula simplification. DAG size of input: 394 DAG size of output: 346 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:11:54,383 INFO L349 Elim1Store]: treesize reduction 168, result has 90.0 percent of original size [2024-06-28 01:11:54,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 269 treesize of output 1571 [2024-06-28 01:11:58,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:11:58,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:11:58,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994775522] [2024-06-28 01:11:58,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994775522] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:11:58,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:11:58,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-06-28 01:11:58,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682221467] [2024-06-28 01:11:58,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:11:58,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-28 01:11:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:11:58,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-28 01:11:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=177, Unknown=1, NotChecked=0, Total=240 [2024-06-28 01:12:02,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:12:06,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:12:10,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:12:14,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:12:18,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-28 01:12:18,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:12:18,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 141 flow. Second operand has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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-28 01:12:18,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:18,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:12:18,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:22,444 INFO L124 PetriNetUnfolderBase]: 2238/3793 cut-off events. [2024-06-28 01:12:22,444 INFO L125 PetriNetUnfolderBase]: For 971/971 co-relation queries the response was YES. [2024-06-28 01:12:22,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9297 conditions, 3793 events. 2238/3793 cut-off events. For 971/971 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 20268 event pairs, 176 based on Foata normal form. 5/3595 useless extension candidates. Maximal degree in co-relation 9277. Up to 1084 conditions per place. [2024-06-28 01:12:22,459 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 101 selfloop transitions, 10 changer transitions 4/120 dead transitions. [2024-06-28 01:12:22,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 120 transitions, 625 flow [2024-06-28 01:12:22,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:12:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:12:22,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 152 transitions. [2024-06-28 01:12:22,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2024-06-28 01:12:22,463 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 141 flow. Second operand 9 states and 152 transitions. [2024-06-28 01:12:22,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 120 transitions, 625 flow [2024-06-28 01:12:22,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 120 transitions, 619 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:12:22,468 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 206 flow [2024-06-28 01:12:22,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=206, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2024-06-28 01:12:22,470 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 23 predicate places. [2024-06-28 01:12:22,470 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 206 flow [2024-06-28 01:12:22,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.125) internal successors, (162), 16 states have internal predecessors, (162), 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-28 01:12:22,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:22,471 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:22,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-06-28 01:12:22,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:22,675 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:12:22,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1127819688, now seen corresponding path program 2 times [2024-06-28 01:12:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:22,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375217304] [2024-06-28 01:12:22,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:12:22,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:22,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:22,677 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:22,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-06-28 01:12:22,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:12:22,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:22,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2024-06-28 01:12:22,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:12:23,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:12:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:12:23,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:12:23,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375217304] [2024-06-28 01:12:23,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375217304] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:12:23,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:12:23,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-06-28 01:12:23,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835847771] [2024-06-28 01:12:23,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:12:23,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:12:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:12:23,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:12:23,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:12:24,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 36 [2024-06-28 01:12:24,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 206 flow. Second operand has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 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-28 01:12:24,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:24,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 36 [2024-06-28 01:12:24,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:27,003 INFO L124 PetriNetUnfolderBase]: 6127/10610 cut-off events. [2024-06-28 01:12:27,004 INFO L125 PetriNetUnfolderBase]: For 6687/6687 co-relation queries the response was YES. [2024-06-28 01:12:27,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29960 conditions, 10610 events. 6127/10610 cut-off events. For 6687/6687 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 70581 event pairs, 1328 based on Foata normal form. 286/10428 useless extension candidates. Maximal degree in co-relation 18862. Up to 1874 conditions per place. [2024-06-28 01:12:27,097 INFO L140 encePairwiseOnDemand]: 27/36 looper letters, 241 selfloop transitions, 39 changer transitions 19/304 dead transitions. [2024-06-28 01:12:27,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 304 transitions, 1850 flow [2024-06-28 01:12:27,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-06-28 01:12:27,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-06-28 01:12:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 431 transitions. [2024-06-28 01:12:27,100 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988425925925926 [2024-06-28 01:12:27,100 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 206 flow. Second operand 24 states and 431 transitions. [2024-06-28 01:12:27,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 304 transitions, 1850 flow [2024-06-28 01:12:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 304 transitions, 1824 flow, removed 10 selfloop flow, removed 2 redundant places. [2024-06-28 01:12:27,119 INFO L231 Difference]: Finished difference. Result has 86 places, 91 transitions, 549 flow [2024-06-28 01:12:27,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=549, PETRI_PLACES=86, PETRI_TRANSITIONS=91} [2024-06-28 01:12:27,120 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2024-06-28 01:12:27,120 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 91 transitions, 549 flow [2024-06-28 01:12:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 12.4) internal successors, (186), 15 states have internal predecessors, (186), 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-28 01:12:27,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:27,121 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:27,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-06-28 01:12:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:27,325 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:12:27,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1274851317, now seen corresponding path program 3 times [2024-06-28 01:12:27,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:27,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891665541] [2024-06-28 01:12:27,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:12:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:27,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:27,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-06-28 01:12:27,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-06-28 01:12:27,465 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:27,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 13 conjunts are in the unsatisfiable core [2024-06-28 01:12:27,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:27,787 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:12:27,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:12:28,348 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:12:28,349 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:12:28,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891665541] [2024-06-28 01:12:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891665541] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:12:28,349 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:12:28,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-06-28 01:12:28,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005830367] [2024-06-28 01:12:28,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:12:28,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:12:28,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:12:28,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:12:28,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:12:28,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:12:28,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 91 transitions, 549 flow. Second operand has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 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-28 01:12:28,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:28,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:12:28,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:30,888 INFO L124 PetriNetUnfolderBase]: 6215/12065 cut-off events. [2024-06-28 01:12:30,888 INFO L125 PetriNetUnfolderBase]: For 19965/20397 co-relation queries the response was YES. [2024-06-28 01:12:30,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40133 conditions, 12065 events. 6215/12065 cut-off events. For 19965/20397 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 98301 event pairs, 1459 based on Foata normal form. 355/11880 useless extension candidates. Maximal degree in co-relation 22527. Up to 2051 conditions per place. [2024-06-28 01:12:30,945 INFO L140 encePairwiseOnDemand]: 31/36 looper letters, 198 selfloop transitions, 42 changer transitions 11/262 dead transitions. [2024-06-28 01:12:30,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 262 transitions, 1872 flow [2024-06-28 01:12:30,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-28 01:12:30,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-28 01:12:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 278 transitions. [2024-06-28 01:12:30,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2024-06-28 01:12:30,949 INFO L175 Difference]: Start difference. First operand has 86 places, 91 transitions, 549 flow. Second operand 12 states and 278 transitions. [2024-06-28 01:12:30,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 262 transitions, 1872 flow [2024-06-28 01:12:31,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 262 transitions, 1740 flow, removed 65 selfloop flow, removed 1 redundant places. [2024-06-28 01:12:31,006 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 721 flow [2024-06-28 01:12:31,007 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=721, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2024-06-28 01:12:31,007 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2024-06-28 01:12:31,007 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 721 flow [2024-06-28 01:12:31,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.214285714285714) internal successors, (213), 14 states have internal predecessors, (213), 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-28 01:12:31,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:31,008 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:31,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-06-28 01:12:31,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:31,212 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:12:31,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:31,212 INFO L85 PathProgramCache]: Analyzing trace with hash 993356994, now seen corresponding path program 4 times [2024-06-28 01:12:31,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:31,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915126213] [2024-06-28 01:12:31,213 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:12:31,213 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:31,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:31,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:31,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-06-28 01:12:31,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:12:31,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:31,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-28 01:12:31,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:31,505 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:12:31,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:12:31,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-28 01:12:31,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:12:31,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915126213] [2024-06-28 01:12:31,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915126213] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:12:31,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:12:31,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-28 01:12:31,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518292221] [2024-06-28 01:12:31,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:12:31,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-28 01:12:31,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:12:31,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-28 01:12:31,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-28 01:12:31,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 36 [2024-06-28 01:12:31,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 721 flow. Second operand has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-28 01:12:31,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:31,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 36 [2024-06-28 01:12:31,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:33,264 INFO L124 PetriNetUnfolderBase]: 5519/10984 cut-off events. [2024-06-28 01:12:33,264 INFO L125 PetriNetUnfolderBase]: For 18957/19108 co-relation queries the response was YES. [2024-06-28 01:12:33,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36910 conditions, 10984 events. 5519/10984 cut-off events. For 18957/19108 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 88238 event pairs, 3905 based on Foata normal form. 33/10517 useless extension candidates. Maximal degree in co-relation 21385. Up to 8651 conditions per place. [2024-06-28 01:12:33,313 INFO L140 encePairwiseOnDemand]: 32/36 looper letters, 76 selfloop transitions, 3 changer transitions 47/135 dead transitions. [2024-06-28 01:12:33,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 135 transitions, 1045 flow [2024-06-28 01:12:33,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:12:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:12:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-06-28 01:12:33,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-06-28 01:12:33,315 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 721 flow. Second operand 6 states and 126 transitions. [2024-06-28 01:12:33,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 135 transitions, 1045 flow [2024-06-28 01:12:33,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 135 transitions, 1026 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-28 01:12:33,368 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 563 flow [2024-06-28 01:12:33,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=563, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2024-06-28 01:12:33,369 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 63 predicate places. [2024-06-28 01:12:33,369 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 563 flow [2024-06-28 01:12:33,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.9) internal successors, (169), 10 states have internal predecessors, (169), 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-28 01:12:33,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:33,369 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:33,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-06-28 01:12:33,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:33,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:12:33,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1615312619, now seen corresponding path program 5 times [2024-06-28 01:12:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967542473] [2024-06-28 01:12:33,574 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:12:33,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:33,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:33,575 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:33,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-06-28 01:12:33,702 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-06-28 01:12:33,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:33,707 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 01:12:33,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-28 01:12:33,877 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:12:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-28 01:12:34,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-28 01:12:34,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967542473] [2024-06-28 01:12:34,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967542473] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:12:34,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-28 01:12:34,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 14 [2024-06-28 01:12:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761151813] [2024-06-28 01:12:34,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-28 01:12:34,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-28 01:12:34,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-28 01:12:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-28 01:12:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-06-28 01:12:34,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 36 [2024-06-28 01:12:34,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 563 flow. Second operand has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 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-28 01:12:34,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:12:34,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 36 [2024-06-28 01:12:34,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:12:36,869 INFO L124 PetriNetUnfolderBase]: 9654/16520 cut-off events. [2024-06-28 01:12:36,869 INFO L125 PetriNetUnfolderBase]: For 23308/23308 co-relation queries the response was YES. [2024-06-28 01:12:36,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54393 conditions, 16520 events. 9654/16520 cut-off events. For 23308/23308 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 114367 event pairs, 505 based on Foata normal form. 1099/16866 useless extension candidates. Maximal degree in co-relation 54354. Up to 5694 conditions per place. [2024-06-28 01:12:36,951 INFO L140 encePairwiseOnDemand]: 25/36 looper letters, 184 selfloop transitions, 41 changer transitions 52/282 dead transitions. [2024-06-28 01:12:36,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 282 transitions, 2277 flow [2024-06-28 01:12:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-28 01:12:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-28 01:12:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 284 transitions. [2024-06-28 01:12:36,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4382716049382716 [2024-06-28 01:12:36,954 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 563 flow. Second operand 18 states and 284 transitions. [2024-06-28 01:12:36,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 282 transitions, 2277 flow [2024-06-28 01:12:37,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 282 transitions, 2235 flow, removed 18 selfloop flow, removed 5 redundant places. [2024-06-28 01:12:37,068 INFO L231 Difference]: Finished difference. Result has 111 places, 112 transitions, 892 flow [2024-06-28 01:12:37,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=892, PETRI_PLACES=111, PETRI_TRANSITIONS=112} [2024-06-28 01:12:37,068 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 76 predicate places. [2024-06-28 01:12:37,068 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 112 transitions, 892 flow [2024-06-28 01:12:37,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.266666666666667) internal successors, (169), 15 states have internal predecessors, (169), 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-28 01:12:37,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:12:37,069 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:12:37,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-06-28 01:12:37,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:37,273 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:12:37,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:12:37,273 INFO L85 PathProgramCache]: Analyzing trace with hash 939195715, now seen corresponding path program 6 times [2024-06-28 01:12:37,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-28 01:12:37,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465826023] [2024-06-28 01:12:37,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-28 01:12:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-06-28 01:12:37,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-28 01:12:37,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-06-28 01:12:37,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-06-28 01:12:37,787 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-06-28 01:12:37,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:12:37,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjunts are in the unsatisfiable core [2024-06-28 01:12:37,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:12:41,843 INFO L349 Elim1Store]: treesize reduction 268, result has 79.7 percent of original size [2024-06-28 01:12:41,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 6 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 298 treesize of output 1112 [2024-06-28 01:12:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-06-28 01:12:44,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:13:54,614 INFO L349 Elim1Store]: treesize reduction 324, result has 78.2 percent of original size [2024-06-28 01:13:54,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 0 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 260 treesize of output 1213 [2024-06-28 01:14:12,736 WARN L293 SmtUtils]: Spent 17.55s on a formula simplification. DAG size of input: 843 DAG size of output: 584 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-28 01:14:12,736 INFO L349 Elim1Store]: treesize reduction 973, result has 73.5 percent of original size [2024-06-28 01:14:12,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 0 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 276 case distinctions, treesize of input 332 treesize of output 2767 Killed by 15