./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c --full-output --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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:07:26,485 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:07:26,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:07:26,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:07:26,568 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:07:26,597 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:07:26,598 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:07:26,599 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:07:26,600 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:07:26,603 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:07:26,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:07:26,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:07:26,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:07:26,606 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:07:26,607 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:07:26,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:07:26,607 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:07:26,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:07:26,608 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:07:26,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:07:26,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:07:26,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:07:26,609 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:07:26,609 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:07:26,610 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:07:26,610 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:07:26,610 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:07:26,610 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:07:26,611 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:07:26,611 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:07:26,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:07:26,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:07:26,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:07:26,613 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:07:26,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:07:26,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:07:26,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:07:26,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:07:26,614 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:07:26,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:07:26,614 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:07:26,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:07:26,615 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:07:26,615 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2024-06-27 17:07:26,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:07:26,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:07:26,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:07:26,920 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:07:26,921 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:07:26,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2024-06-27 17:07:28,070 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:07:28,253 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:07:28,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2024-06-27 17:07:28,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2578304/977a744aa72b4206871b872e2a00cabb/FLAG1c450c8b2 [2024-06-27 17:07:28,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff2578304/977a744aa72b4206871b872e2a00cabb [2024-06-27 17:07:28,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:07:28,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:07:28,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:07:28,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:07:28,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:07:28,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ce9e49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28, skipping insertion in model container [2024-06-27 17:07:28,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,306 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:07:28,511 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-three-array-min.wvr.c[2854,2867] [2024-06-27 17:07:28,520 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:07:28,527 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:07:28,549 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-three-array-min.wvr.c[2854,2867] [2024-06-27 17:07:28,553 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:07:28,568 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:07:28,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28 WrapperNode [2024-06-27 17:07:28,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:07:28,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:07:28,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:07:28,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:07:28,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,609 INFO L138 Inliner]: procedures = 25, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 222 [2024-06-27 17:07:28,609 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:07:28,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:07:28,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:07:28,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:07:28,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,653 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-06-27 17:07:28,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,654 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,677 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,680 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:07:28,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:07:28,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:07:28,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:07:28,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (1/1) ... [2024-06-27 17:07:28,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:07:28,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:07:28,724 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-27 17:07:28,725 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-27 17:07:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:07:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:07:28,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:07:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:07:28,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:07:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:07:28,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:07:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:07:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:07:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:07:28,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:07:28,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:07:28,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:07:28,770 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:07:28,869 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:07:28,871 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:07:29,272 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:07:29,272 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:07:29,610 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:07:29,611 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 17:07:29,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:07:29 BoogieIcfgContainer [2024-06-27 17:07:29,611 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:07:29,614 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:07:29,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:07:29,617 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:07:29,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:07:28" (1/3) ... [2024-06-27 17:07:29,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215ad3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:07:29, skipping insertion in model container [2024-06-27 17:07:29,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:07:28" (2/3) ... [2024-06-27 17:07:29,619 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215ad3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:07:29, skipping insertion in model container [2024-06-27 17:07:29,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:07:29" (3/3) ... [2024-06-27 17:07:29,620 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2024-06-27 17:07:29,629 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:07:29,637 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:07:29,637 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:07:29,638 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:07:29,691 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:07:29,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2024-06-27 17:07:29,762 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-06-27 17:07:29,763 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:07:29,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-06-27 17:07:29,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2024-06-27 17:07:29,769 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2024-06-27 17:07:29,783 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:07:29,790 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@56db89fd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:07:29,790 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:07:29,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:07:29,807 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2024-06-27 17:07:29,808 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:07:29,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:29,809 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] [2024-06-27 17:07:29,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:29,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 618773252, now seen corresponding path program 1 times [2024-06-27 17:07:29,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819132661] [2024-06-27 17:07:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:29,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:30,276 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-27 17:07:30,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:30,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819132661] [2024-06-27 17:07:30,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819132661] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:07:30,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:07:30,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:07:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90450762] [2024-06-27 17:07:30,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:30,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:07:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:30,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:07:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:07:30,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:07:30,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 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-27 17:07:30,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:30,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:07:30,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:30,534 INFO L124 PetriNetUnfolderBase]: 378/600 cut-off events. [2024-06-27 17:07:30,534 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-06-27 17:07:30,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1183 conditions, 600 events. 378/600 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2170 event pairs, 251 based on Foata normal form. 0/519 useless extension candidates. Maximal degree in co-relation 993. Up to 520 conditions per place. [2024-06-27 17:07:30,545 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 27 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-06-27 17:07:30,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 148 flow [2024-06-27 17:07:30,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:07:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:07:30,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 17:07:30,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-06-27 17:07:30,558 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 60 transitions. [2024-06-27 17:07:30,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 148 flow [2024-06-27 17:07:30,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:07:30,564 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 88 flow [2024-06-27 17:07:30,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=88, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2024-06-27 17:07:30,569 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2024-06-27 17:07:30,569 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 88 flow [2024-06-27 17:07:30,570 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-27 17:07:30,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:30,570 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-27 17:07:30,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:07:30,571 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:30,572 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1165415527, now seen corresponding path program 1 times [2024-06-27 17:07:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090503632] [2024-06-27 17:07:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:30,772 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-27 17:07:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:30,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090503632] [2024-06-27 17:07:30,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090503632] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:07:30,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:07:30,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:07:30,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743923406] [2024-06-27 17:07:30,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:30,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:07:30,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:30,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:07:30,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:07:30,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:07:30,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-27 17:07:30,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:30,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:07:30,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:30,925 INFO L124 PetriNetUnfolderBase]: 378/602 cut-off events. [2024-06-27 17:07:30,926 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 17:07:30,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 602 events. 378/602 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2153 event pairs, 251 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1138. Up to 519 conditions per place. [2024-06-27 17:07:30,930 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 25 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-27 17:07:30,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 154 flow [2024-06-27 17:07:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:07:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:07:30,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-06-27 17:07:30,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2024-06-27 17:07:30,934 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 88 flow. Second operand 4 states and 73 transitions. [2024-06-27 17:07:30,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 154 flow [2024-06-27 17:07:30,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 150 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:07:30,937 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 112 flow [2024-06-27 17:07:30,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-06-27 17:07:30,938 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-06-27 17:07:30,938 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 112 flow [2024-06-27 17:07:30,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-27 17:07:30,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:30,939 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-27 17:07:30,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:07:30,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:30,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:30,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2009133342, now seen corresponding path program 1 times [2024-06-27 17:07:30,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:30,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243646579] [2024-06-27 17:07:30,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:31,152 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-27 17:07:31,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:31,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243646579] [2024-06-27 17:07:31,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243646579] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:07:31,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:07:31,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:07:31,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594042211] [2024-06-27 17:07:31,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:31,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:07:31,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:31,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:07:31,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:07:31,162 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:07:31,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 112 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-27 17:07:31,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:31,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:07:31,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:31,299 INFO L124 PetriNetUnfolderBase]: 513/895 cut-off events. [2024-06-27 17:07:31,299 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-06-27 17:07:31,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 895 events. 513/895 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3746 event pairs, 172 based on Foata normal form. 1/776 useless extension candidates. Maximal degree in co-relation 1597. Up to 361 conditions per place. [2024-06-27 17:07:31,306 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 40 selfloop transitions, 2 changer transitions 2/51 dead transitions. [2024-06-27 17:07:31,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 229 flow [2024-06-27 17:07:31,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:07:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:07:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-27 17:07:31,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-06-27 17:07:31,309 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 112 flow. Second operand 3 states and 72 transitions. [2024-06-27 17:07:31,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 229 flow [2024-06-27 17:07:31,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:07:31,312 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 123 flow [2024-06-27 17:07:31,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2024-06-27 17:07:31,313 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2024-06-27 17:07:31,313 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 123 flow [2024-06-27 17:07:31,313 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-27 17:07:31,314 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:31,314 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-27 17:07:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:07:31,314 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:31,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 2082098651, now seen corresponding path program 1 times [2024-06-27 17:07:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:31,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580533778] [2024-06-27 17:07:31,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:31,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:31,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:07:31,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580533778] [2024-06-27 17:07:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580533778] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817126873] [2024-06-27 17:07:31,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:31,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:31,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:07:31,497 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-27 17:07:31,524 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-27 17:07:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:31,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:07:31,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:07:31,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:07:31,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:07:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:07:31,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817126873] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:07:31,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:07:31,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-06-27 17:07:31,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912032004] [2024-06-27 17:07:31,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:07:31,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-06-27 17:07:31,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:31,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-06-27 17:07:31,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:07:31,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:07:31,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 123 flow. Second operand has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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-27 17:07:31,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:31,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:07:31,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:32,097 INFO L124 PetriNetUnfolderBase]: 899/1460 cut-off events. [2024-06-27 17:07:32,097 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-06-27 17:07:32,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 1460 events. 899/1460 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6211 event pairs, 398 based on Foata normal form. 0/1231 useless extension candidates. Maximal degree in co-relation 2092. Up to 681 conditions per place. [2024-06-27 17:07:32,105 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 36 selfloop transitions, 10 changer transitions 37/89 dead transitions. [2024-06-27 17:07:32,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 89 transitions, 430 flow [2024-06-27 17:07:32,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:07:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:07:32,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 164 transitions. [2024-06-27 17:07:32,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4672364672364672 [2024-06-27 17:07:32,110 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 123 flow. Second operand 9 states and 164 transitions. [2024-06-27 17:07:32,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 89 transitions, 430 flow [2024-06-27 17:07:32,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 428 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:07:32,115 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 173 flow [2024-06-27 17:07:32,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=173, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2024-06-27 17:07:32,117 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2024-06-27 17:07:32,118 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 173 flow [2024-06-27 17:07:32,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.0) internal successors, (144), 12 states have internal predecessors, (144), 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-27 17:07:32,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:32,119 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:07:32,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:07:32,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:32,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:32,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash 796655525, now seen corresponding path program 2 times [2024-06-27 17:07:32,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:32,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487378003] [2024-06-27 17:07:32,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:32,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:32,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:07:32,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487378003] [2024-06-27 17:07:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487378003] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310423636] [2024-06-27 17:07:32,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:07:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:07:32,498 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-27 17:07:32,515 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-27 17:07:32,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:07:32,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:07:32,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:07:32,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:07:32,723 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:07:32,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:07:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:07:32,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310423636] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:32,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:07:32,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2024-06-27 17:07:32,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139748049] [2024-06-27 17:07:32,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:32,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:07:32,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:32,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:07:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:07:32,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:07:32,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-27 17:07:32,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:32,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:07:32,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:32,945 INFO L124 PetriNetUnfolderBase]: 658/1128 cut-off events. [2024-06-27 17:07:32,945 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2024-06-27 17:07:32,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2314 conditions, 1128 events. 658/1128 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5091 event pairs, 267 based on Foata normal form. 0/997 useless extension candidates. Maximal degree in co-relation 2279. Up to 687 conditions per place. [2024-06-27 17:07:32,953 INFO L140 encePairwiseOnDemand]: 34/39 looper letters, 45 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2024-06-27 17:07:32,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 57 transitions, 313 flow [2024-06-27 17:07:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:07:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:07:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 105 transitions. [2024-06-27 17:07:32,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2024-06-27 17:07:32,955 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 173 flow. Second operand 6 states and 105 transitions. [2024-06-27 17:07:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 57 transitions, 313 flow [2024-06-27 17:07:32,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 57 transitions, 293 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 17:07:32,959 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 173 flow [2024-06-27 17:07:32,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-06-27 17:07:32,960 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2024-06-27 17:07:32,960 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 173 flow [2024-06-27 17:07:32,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-27 17:07:32,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:32,961 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:07:32,978 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-27 17:07:33,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:33,179 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:33,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 663959658, now seen corresponding path program 1 times [2024-06-27 17:07:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:33,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682045368] [2024-06-27 17:07:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:33,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:33,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:07:33,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682045368] [2024-06-27 17:07:33,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682045368] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:33,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126727967] [2024-06-27 17:07:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:33,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:33,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:07:33,310 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-27 17:07:33,331 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-27 17:07:33,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:33,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 7 conjunts are in the unsatisfiable core [2024-06-27 17:07:33,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:07:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:07:33,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:07:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:07:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126727967] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:33,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:07:33,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2024-06-27 17:07:33,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314662870] [2024-06-27 17:07:33,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:33,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:07:33,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:33,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:07:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:07:33,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:07:33,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-27 17:07:33,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:33,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:07:33,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:33,802 INFO L124 PetriNetUnfolderBase]: 968/1616 cut-off events. [2024-06-27 17:07:33,802 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2024-06-27 17:07:33,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 1616 events. 968/1616 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7561 event pairs, 324 based on Foata normal form. 0/1368 useless extension candidates. Maximal degree in co-relation 3608. Up to 692 conditions per place. [2024-06-27 17:07:33,814 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 45 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-06-27 17:07:33,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 57 transitions, 321 flow [2024-06-27 17:07:33,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:07:33,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:07:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2024-06-27 17:07:33,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4188034188034188 [2024-06-27 17:07:33,815 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 173 flow. Second operand 6 states and 98 transitions. [2024-06-27 17:07:33,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 57 transitions, 321 flow [2024-06-27 17:07:33,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 307 flow, removed 3 selfloop flow, removed 3 redundant places. [2024-06-27 17:07:33,820 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 188 flow [2024-06-27 17:07:33,820 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=188, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-06-27 17:07:33,821 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2024-06-27 17:07:33,821 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 188 flow [2024-06-27 17:07:33,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 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-27 17:07:33,821 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:33,822 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:07:33,842 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-27 17:07:34,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:34,040 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:34,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:34,040 INFO L85 PathProgramCache]: Analyzing trace with hash -378467664, now seen corresponding path program 1 times [2024-06-27 17:07:34,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:34,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781889338] [2024-06-27 17:07:34,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:34,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:34,302 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-06-27 17:07:34,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:34,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781889338] [2024-06-27 17:07:34,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781889338] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:07:34,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:07:34,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:07:34,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140705011] [2024-06-27 17:07:34,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:07:34,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:07:34,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:07:34,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:07:34,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:07:34,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2024-06-27 17:07:34,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-27 17:07:34,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:07:34,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2024-06-27 17:07:34,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:07:34,591 INFO L124 PetriNetUnfolderBase]: 1127/1737 cut-off events. [2024-06-27 17:07:34,592 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2024-06-27 17:07:34,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4335 conditions, 1737 events. 1127/1737 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6823 event pairs, 192 based on Foata normal form. 46/1677 useless extension candidates. Maximal degree in co-relation 4299. Up to 1224 conditions per place. [2024-06-27 17:07:34,603 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 70 selfloop transitions, 8 changer transitions 1/84 dead transitions. [2024-06-27 17:07:34,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 472 flow [2024-06-27 17:07:34,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:07:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:07:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2024-06-27 17:07:34,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47435897435897434 [2024-06-27 17:07:34,608 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 188 flow. Second operand 6 states and 111 transitions. [2024-06-27 17:07:34,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 472 flow [2024-06-27 17:07:34,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 84 transitions, 461 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-06-27 17:07:34,614 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 238 flow [2024-06-27 17:07:34,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2024-06-27 17:07:34,615 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 20 predicate places. [2024-06-27 17:07:34,615 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 238 flow [2024-06-27 17:07:34,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-27 17:07:34,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:07:34,616 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:07:34,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:07:34,616 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:07:34,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:07:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash 851671984, now seen corresponding path program 2 times [2024-06-27 17:07:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:07:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273124188] [2024-06-27 17:07:34,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:07:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:07:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:07:36,604 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:07:36,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:07:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273124188] [2024-06-27 17:07:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273124188] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:07:36,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699594190] [2024-06-27 17:07:36,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:07:36,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:07:36,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:07:36,607 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-27 17:07:36,608 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-27 17:07:36,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:07:36,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:07:36,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 39 conjunts are in the unsatisfiable core [2024-06-27 17:07:36,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:07:37,515 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2024-06-27 17:07:37,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 117 treesize of output 93 [2024-06-27 17:09:17,054 WARN L293 SmtUtils]: Spent 1.54m on a formula simplification that was a NOOP. DAG size: 3268 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-06-27 17:09:17,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:09:17,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 66 select indices, 66 select index equivalence classes, 1 disjoint index pairs (out of 2145 index pairs), introduced 66 new quantified variables, introduced 2145 case distinctions, treesize of input 1962 treesize of output 9262 [2024-06-27 17:14:06,669 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-27 17:14:06,670 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-27 17:14:06,671 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-06-27 17:14:06,683 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-27 17:14:06,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:14:06,877 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.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.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.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) 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) ... 67 more [2024-06-27 17:14:06,881 INFO L158 Benchmark]: Toolchain (without parser) took 398606.68ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 105.2MB in the beginning and 857.6MB in the end (delta: -752.4MB). Peak memory consumption was 901.9MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,881 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:14:06,882 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.89ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 138.1MB in the end (delta: -32.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,882 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.19ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,882 INFO L158 Benchmark]: Boogie Preprocessor took 72.68ms. Allocated memory is still 172.0MB. Free memory was 136.0MB in the beginning and 132.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,883 INFO L158 Benchmark]: RCFGBuilder took 928.28ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 110.4MB in the end (delta: 22.1MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,883 INFO L158 Benchmark]: TraceAbstraction took 397266.85ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 110.4MB in the beginning and 857.6MB in the end (delta: -747.3MB). Peak memory consumption was 907.2MB. Max. memory is 16.1GB. [2024-06-27 17:14:06,884 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.16ms. Allocated memory is still 92.3MB. Free memory is still 44.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.89ms. Allocated memory is still 172.0MB. Free memory was 105.2MB in the beginning and 138.1MB in the end (delta: -32.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.19ms. Allocated memory is still 172.0MB. Free memory was 138.1MB in the beginning and 136.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.68ms. Allocated memory is still 172.0MB. Free memory was 136.0MB in the beginning and 132.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 928.28ms. Allocated memory is still 172.0MB. Free memory was 132.5MB in the beginning and 110.4MB in the end (delta: 22.1MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * TraceAbstraction took 397266.85ms. Allocated memory was 172.0MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 110.4MB in the beginning and 857.6MB in the end (delta: -747.3MB). Peak memory consumption was 907.2MB. 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:14:08,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:14:09,044 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-06-27 17:14:09,050 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:14:09,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:14:09,083 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:14:09,084 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:14:09,084 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:14:09,085 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:14:09,089 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:14:09,089 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:14:09,090 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:14:09,090 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:14:09,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:14:09,092 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:14:09,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:14:09,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:14:09,093 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:14:09,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:14:09,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:14:09,094 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:14:09,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:14:09,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:14:09,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-06-27 17:14:09,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-06-27 17:14:09,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:14:09,096 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-06-27 17:14:09,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:14:09,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:14:09,097 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:14:09,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:14:09,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:14:09,098 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:14:09,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:14:09,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:14:09,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:14:09,100 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:14:09,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:14:09,100 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-06-27 17:14:09,101 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-06-27 17:14:09,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:14:09,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:14:09,101 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:14:09,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:14:09,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:14:09,102 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-06-27 17:14:09,102 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 632917bb2a5e88c193ba7761220e89039206b92cb89d98172ae8e9ad69d27ca8 [2024-06-27 17:14:09,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:14:09,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:14:09,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:14:09,467 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:14:09,468 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:14:09,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2024-06-27 17:14:10,636 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:14:10,834 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:14:10,835 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2024-06-27 17:14:10,848 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07fc1543c/7d83a7531b3f478ba87645c1f1e70490/FLAG1b4c24a29 [2024-06-27 17:14:10,864 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07fc1543c/7d83a7531b3f478ba87645c1f1e70490 [2024-06-27 17:14:10,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:14:10,867 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:14:10,870 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:14:10,870 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:14:10,876 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:14:10,877 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:14:10" (1/1) ... [2024-06-27 17:14:10,878 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eccbb48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:10, skipping insertion in model container [2024-06-27 17:14:10,878 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:14:10" (1/1) ... [2024-06-27 17:14:10,904 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:14:11,149 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-three-array-min.wvr.c[2854,2867] [2024-06-27 17:14:11,175 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:14:11,188 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-06-27 17:14:11,193 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:14:11,221 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-three-array-min.wvr.c[2854,2867] [2024-06-27 17:14:11,227 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:14:11,241 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:14:11,261 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-three-array-min.wvr.c[2854,2867] [2024-06-27 17:14:11,264 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:14:11,285 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:14:11,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11 WrapperNode [2024-06-27 17:14:11,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:14:11,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:14:11,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:14:11,287 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:14:11,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,355 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 215 [2024-06-27 17:14:11,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:14:11,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:14:11,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:14:11,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:14:11,368 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,409 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2024-06-27 17:14:11,415 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:14:11,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:14:11,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:14:11,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:14:11,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (1/1) ... [2024-06-27 17:14:11,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:14:11,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:14:11,496 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-27 17:14:11,500 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-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-06-27 17:14:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-06-27 17:14:11,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-06-27 17:14:11,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-06-27 17:14:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:14:11,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-06-27 17:14:11,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-06-27 17:14:11,552 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:14:11,658 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:14:11,661 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:14:12,204 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:14:12,205 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:14:12,602 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:14:12,603 INFO L320 CfgBuilder]: Removed 6 assume(true) statements. [2024-06-27 17:14:12,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:14:12 BoogieIcfgContainer [2024-06-27 17:14:12,604 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:14:12,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:14:12,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:14:12,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:14:12,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:14:10" (1/3) ... [2024-06-27 17:14:12,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa218b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:14:12, skipping insertion in model container [2024-06-27 17:14:12,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:14:11" (2/3) ... [2024-06-27 17:14:12,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa218b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:14:12, skipping insertion in model container [2024-06-27 17:14:12,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:14:12" (3/3) ... [2024-06-27 17:14:12,613 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2024-06-27 17:14:12,621 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:14:12,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:14:12,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-06-27 17:14:12,630 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:14:12,691 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-06-27 17:14:12,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 99 flow [2024-06-27 17:14:12,764 INFO L124 PetriNetUnfolderBase]: 7/36 cut-off events. [2024-06-27 17:14:12,764 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:14:12,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 36 events. 7/36 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-06-27 17:14:12,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 39 transitions, 99 flow [2024-06-27 17:14:12,774 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 35 transitions, 88 flow [2024-06-27 17:14:12,786 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:14:12,792 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@1087289d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:14:12,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-27 17:14:12,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:14:12,813 INFO L124 PetriNetUnfolderBase]: 7/34 cut-off events. [2024-06-27 17:14:12,813 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:14:12,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:12,814 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] [2024-06-27 17:14:12,814 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:12,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1156858442, now seen corresponding path program 1 times [2024-06-27 17:14:12,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:12,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1598493937] [2024-06-27 17:14:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:12,834 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-27 17:14:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:12,840 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-27 17:14:12,868 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-27 17:14:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:12,993 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:14:12,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:13,056 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-27 17:14:13,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:13,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:13,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1598493937] [2024-06-27 17:14:13,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1598493937] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:13,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:13,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:14:13,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937595017] [2024-06-27 17:14:13,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:13,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:14:13,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:13,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:14:13,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:14:13,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:13,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 35 transitions, 88 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-27 17:14:13,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:13,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:13,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:13,335 INFO L124 PetriNetUnfolderBase]: 362/620 cut-off events. [2024-06-27 17:14:13,336 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2024-06-27 17:14:13,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1171 conditions, 620 events. 362/620 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2534 event pairs, 230 based on Foata normal form. 0/543 useless extension candidates. Maximal degree in co-relation 993. Up to 492 conditions per place. [2024-06-27 17:14:13,344 INFO L140 encePairwiseOnDemand]: 36/39 looper letters, 27 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2024-06-27 17:14:13,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 36 transitions, 148 flow [2024-06-27 17:14:13,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:14:13,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:14:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-06-27 17:14:13,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2024-06-27 17:14:13,358 INFO L175 Difference]: Start difference. First operand has 38 places, 35 transitions, 88 flow. Second operand 3 states and 60 transitions. [2024-06-27 17:14:13,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 36 transitions, 148 flow [2024-06-27 17:14:13,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 36 transitions, 136 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-06-27 17:14:13,363 INFO L231 Difference]: Finished difference. Result has 35 places, 36 transitions, 88 flow [2024-06-27 17:14:13,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=88, PETRI_PLACES=35, PETRI_TRANSITIONS=36} [2024-06-27 17:14:13,368 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -3 predicate places. [2024-06-27 17:14:13,368 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 36 transitions, 88 flow [2024-06-27 17:14:13,368 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-27 17:14:13,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:13,368 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-27 17:14:13,382 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-27 17:14:13,573 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-27 17:14:13,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:13,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash -704773501, now seen corresponding path program 1 times [2024-06-27 17:14:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:13,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033328615] [2024-06-27 17:14:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:13,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-27 17:14:13,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:13,600 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-27 17:14:13,601 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-27 17:14:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:13,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 17:14:13,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:13,803 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-27 17:14:13,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:13,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:13,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033328615] [2024-06-27 17:14:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033328615] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:14:13,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202050917] [2024-06-27 17:14:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:13,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:14:13,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:13,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:14:13,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:14:13,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:13,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 36 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-27 17:14:13,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:13,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:13,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:14,013 INFO L124 PetriNetUnfolderBase]: 362/622 cut-off events. [2024-06-27 17:14:14,014 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-06-27 17:14:14,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1141 conditions, 622 events. 362/622 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2523 event pairs, 230 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 1130. Up to 491 conditions per place. [2024-06-27 17:14:14,023 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 25 selfloop transitions, 6 changer transitions 0/38 dead transitions. [2024-06-27 17:14:14,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 154 flow [2024-06-27 17:14:14,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:14:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:14:14,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-06-27 17:14:14,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46794871794871795 [2024-06-27 17:14:14,026 INFO L175 Difference]: Start difference. First operand has 35 places, 36 transitions, 88 flow. Second operand 4 states and 73 transitions. [2024-06-27 17:14:14,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 154 flow [2024-06-27 17:14:14,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 150 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:14,029 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 112 flow [2024-06-27 17:14:14,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-06-27 17:14:14,029 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2024-06-27 17:14:14,030 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 112 flow [2024-06-27 17:14:14,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-27 17:14:14,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:14,030 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-27 17:14:14,039 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-27 17:14:14,234 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-27 17:14:14,235 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:14,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:14,235 INFO L85 PathProgramCache]: Analyzing trace with hash -857230324, now seen corresponding path program 1 times [2024-06-27 17:14:14,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:14,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670692888] [2024-06-27 17:14:14,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:14,236 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-27 17:14:14,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:14,237 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-27 17:14:14,240 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-27 17:14:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:14,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-27 17:14:14,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:14,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:14:14,767 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 124 treesize of output 252 [2024-06-27 17:14:15,177 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-27 17:14:15,177 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:15,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:15,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670692888] [2024-06-27 17:14:15,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670692888] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:15,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:15,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:14:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354762025] [2024-06-27 17:14:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:15,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:14:15,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:15,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:14:15,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:14:15,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:15,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 112 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-27 17:14:15,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:15,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:15,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:15,523 INFO L124 PetriNetUnfolderBase]: 638/1046 cut-off events. [2024-06-27 17:14:15,523 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-06-27 17:14:15,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1953 conditions, 1046 events. 638/1046 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4676 event pairs, 172 based on Foata normal form. 1/910 useless extension candidates. Maximal degree in co-relation 1933. Up to 535 conditions per place. [2024-06-27 17:14:15,530 INFO L140 encePairwiseOnDemand]: 35/39 looper letters, 45 selfloop transitions, 3 changer transitions 1/56 dead transitions. [2024-06-27 17:14:15,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 56 transitions, 251 flow [2024-06-27 17:14:15,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:14:15,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:14:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-06-27 17:14:15,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6581196581196581 [2024-06-27 17:14:15,541 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 112 flow. Second operand 3 states and 77 transitions. [2024-06-27 17:14:15,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 56 transitions, 251 flow [2024-06-27 17:14:15,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 250 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:15,544 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 130 flow [2024-06-27 17:14:15,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2024-06-27 17:14:15,545 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2024-06-27 17:14:15,546 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 130 flow [2024-06-27 17:14:15,546 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-27 17:14:15,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:15,547 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] [2024-06-27 17:14:15,554 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-27 17:14:15,754 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-27 17:14:15,754 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:15,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -234772775, now seen corresponding path program 1 times [2024-06-27 17:14:15,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:15,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311587646] [2024-06-27 17:14:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:15,756 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-27 17:14:15,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:15,757 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-27 17:14:15,758 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-27 17:14:15,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:15,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:14:15,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:14:16,071 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:14:16,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:16,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311587646] [2024-06-27 17:14:16,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311587646] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:16,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 17:14:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76102326] [2024-06-27 17:14:16,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:16,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:14:16,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:14:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:14:16,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:16,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 130 flow. Second operand has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 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-27 17:14:16,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:16,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:16,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:17,179 INFO L124 PetriNetUnfolderBase]: 1513/2722 cut-off events. [2024-06-27 17:14:17,180 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-06-27 17:14:17,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 2722 events. 1513/2722 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16338 event pairs, 784 based on Foata normal form. 117/2680 useless extension candidates. Maximal degree in co-relation 3693. Up to 815 conditions per place. [2024-06-27 17:14:17,195 INFO L140 encePairwiseOnDemand]: 29/39 looper letters, 96 selfloop transitions, 20 changer transitions 0/123 dead transitions. [2024-06-27 17:14:17,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 123 transitions, 602 flow [2024-06-27 17:14:17,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:14:17,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:14:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 233 transitions. [2024-06-27 17:14:17,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49786324786324787 [2024-06-27 17:14:17,199 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 130 flow. Second operand 12 states and 233 transitions. [2024-06-27 17:14:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 123 transitions, 602 flow [2024-06-27 17:14:17,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 123 transitions, 595 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:17,203 INFO L231 Difference]: Finished difference. Result has 55 places, 55 transitions, 272 flow [2024-06-27 17:14:17,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=272, PETRI_PLACES=55, PETRI_TRANSITIONS=55} [2024-06-27 17:14:17,204 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2024-06-27 17:14:17,204 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 55 transitions, 272 flow [2024-06-27 17:14:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.3) internal successors, (143), 10 states have internal predecessors, (143), 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-27 17:14:17,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:17,205 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:17,212 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 (5)] Ended with exit code 0 [2024-06-27 17:14:17,409 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-27 17:14:17,409 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:17,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:17,410 INFO L85 PathProgramCache]: Analyzing trace with hash -929425129, now seen corresponding path program 2 times [2024-06-27 17:14:17,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:17,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121139925] [2024-06-27 17:14:17,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:14:17,411 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-27 17:14:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:17,413 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-27 17:14:17,414 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-27 17:14:17,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:14:17,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:17,626 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:14:17,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:17,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:17,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121139925] [2024-06-27 17:14:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121139925] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:17,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 17:14:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711992156] [2024-06-27 17:14:17,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:17,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:14:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:14:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:14:17,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:14:17,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 55 transitions, 272 flow. Second operand has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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-27 17:14:17,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:17,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:14:17,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:18,761 INFO L124 PetriNetUnfolderBase]: 1734/2775 cut-off events. [2024-06-27 17:14:18,762 INFO L125 PetriNetUnfolderBase]: For 1751/1751 co-relation queries the response was YES. [2024-06-27 17:14:18,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6484 conditions, 2775 events. 1734/2775 cut-off events. For 1751/1751 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13968 event pairs, 544 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 4598. Up to 637 conditions per place. [2024-06-27 17:14:18,780 INFO L140 encePairwiseOnDemand]: 28/39 looper letters, 84 selfloop transitions, 20 changer transitions 0/110 dead transitions. [2024-06-27 17:14:18,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 110 transitions, 636 flow [2024-06-27 17:14:18,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:14:18,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:14:18,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 189 transitions. [2024-06-27 17:14:18,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2024-06-27 17:14:18,784 INFO L175 Difference]: Start difference. First operand has 55 places, 55 transitions, 272 flow. Second operand 10 states and 189 transitions. [2024-06-27 17:14:18,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 110 transitions, 636 flow [2024-06-27 17:14:18,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 110 transitions, 600 flow, removed 12 selfloop flow, removed 3 redundant places. [2024-06-27 17:14:18,790 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 279 flow [2024-06-27 17:14:18,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=279, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2024-06-27 17:14:18,793 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 23 predicate places. [2024-06-27 17:14:18,793 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 279 flow [2024-06-27 17:14:18,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.2) internal successors, (132), 10 states have internal predecessors, (132), 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-27 17:14:18,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:18,794 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-27 17:14:18,808 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-27 17:14:19,008 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-27 17:14:19,010 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:19,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:19,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1866892361, now seen corresponding path program 1 times [2024-06-27 17:14:19,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:19,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599669318] [2024-06-27 17:14:19,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:19,012 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-27 17:14:19,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:19,013 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-27 17:14:19,016 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-27 17:14:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:19,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2024-06-27 17:14:19,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:14:19,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:19,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:19,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599669318] [2024-06-27 17:14:19,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599669318] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:19,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:14:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275395676] [2024-06-27 17:14:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:19,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:14:19,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:19,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:14:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:14:19,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 39 [2024-06-27 17:14:19,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-27 17:14:19,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:19,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 39 [2024-06-27 17:14:19,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:20,105 INFO L124 PetriNetUnfolderBase]: 2529/3873 cut-off events. [2024-06-27 17:14:20,105 INFO L125 PetriNetUnfolderBase]: For 2554/2554 co-relation queries the response was YES. [2024-06-27 17:14:20,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9958 conditions, 3873 events. 2529/3873 cut-off events. For 2554/2554 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 18867 event pairs, 469 based on Foata normal form. 0/3767 useless extension candidates. Maximal degree in co-relation 6152. Up to 2262 conditions per place. [2024-06-27 17:14:20,128 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 94 selfloop transitions, 10 changer transitions 7/116 dead transitions. [2024-06-27 17:14:20,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 116 transitions, 734 flow [2024-06-27 17:14:20,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:14:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:14:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 115 transitions. [2024-06-27 17:14:20,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49145299145299143 [2024-06-27 17:14:20,131 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 279 flow. Second operand 6 states and 115 transitions. [2024-06-27 17:14:20,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 116 transitions, 734 flow [2024-06-27 17:14:20,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 704 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-06-27 17:14:20,136 INFO L231 Difference]: Finished difference. Result has 66 places, 64 transitions, 323 flow [2024-06-27 17:14:20,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=323, PETRI_PLACES=66, PETRI_TRANSITIONS=64} [2024-06-27 17:14:20,137 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 28 predicate places. [2024-06-27 17:14:20,137 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 64 transitions, 323 flow [2024-06-27 17:14:20,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 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-27 17:14:20,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:20,138 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:20,150 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-27 17:14:20,350 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-27 17:14:20,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:20,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1411649639, now seen corresponding path program 1 times [2024-06-27 17:14:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:20,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157972225] [2024-06-27 17:14:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:20,352 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-27 17:14:20,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:20,353 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-27 17:14:20,354 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-27 17:14:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:20,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:14:20,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 17:14:20,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 17:14:20,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157972225] [2024-06-27 17:14:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157972225] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:20,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-06-27 17:14:20,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433227723] [2024-06-27 17:14:20,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:20,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-06-27 17:14:20,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:20,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-06-27 17:14:20,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-06-27 17:14:20,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:14:20,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 64 transitions, 323 flow. Second operand has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-27 17:14:20,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:20,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:14:20,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:22,490 INFO L124 PetriNetUnfolderBase]: 2988/5124 cut-off events. [2024-06-27 17:14:22,491 INFO L125 PetriNetUnfolderBase]: For 4281/4328 co-relation queries the response was YES. [2024-06-27 17:14:22,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14505 conditions, 5124 events. 2988/5124 cut-off events. For 4281/4328 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 32158 event pairs, 458 based on Foata normal form. 0/4890 useless extension candidates. Maximal degree in co-relation 10679. Up to 912 conditions per place. [2024-06-27 17:14:22,529 INFO L140 encePairwiseOnDemand]: 31/39 looper letters, 187 selfloop transitions, 34 changer transitions 0/233 dead transitions. [2024-06-27 17:14:22,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 233 transitions, 1455 flow [2024-06-27 17:14:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 17:14:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 17:14:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 273 transitions. [2024-06-27 17:14:22,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2024-06-27 17:14:22,533 INFO L175 Difference]: Start difference. First operand has 66 places, 64 transitions, 323 flow. Second operand 13 states and 273 transitions. [2024-06-27 17:14:22,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 233 transitions, 1455 flow [2024-06-27 17:14:22,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 233 transitions, 1455 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:14:22,549 INFO L231 Difference]: Finished difference. Result has 89 places, 96 transitions, 626 flow [2024-06-27 17:14:22,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=626, PETRI_PLACES=89, PETRI_TRANSITIONS=96} [2024-06-27 17:14:22,550 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 51 predicate places. [2024-06-27 17:14:22,550 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 96 transitions, 626 flow [2024-06-27 17:14:22,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.272727272727273) internal successors, (146), 11 states have internal predecessors, (146), 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-27 17:14:22,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:22,551 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:22,559 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-27 17:14:22,754 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-27 17:14:22,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:22,755 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:22,756 INFO L85 PathProgramCache]: Analyzing trace with hash 721049687, now seen corresponding path program 2 times [2024-06-27 17:14:22,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:22,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69070185] [2024-06-27 17:14:22,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:14:22,756 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-27 17:14:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:22,757 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-27 17:14:22,758 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-27 17:14:22,996 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:14:22,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:23,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 17:14:23,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:23,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:23,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 17:14:23,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [69070185] [2024-06-27 17:14:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [69070185] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:14:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:14:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-06-27 17:14:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774968933] [2024-06-27 17:14:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:23,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:14:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:23,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:14:23,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:14:23,234 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-06-27 17:14:23,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 96 transitions, 626 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-27 17:14:23,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:23,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-06-27 17:14:23,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:24,376 INFO L124 PetriNetUnfolderBase]: 4300/7120 cut-off events. [2024-06-27 17:14:24,377 INFO L125 PetriNetUnfolderBase]: For 25453/25515 co-relation queries the response was YES. [2024-06-27 17:14:24,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27330 conditions, 7120 events. 4300/7120 cut-off events. For 25453/25515 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 43414 event pairs, 328 based on Foata normal form. 151/7236 useless extension candidates. Maximal degree in co-relation 21551. Up to 2745 conditions per place. [2024-06-27 17:14:24,440 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 162 selfloop transitions, 42 changer transitions 5/218 dead transitions. [2024-06-27 17:14:24,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 218 transitions, 1905 flow [2024-06-27 17:14:24,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-06-27 17:14:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-06-27 17:14:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 138 transitions. [2024-06-27 17:14:24,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2024-06-27 17:14:24,443 INFO L175 Difference]: Start difference. First operand has 89 places, 96 transitions, 626 flow. Second operand 7 states and 138 transitions. [2024-06-27 17:14:24,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 218 transitions, 1905 flow [2024-06-27 17:14:24,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 218 transitions, 1778 flow, removed 63 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:24,542 INFO L231 Difference]: Finished difference. Result has 99 places, 124 transitions, 985 flow [2024-06-27 17:14:24,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=985, PETRI_PLACES=99, PETRI_TRANSITIONS=124} [2024-06-27 17:14:24,544 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 61 predicate places. [2024-06-27 17:14:24,544 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 124 transitions, 985 flow [2024-06-27 17:14:24,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-27 17:14:24,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:24,545 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:24,555 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-27 17:14:24,748 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-27 17:14:24,749 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:24,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:24,750 INFO L85 PathProgramCache]: Analyzing trace with hash 377777703, now seen corresponding path program 3 times [2024-06-27 17:14:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:24,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150021765] [2024-06-27 17:14:24,751 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:14:24,751 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-27 17:14:24,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:24,753 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-27 17:14:24,766 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-27 17:14:25,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:14:25,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:25,016 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 17:14:25,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 17:14:25,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:25,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:25,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150021765] [2024-06-27 17:14:25,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150021765] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:25,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:25,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:14:25,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317595765] [2024-06-27 17:14:25,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:25,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:14:25,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:25,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:14:25,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:14:25,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:25,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 124 transitions, 985 flow. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-27 17:14:25,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:25,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:25,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:26,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L62-->L65: Formula: (let ((.cse2 (bvmul (_ bv4 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|))) (let ((.cse0 (let ((.cse4 (select |v_#memory_int#1_144| v_~A~0.base_106))) (concat (concat (concat (select .cse4 (bvadd .cse2 (_ bv3 32) v_~A~0.offset_106)) (select .cse4 (bvadd .cse2 (_ bv2 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 (_ bv1 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 v_~A~0.offset_106)))))) (let ((.cse1 (bvadd (bvmul (_ bv4294967295 32) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (and (not (= (ite (or (bvsle .cse0 (bvadd (bvneg .cse1) (_ bv2147483647 32))) (bvsle .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= (store |v_#memory_int#1_144| v_~C~0.base_60 (store (store (store (store (select |v_#memory_int#1_144| v_~C~0.base_60) (bvadd .cse2 v_~C~0.offset_60) ((_ extract 7 0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv1 32)) ((_ extract 15 8) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv2 32)) ((_ extract 23 16) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv3 32)) ((_ extract 31 24) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) |v_#memory_int#1_143|) (= (bvadd (_ bv1 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|) v_~p~0_33) (= (bvadd (let ((.cse3 (select |v_#memory_int#1_144| v_~B~0.base_94))) (concat (concat (concat (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv3 32))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv2 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv1 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2)))) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (bvsge ((_ sign_extend 32) .cse0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))))))) InVars {~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, ~C~0.base=v_~C~0.base_60, ~C~0.offset=v_~C~0.offset_60, #memory_int#1=|v_#memory_int#1_144|, ~B~0.offset=v_~B~0.offset_94} OutVars{~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_60, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, ~C~0.offset=v_~C~0.offset_60, ~p~0=v_~p~0_33, ~B~0.offset=v_~B~0.offset_94, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #memory_int#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][140], [Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), 37#L65true, 29#L77-1true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 597#true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0)))]) [2024-06-27 17:14:26,300 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:26,300 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:26,300 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:26,300 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:26,370 INFO L124 PetriNetUnfolderBase]: 4283/7384 cut-off events. [2024-06-27 17:14:26,370 INFO L125 PetriNetUnfolderBase]: For 33331/33666 co-relation queries the response was YES. [2024-06-27 17:14:26,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30325 conditions, 7384 events. 4283/7384 cut-off events. For 33331/33666 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 49042 event pairs, 1110 based on Foata normal form. 89/7266 useless extension candidates. Maximal degree in co-relation 23898. Up to 2605 conditions per place. [2024-06-27 17:14:26,527 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 123 selfloop transitions, 39 changer transitions 0/201 dead transitions. [2024-06-27 17:14:26,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 201 transitions, 1832 flow [2024-06-27 17:14:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:14:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:14:26,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-27 17:14:26,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2024-06-27 17:14:26,530 INFO L175 Difference]: Start difference. First operand has 99 places, 124 transitions, 985 flow. Second operand 6 states and 123 transitions. [2024-06-27 17:14:26,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 201 transitions, 1832 flow [2024-06-27 17:14:26,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 201 transitions, 1832 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:14:26,693 INFO L231 Difference]: Finished difference. Result has 107 places, 146 transitions, 1342 flow [2024-06-27 17:14:26,693 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=985, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1342, PETRI_PLACES=107, PETRI_TRANSITIONS=146} [2024-06-27 17:14:26,694 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 69 predicate places. [2024-06-27 17:14:26,694 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 146 transitions, 1342 flow [2024-06-27 17:14:26,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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-27 17:14:26,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:26,695 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:26,704 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-27 17:14:26,902 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-27 17:14:26,902 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:26,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:26,903 INFO L85 PathProgramCache]: Analyzing trace with hash 214851595, now seen corresponding path program 4 times [2024-06-27 17:14:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308969129] [2024-06-27 17:14:26,903 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:14:26,903 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-27 17:14:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:26,904 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-27 17:14:26,906 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-27 17:14:27,110 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:14:27,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:27,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 17:14:27,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:27,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-06-27 17:14:27,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:27,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308969129] [2024-06-27 17:14:27,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308969129] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:14:27,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:14:27,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-06-27 17:14:27,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895065907] [2024-06-27 17:14:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:27,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:14:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:27,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:14:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-06-27 17:14:27,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-06-27 17:14:27,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 146 transitions, 1342 flow. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-27 17:14:27,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:27,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-06-27 17:14:27,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:28,954 INFO L124 PetriNetUnfolderBase]: 7063/11296 cut-off events. [2024-06-27 17:14:28,954 INFO L125 PetriNetUnfolderBase]: For 81338/81645 co-relation queries the response was YES. [2024-06-27 17:14:28,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52954 conditions, 11296 events. 7063/11296 cut-off events. For 81338/81645 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 70944 event pairs, 1387 based on Foata normal form. 203/11420 useless extension candidates. Maximal degree in co-relation 40468. Up to 3829 conditions per place. [2024-06-27 17:14:29,043 INFO L140 encePairwiseOnDemand]: 32/39 looper letters, 218 selfloop transitions, 95 changer transitions 0/322 dead transitions. [2024-06-27 17:14:29,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 322 transitions, 3626 flow [2024-06-27 17:14:29,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:14:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:14:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2024-06-27 17:14:29,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5470085470085471 [2024-06-27 17:14:29,046 INFO L175 Difference]: Start difference. First operand has 107 places, 146 transitions, 1342 flow. Second operand 6 states and 128 transitions. [2024-06-27 17:14:29,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 322 transitions, 3626 flow [2024-06-27 17:14:29,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 322 transitions, 3625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:29,433 INFO L231 Difference]: Finished difference. Result has 116 places, 202 transitions, 2405 flow [2024-06-27 17:14:29,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=1341, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2405, PETRI_PLACES=116, PETRI_TRANSITIONS=202} [2024-06-27 17:14:29,434 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 78 predicate places. [2024-06-27 17:14:29,434 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 202 transitions, 2405 flow [2024-06-27 17:14:29,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-27 17:14:29,435 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:29,435 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:29,445 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 (11)] Forceful destruction successful, exit code 0 [2024-06-27 17:14:29,641 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-27 17:14:29,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:29,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash -956829223, now seen corresponding path program 5 times [2024-06-27 17:14:29,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:29,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105920362] [2024-06-27 17:14:29,643 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:14:29,643 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-27 17:14:29,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:29,644 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-27 17:14:29,644 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-27 17:14:29,928 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:14:29,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:29,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 17:14:29,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:30,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:30,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-06-27 17:14:30,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:30,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105920362] [2024-06-27 17:14:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105920362] provided 1 perfect and 1 imperfect interpolant sequences [2024-06-27 17:14:30,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-06-27 17:14:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-06-27 17:14:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416534905] [2024-06-27 17:14:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:30,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:14:30,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:30,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:14:30,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-06-27 17:14:30,225 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-06-27 17:14:30,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 202 transitions, 2405 flow. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-27 17:14:30,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:30,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-06-27 17:14:30,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:32,190 INFO L124 PetriNetUnfolderBase]: 6972/11229 cut-off events. [2024-06-27 17:14:32,190 INFO L125 PetriNetUnfolderBase]: For 109811/110203 co-relation queries the response was YES. [2024-06-27 17:14:32,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58543 conditions, 11229 events. 6972/11229 cut-off events. For 109811/110203 co-relation queries the response was YES. Maximal size of possible extension queue 406. Compared 71101 event pairs, 1338 based on Foata normal form. 78/11204 useless extension candidates. Maximal degree in co-relation 44952. Up to 6416 conditions per place. [2024-06-27 17:14:32,278 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 187 selfloop transitions, 62 changer transitions 30/288 dead transitions. [2024-06-27 17:14:32,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 288 transitions, 3732 flow [2024-06-27 17:14:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-27 17:14:32,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-27 17:14:32,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-06-27 17:14:32,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5230769230769231 [2024-06-27 17:14:32,280 INFO L175 Difference]: Start difference. First operand has 116 places, 202 transitions, 2405 flow. Second operand 5 states and 102 transitions. [2024-06-27 17:14:32,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 288 transitions, 3732 flow [2024-06-27 17:14:32,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 288 transitions, 3728 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-06-27 17:14:32,630 INFO L231 Difference]: Finished difference. Result has 124 places, 213 transitions, 2841 flow [2024-06-27 17:14:32,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2401, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2841, PETRI_PLACES=124, PETRI_TRANSITIONS=213} [2024-06-27 17:14:32,631 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 86 predicate places. [2024-06-27 17:14:32,631 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 213 transitions, 2841 flow [2024-06-27 17:14:32,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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-27 17:14:32,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:32,632 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:32,639 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-27 17:14:32,838 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-27 17:14:32,838 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:32,838 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:32,839 INFO L85 PathProgramCache]: Analyzing trace with hash -879811807, now seen corresponding path program 6 times [2024-06-27 17:14:32,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:32,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261517827] [2024-06-27 17:14:32,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 17:14:32,839 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-27 17:14:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:32,841 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-27 17:14:32,843 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-27 17:14:33,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-06-27 17:14:33,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:33,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 17:14:33,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:33,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:33,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-06-27 17:14:33,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:33,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261517827] [2024-06-27 17:14:33,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261517827] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:33,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-06-27 17:14:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308591962] [2024-06-27 17:14:33,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:33,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-06-27 17:14:33,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:33,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-06-27 17:14:33,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-06-27 17:14:33,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 39 [2024-06-27 17:14:33,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 213 transitions, 2841 flow. Second operand has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 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-27 17:14:33,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:33,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 39 [2024-06-27 17:14:33,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:37,208 INFO L124 PetriNetUnfolderBase]: 9068/14531 cut-off events. [2024-06-27 17:14:37,208 INFO L125 PetriNetUnfolderBase]: For 177401/177815 co-relation queries the response was YES. [2024-06-27 17:14:37,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76651 conditions, 14531 events. 9068/14531 cut-off events. For 177401/177815 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 95365 event pairs, 1085 based on Foata normal form. 307/14750 useless extension candidates. Maximal degree in co-relation 64905. Up to 4244 conditions per place. [2024-06-27 17:14:37,336 INFO L140 encePairwiseOnDemand]: 23/39 looper letters, 321 selfloop transitions, 193 changer transitions 2/525 dead transitions. [2024-06-27 17:14:37,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 525 transitions, 7646 flow [2024-06-27 17:14:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-27 17:14:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-27 17:14:37,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 279 transitions. [2024-06-27 17:14:37,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2024-06-27 17:14:37,339 INFO L175 Difference]: Start difference. First operand has 124 places, 213 transitions, 2841 flow. Second operand 15 states and 279 transitions. [2024-06-27 17:14:37,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 525 transitions, 7646 flow [2024-06-27 17:14:38,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 525 transitions, 7566 flow, removed 40 selfloop flow, removed 1 redundant places. [2024-06-27 17:14:38,101 INFO L231 Difference]: Finished difference. Result has 142 places, 336 transitions, 5686 flow [2024-06-27 17:14:38,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=5686, PETRI_PLACES=142, PETRI_TRANSITIONS=336} [2024-06-27 17:14:38,102 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 104 predicate places. [2024-06-27 17:14:38,102 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 336 transitions, 5686 flow [2024-06-27 17:14:38,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 11.375) internal successors, (182), 16 states have internal predecessors, (182), 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-27 17:14:38,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:38,103 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, 1, 1, 1] [2024-06-27 17:14:38,108 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-27 17:14:38,303 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-27 17:14:38,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:38,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:38,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2045259431, now seen corresponding path program 1 times [2024-06-27 17:14:38,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:38,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026164568] [2024-06-27 17:14:38,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:38,305 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-27 17:14:38,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:38,306 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-27 17:14:38,307 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-27 17:14:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:14:38,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 8 conjunts are in the unsatisfiable core [2024-06-27 17:14:38,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-06-27 17:14:38,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-27 17:14:38,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:38,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026164568] [2024-06-27 17:14:38,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026164568] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:14:38,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:14:38,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 17:14:38,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937212753] [2024-06-27 17:14:38,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:14:38,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 17:14:38,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:38,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 17:14:38,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-06-27 17:14:38,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:14:38,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 336 transitions, 5686 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:14:38,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:38,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:14:38,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:39,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 11#thread2EXITtrue, Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 5#L108-4true, 17#thread1EXITtrue, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:39,973 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:14:39,973 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:39,973 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:39,973 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:40,081 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 12#L109true, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 11#thread2EXITtrue, Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,081 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 17:14:40,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,081 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 37#L65true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 5#L108-4true, 17#thread1EXITtrue, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,267 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 17:14:40,267 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,267 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,267 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:40,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 11#thread2EXITtrue, Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 22#L109-1true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,352 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:40,352 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,352 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,352 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 12#L109true, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 37#L65true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 17#thread1EXITtrue, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,356 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:40,356 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,356 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,356 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:40,434 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 3#L110true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,435 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 17:14:40,435 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,435 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,435 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][373], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 888#(and (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 892#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (bvsgt ~N~0 (_ bv0 32))), Black: 1213#true, Black: 895#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 774#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 897#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1553#(or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv1 32) ~N~0))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1549#(not (bvslt (_ bv1 32) ~N~0)), Black: 1416#true, Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 250#true, Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 22#L109-1true, 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 37#L65true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:40,438 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 17:14:40,438 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,438 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,438 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:40,675 INFO L124 PetriNetUnfolderBase]: 7829/12929 cut-off events. [2024-06-27 17:14:40,675 INFO L125 PetriNetUnfolderBase]: For 123530/124041 co-relation queries the response was YES. [2024-06-27 17:14:40,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67572 conditions, 12929 events. 7829/12929 cut-off events. For 123530/124041 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 90277 event pairs, 1836 based on Foata normal form. 124/12637 useless extension candidates. Maximal degree in co-relation 64092. Up to 6305 conditions per place. [2024-06-27 17:14:40,788 INFO L140 encePairwiseOnDemand]: 33/39 looper letters, 331 selfloop transitions, 24 changer transitions 17/478 dead transitions. [2024-06-27 17:14:40,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 478 transitions, 8165 flow [2024-06-27 17:14:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:14:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:14:40,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-06-27 17:14:40,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2024-06-27 17:14:40,790 INFO L175 Difference]: Start difference. First operand has 142 places, 336 transitions, 5686 flow. Second operand 6 states and 123 transitions. [2024-06-27 17:14:40,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 478 transitions, 8165 flow [2024-06-27 17:14:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 478 transitions, 7337 flow, removed 24 selfloop flow, removed 14 redundant places. [2024-06-27 17:14:41,285 INFO L231 Difference]: Finished difference. Result has 134 places, 336 transitions, 5064 flow [2024-06-27 17:14:41,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=4984, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5064, PETRI_PLACES=134, PETRI_TRANSITIONS=336} [2024-06-27 17:14:41,285 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 96 predicate places. [2024-06-27 17:14:41,286 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 336 transitions, 5064 flow [2024-06-27 17:14:41,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:14:41,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:41,286 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, 1, 1, 1] [2024-06-27 17:14:41,292 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 (14)] Forceful destruction successful, exit code 0 [2024-06-27 17:14:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-27 17:14:41,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:41,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash -522071559, now seen corresponding path program 2 times [2024-06-27 17:14:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:41,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118377604] [2024-06-27 17:14:41,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:14:41,493 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-27 17:14:41,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:41,494 INFO L229 MonitoredProcess]: Starting monitored process 15 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-27 17:14:41,496 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 (15)] Waiting until timeout for monitored process [2024-06-27 17:14:41,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:14:41,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:41,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:14:41,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:41,783 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:14:41,784 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-06-27 17:14:41,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118377604] [2024-06-27 17:14:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118377604] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:41,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 17:14:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828625084] [2024-06-27 17:14:41,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:14:41,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:14:41,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:14:41,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 39 [2024-06-27 17:14:41,897 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 336 transitions, 5064 flow. Second operand has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-27 17:14:41,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:41,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 39 [2024-06-27 17:14:41,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:43,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L62-->L65: Formula: (let ((.cse2 (bvmul (_ bv4 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|))) (let ((.cse0 (let ((.cse4 (select |v_#memory_int#1_144| v_~A~0.base_106))) (concat (concat (concat (select .cse4 (bvadd .cse2 (_ bv3 32) v_~A~0.offset_106)) (select .cse4 (bvadd .cse2 (_ bv2 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 (_ bv1 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 v_~A~0.offset_106)))))) (let ((.cse1 (bvadd (bvmul (_ bv4294967295 32) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (and (not (= (ite (or (bvsle .cse0 (bvadd (bvneg .cse1) (_ bv2147483647 32))) (bvsle .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= (store |v_#memory_int#1_144| v_~C~0.base_60 (store (store (store (store (select |v_#memory_int#1_144| v_~C~0.base_60) (bvadd .cse2 v_~C~0.offset_60) ((_ extract 7 0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv1 32)) ((_ extract 15 8) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv2 32)) ((_ extract 23 16) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv3 32)) ((_ extract 31 24) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) |v_#memory_int#1_143|) (= (bvadd (_ bv1 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|) v_~p~0_33) (= (bvadd (let ((.cse3 (select |v_#memory_int#1_144| v_~B~0.base_94))) (concat (concat (concat (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv3 32))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv2 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv1 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2)))) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (bvsge ((_ sign_extend 32) .cse0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))))))) InVars {~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, ~C~0.base=v_~C~0.base_60, ~C~0.offset=v_~C~0.offset_60, #memory_int#1=|v_#memory_int#1_144|, ~B~0.offset=v_~B~0.offset_94} OutVars{~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_60, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, ~C~0.offset=v_~C~0.offset_60, ~p~0=v_~p~0_33, ~B~0.offset=v_~B~0.offset_94, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #memory_int#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][206], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1408#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1870#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1734#(or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1930#true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 597#true, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1831#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1416#true, Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 37#L65true, 29#L77-1true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:43,767 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:43,767 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 17:14:43,767 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:43,767 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:43,887 INFO L124 PetriNetUnfolderBase]: 6418/10549 cut-off events. [2024-06-27 17:14:43,887 INFO L125 PetriNetUnfolderBase]: For 82965/83474 co-relation queries the response was YES. [2024-06-27 17:14:43,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51593 conditions, 10549 events. 6418/10549 cut-off events. For 82965/83474 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 70070 event pairs, 2394 based on Foata normal form. 104/10362 useless extension candidates. Maximal degree in co-relation 50204. Up to 8152 conditions per place. [2024-06-27 17:14:43,978 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 165 selfloop transitions, 9 changer transitions 42/294 dead transitions. [2024-06-27 17:14:43,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 294 transitions, 4650 flow [2024-06-27 17:14:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 17:14:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 17:14:43,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2024-06-27 17:14:43,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382051282051282 [2024-06-27 17:14:43,982 INFO L175 Difference]: Start difference. First operand has 134 places, 336 transitions, 5064 flow. Second operand 10 states and 149 transitions. [2024-06-27 17:14:43,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 294 transitions, 4650 flow [2024-06-27 17:14:44,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 294 transitions, 4345 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-06-27 17:14:44,257 INFO L231 Difference]: Finished difference. Result has 131 places, 252 transitions, 3513 flow [2024-06-27 17:14:44,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3806, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3513, PETRI_PLACES=131, PETRI_TRANSITIONS=252} [2024-06-27 17:14:44,258 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 93 predicate places. [2024-06-27 17:14:44,258 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 252 transitions, 3513 flow [2024-06-27 17:14:44,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.1) internal successors, (131), 10 states have internal predecessors, (131), 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-27 17:14:44,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:44,259 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:44,268 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 (15)] Forceful destruction successful, exit code 0 [2024-06-27 17:14:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-27 17:14:44,465 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:44,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:44,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1971796477, now seen corresponding path program 3 times [2024-06-27 17:14:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163472563] [2024-06-27 17:14:44,465 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:14:44,466 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-27 17:14:44,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:44,466 INFO L229 MonitoredProcess]: Starting monitored process 16 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-27 17:14:44,467 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 (16)] Waiting until timeout for monitored process [2024-06-27 17:14:44,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:14:44,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:14:44,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 17:14:44,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:14:44,769 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:14:44,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:14:44,840 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-06-27 17:14:44,840 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-06-27 17:14:44,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163472563] [2024-06-27 17:14:44,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163472563] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:14:44,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-27 17:14:44,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-06-27 17:14:44,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964985435] [2024-06-27 17:14:44,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-27 17:14:44,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-27 17:14:44,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-06-27 17:14:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-27 17:14:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-06-27 17:14:45,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 39 [2024-06-27 17:14:45,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 252 transitions, 3513 flow. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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-27 17:14:45,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:14:45,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 39 [2024-06-27 17:14:45,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:14:45,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 19#L61-5true, 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 12#L109true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:45,777 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:14:45,777 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,777 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,777 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 5#L108-4true, Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 11#thread2EXITtrue, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:45,782 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2024-06-27 17:14:45,782 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,783 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,783 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:14:45,855 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1930#true, 6#L82true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 12#L109true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 11#thread2EXITtrue, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:45,855 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 17:14:45,855 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:45,855 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:45,856 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:45,857 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 19#L61-5true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:45,857 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 17:14:45,857 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:45,857 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:45,857 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:46,073 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), 11#thread2EXITtrue, Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,073 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:46,073 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,074 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,074 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 37#L65true, 1930#true, 6#L82true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 12#L109true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,075 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:46,075 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,075 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,075 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 597#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 3#L110true, 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,116 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 17:14:46,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,116 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,118 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([835] L78-->L82: Formula: (let ((.cse1 (let ((.cse2 (select |v_#memory_int#1_149| v_~C~0.base_64)) (.cse3 (bvmul (_ bv4 32) v_thread3Thread1of1ForFork0_~i~2_9))) (concat (concat (concat (select .cse2 (bvadd v_~C~0.offset_64 (_ bv3 32) .cse3)) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv2 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 (_ bv1 32) .cse3))) (select .cse2 (bvadd v_~C~0.offset_64 .cse3)))))) (let ((.cse0 (bvsge v_~minc~0_68 .cse1))) (or (and .cse0 (= v_~minc~0_67 .cse1)) (and (not .cse0) (= v_~minc~0_67 v_~minc~0_68) (= |v_thread3Thread1of1ForFork0_#t~mem11_1| |v_thread3Thread1of1ForFork0_#t~mem11_2|))))) InVars {thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_1|, ~minc~0=v_~minc~0_68, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} OutVars{thread3Thread1of1ForFork0_#t~mem11=|v_thread3Thread1of1ForFork0_#t~mem11_2|, thread3Thread1of1ForFork0_#t~mem10=|v_thread3Thread1of1ForFork0_#t~mem10_1|, ~minc~0=v_~minc~0_67, ~C~0.base=v_~C~0.base_64, thread3Thread1of1ForFork0_~i~2=v_thread3Thread1of1ForFork0_~i~2_9, ~C~0.offset=v_~C~0.offset_64, #memory_int#1=|v_#memory_int#1_149|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~mem11, thread3Thread1of1ForFork0_#t~mem10, ~minc~0][192], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), 597#true, Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 37#L65true, 6#L82true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,118 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-06-27 17:14:46,118 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,118 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,118 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:14:46,144 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L62-->L65: Formula: (let ((.cse2 (bvmul (_ bv4 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|))) (let ((.cse0 (let ((.cse4 (select |v_#memory_int#1_144| v_~A~0.base_106))) (concat (concat (concat (select .cse4 (bvadd .cse2 (_ bv3 32) v_~A~0.offset_106)) (select .cse4 (bvadd .cse2 (_ bv2 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 (_ bv1 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 v_~A~0.offset_106)))))) (let ((.cse1 (bvadd (bvmul (_ bv4294967295 32) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (and (not (= (ite (or (bvsle .cse0 (bvadd (bvneg .cse1) (_ bv2147483647 32))) (bvsle .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= (store |v_#memory_int#1_144| v_~C~0.base_60 (store (store (store (store (select |v_#memory_int#1_144| v_~C~0.base_60) (bvadd .cse2 v_~C~0.offset_60) ((_ extract 7 0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv1 32)) ((_ extract 15 8) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv2 32)) ((_ extract 23 16) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv3 32)) ((_ extract 31 24) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) |v_#memory_int#1_143|) (= (bvadd (_ bv1 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|) v_~p~0_33) (= (bvadd (let ((.cse3 (select |v_#memory_int#1_144| v_~B~0.base_94))) (concat (concat (concat (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv3 32))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv2 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv1 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2)))) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (bvsge ((_ sign_extend 32) .cse0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))))))) InVars {~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, ~C~0.base=v_~C~0.base_60, ~C~0.offset=v_~C~0.offset_60, #memory_int#1=|v_#memory_int#1_144|, ~B~0.offset=v_~B~0.offset_94} OutVars{~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_60, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, ~C~0.offset=v_~C~0.offset_60, ~p~0=v_~p~0_33, ~B~0.offset=v_~B~0.offset_94, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #memory_int#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][183], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 37#L65true, 29#L77-1true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 17#thread1EXITtrue, Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 597#true, 12#L109true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,145 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-06-27 17:14:46,145 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 17:14:46,145 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:46,145 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:14:46,179 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([827] L62-->L65: Formula: (let ((.cse2 (bvmul (_ bv4 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|))) (let ((.cse0 (let ((.cse4 (select |v_#memory_int#1_144| v_~A~0.base_106))) (concat (concat (concat (select .cse4 (bvadd .cse2 (_ bv3 32) v_~A~0.offset_106)) (select .cse4 (bvadd .cse2 (_ bv2 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 (_ bv1 32) v_~A~0.offset_106))) (select .cse4 (bvadd .cse2 v_~A~0.offset_106)))))) (let ((.cse1 (bvadd (bvmul (_ bv4294967295 32) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) (and (not (= (ite (or (bvsle .cse0 (bvadd (bvneg .cse1) (_ bv2147483647 32))) (bvsle .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))) (= (store |v_#memory_int#1_144| v_~C~0.base_60 (store (store (store (store (select |v_#memory_int#1_144| v_~C~0.base_60) (bvadd .cse2 v_~C~0.offset_60) ((_ extract 7 0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv1 32)) ((_ extract 15 8) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv2 32)) ((_ extract 23 16) |v_thread2Thread1of1ForFork2_plus_#res#1_1|)) (bvadd .cse2 v_~C~0.offset_60 (_ bv3 32)) ((_ extract 31 24) |v_thread2Thread1of1ForFork2_plus_#res#1_1|))) |v_#memory_int#1_143|) (= (bvadd (_ bv1 32) |v_thread2Thread1of1ForFork2_~i~1#1_7|) v_~p~0_33) (= (bvadd (let ((.cse3 (select |v_#memory_int#1_144| v_~B~0.base_94))) (concat (concat (concat (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv3 32))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv2 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2 (_ bv1 32)))) (select .cse3 (bvadd v_~B~0.offset_94 .cse2)))) .cse0) |v_thread2Thread1of1ForFork2_plus_#res#1_1|) (not (= (ite (or (bvsge ((_ sign_extend 32) .cse0) (bvadd (_ bv18446744071562067968 64) (bvneg ((_ sign_extend 32) .cse1)))) (bvsge .cse1 (_ bv0 32))) (_ bv1 32) (_ bv0 32)) (_ bv0 32))))))) InVars {~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, ~C~0.base=v_~C~0.base_60, ~C~0.offset=v_~C~0.offset_60, #memory_int#1=|v_#memory_int#1_144|, ~B~0.offset=v_~B~0.offset_94} OutVars{~A~0.base=v_~A~0.base_106, ~B~0.base=v_~B~0.base_94, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_7|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_1|, thread2Thread1of1ForFork2_#t~mem6#1=|v_thread2Thread1of1ForFork2_#t~mem6#1_1|, ~C~0.base=v_~C~0.base_60, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_1|, #memory_int#1=|v_#memory_int#1_143|, thread2Thread1of1ForFork2_#t~mem7#1=|v_thread2Thread1of1ForFork2_#t~mem7#1_1|, ~A~0.offset=v_~A~0.offset_106, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_1|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_1|, ~C~0.offset=v_~C~0.offset_60, ~p~0=v_~p~0_33, ~B~0.offset=v_~B~0.offset_94, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_1|, thread2Thread1of1ForFork2_#t~ret8#1=|v_thread2Thread1of1ForFork2_#t~ret8#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem7#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~mem6#1, thread2Thread1of1ForFork2_plus_~b#1, ~p~0, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #memory_int#1, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~ret8#1][183], [Black: 1406#(and (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))) (or (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), Black: 1353#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), Black: 701#(and (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 758#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1213#true, Black: 1863#(and (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 890#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 747#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 661#(= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8)), Black: 754#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1342#(bvslt thread3Thread1of1ForFork0_~i~2 ~N~0), Black: 1416#true, 2151#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 430#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 473#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 911#true, Black: 1047#(bvslt (_ bv1 32) ~N~0), Black: 1106#(and (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0)))), 899#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0) (not (bvslt (_ bv2 32) ~N~0))), Black: 1054#(or (bvslt (_ bv1 32) ~N~0) (not (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0))), 250#true, 22#L109-1true, 1104#(and (bvslt (_ bv1 32) ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)), Black: 1616#true, Black: 1817#(and (or (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt thread3Thread1of1ForFork0_~i~2 ~N~0)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 399#(or (bvslt |ULTIMATE.start_create_fresh_int_array_~i~3#1| |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0))), Black: 259#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1698#(and (= (_ bv2 32) |thread2Thread1of1ForFork2_~i~1#1|) (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1168#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 409#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv1 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1679#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)) (= (_ bv1 32) |thread2Thread1of1ForFork2_~i~1#1|)), Black: 285#(and (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (not (bvslt (_ bv1 32) ~N~0)) (bvsgt ~N~0 (_ bv0 32))), Black: 1629#(and (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 37#L65true, 29#L77-1true, 1930#true, Black: 50#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule |ULTIMATE.start_create_fresh_int_array_~size#1| (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), 594#(and (bvslt |thread2Thread1of1ForFork2_~i~1#1| ~N~0) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), Black: 121#(and (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| (_ bv0 32)) (= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 620#(= ~p~0 (_ bv1 32)), Black: 654#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32))), Black: 690#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= ~p~0 (_ bv1 32)) (= thread3Thread1of1ForFork0_~cond~0 (_ bv0 8))), Black: 597#true, Black: 200#(exists ((v_arrayElimCell_1 (_ BitVec 8)) (v_arrayElimCell_5 (_ BitVec 8)) (v_arrayElimCell_4 (_ BitVec 8)) (v_arrayElimCell_3 (_ BitVec 8)) (v_arrayElimCell_2 (_ BitVec 8)) (v_arrayElimCell_8 (_ BitVec 8)) (v_arrayElimCell_7 (_ BitVec 8)) (v_arrayElimCell_6 (_ BitVec 8))) (and (= (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8) ~mina~0) (= (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) ~minb~0) (= (bvadd (concat (concat (concat v_arrayElimCell_3 v_arrayElimCell_6) v_arrayElimCell_5) v_arrayElimCell_2) (concat (concat (concat v_arrayElimCell_1 v_arrayElimCell_4) v_arrayElimCell_7) v_arrayElimCell_8)) ~minc~0))), Black: 1172#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv1 32)) (bvule ~N~0 (_ bv1073741823 32)) (bvsgt ~N~0 (_ bv0 32))), Black: 1176#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (= thread1Thread1of1ForFork1_~i~0 (_ bv2 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32))), 1675#(and (= thread3Thread1of1ForFork0_~i~2 (_ bv1 32)) (bvslt (_ bv1 32) ~N~0) (bvule ~N~0 (_ bv1073741823 32)))]) [2024-06-27 17:14:46,179 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-06-27 17:14:46,179 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,179 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:14:46,179 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 17:14:46,267 INFO L124 PetriNetUnfolderBase]: 4732/8000 cut-off events. [2024-06-27 17:14:46,267 INFO L125 PetriNetUnfolderBase]: For 58344/58877 co-relation queries the response was YES. [2024-06-27 17:14:46,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37381 conditions, 8000 events. 4732/8000 cut-off events. For 58344/58877 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 54803 event pairs, 1387 based on Foata normal form. 405/7880 useless extension candidates. Maximal degree in co-relation 37319. Up to 5114 conditions per place. [2024-06-27 17:14:46,330 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 172 selfloop transitions, 20 changer transitions 0/276 dead transitions. [2024-06-27 17:14:46,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 276 transitions, 4080 flow [2024-06-27 17:14:46,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 17:14:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 17:14:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 129 transitions. [2024-06-27 17:14:46,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41346153846153844 [2024-06-27 17:14:46,333 INFO L175 Difference]: Start difference. First operand has 131 places, 252 transitions, 3513 flow. Second operand 8 states and 129 transitions. [2024-06-27 17:14:46,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 276 transitions, 4080 flow [2024-06-27 17:14:46,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 276 transitions, 3956 flow, removed 29 selfloop flow, removed 12 redundant places. [2024-06-27 17:14:46,447 INFO L231 Difference]: Finished difference. Result has 116 places, 248 transitions, 3402 flow [2024-06-27 17:14:46,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=3362, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3402, PETRI_PLACES=116, PETRI_TRANSITIONS=248} [2024-06-27 17:14:46,447 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 78 predicate places. [2024-06-27 17:14:46,447 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 248 transitions, 3402 flow [2024-06-27 17:14:46,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 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-27 17:14:46,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:14:46,448 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:14:46,453 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 (16)] Forceful destruction successful, exit code 0 [2024-06-27 17:14:46,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-27 17:14:46,649 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-27 17:14:46,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:14:46,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1678580326, now seen corresponding path program 1 times [2024-06-27 17:14:46,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-06-27 17:14:46,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847231830] [2024-06-27 17:14:46,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:14:46,650 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-27 17:14:46,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-06-27 17:14:46,652 INFO L229 MonitoredProcess]: Starting monitored process 17 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-27 17:14:46,652 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 (17)] Waiting until timeout for monitored process Killed by 15