./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/pthread-C-DAC/pthread-demo-datarace-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:22:25,844 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:22:25,896 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:22:25,903 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:22:25,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:22:25,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:22:25,925 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:22:25,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:22:25,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:22:25,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:22:25,927 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:22:25,927 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:22:25,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:22:25,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:22:25,928 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:22:25,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:22:25,929 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:25,929 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:25,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:22:25,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:22:25,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:22:25,930 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 ! overflow) ) 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 -> 44de34ccc7195f8ba562241ad79de4cb2add35f6ad2c59de465184820d6f6382 [2025-04-30 10:22:26,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:22:26,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:22:26,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:22:26,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:22:26,137 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:22:26,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:22:27,360 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a35ed12f/532a1b9d63e2416e92321496dd014601/FLAG920a5f801 [2025-04-30 10:22:27,662 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:22:27,663 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-C-DAC/pthread-demo-datarace-3.i [2025-04-30 10:22:27,678 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a35ed12f/532a1b9d63e2416e92321496dd014601/FLAG920a5f801 [2025-04-30 10:22:28,561 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a35ed12f/532a1b9d63e2416e92321496dd014601 [2025-04-30 10:22:28,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:22:28,564 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:22:28,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:28,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:22:28,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:22:28,568 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:28" (1/1) ... [2025-04-30 10:22:28,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40b45aac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:28, skipping insertion in model container [2025-04-30 10:22:28,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:22:28" (1/1) ... [2025-04-30 10:22:28,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:22:28,984 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:28,994 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:22:29,046 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:29,101 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:22:29,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29 WrapperNode [2025-04-30 10:22:29,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:29,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:29,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:22:29,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:22:29,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,140 INFO L138 Inliner]: procedures = 364, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 117 [2025-04-30 10:22:29,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:29,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:22:29,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:22:29,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:22:29,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,156 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:22:29,156 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,156 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,159 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,161 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,162 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,163 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,166 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:22:29,166 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:22:29,166 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:22:29,166 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:22:29,167 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (1/1) ... [2025-04-30 10:22:29,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:29,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:29,193 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) [2025-04-30 10:22:29,198 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 [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_datarace [2025-04-30 10:22:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_datarace [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:22:29,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:22:29,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:22:29,212 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:22:29,310 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:22:29,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:22:29,476 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:22:29,476 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:22:29,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:22:29,720 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:22:29,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:29 BoogieIcfgContainer [2025-04-30 10:22:29,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:22:29,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:22:29,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:22:29,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:22:29,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:22:28" (1/3) ... [2025-04-30 10:22:29,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec517a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:29, skipping insertion in model container [2025-04-30 10:22:29,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:29" (2/3) ... [2025-04-30 10:22:29,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ec517a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:29, skipping insertion in model container [2025-04-30 10:22:29,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:29" (3/3) ... [2025-04-30 10:22:29,728 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-3.i [2025-04-30 10:22:29,738 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:22:29,740 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-3.i that has 2 procedures, 29 locations, 29 edges, 1 initial locations, 2 loop locations, and 8 error locations. [2025-04-30 10:22:29,740 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:22:29,770 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-30 10:22:29,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 30 transitions, 67 flow [2025-04-30 10:22:29,822 INFO L116 PetriNetUnfolderBase]: 2/29 cut-off events. [2025-04-30 10:22:29,824 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:22:29,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 29 events. 2/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-30 10:22:29,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 30 transitions, 67 flow [2025-04-30 10:22:29,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 27 transitions, 57 flow [2025-04-30 10:22:29,837 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:22:29,846 INFO L340 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, 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;@3816d6e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:22:29,850 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:22:29,854 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:22:29,855 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-30 10:22:29,855 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:22:29,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:29,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:22:29,856 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:29,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash 348987445, now seen corresponding path program 1 times [2025-04-30 10:22:29,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:29,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368792476] [2025-04-30 10:22:29,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:29,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:29,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:22:29,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:22:29,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:29,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368792476] [2025-04-30 10:22:30,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368792476] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-30 10:22:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644451065] [2025-04-30 10:22:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:22:30,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:22:30,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:22:30,156 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 30 [2025-04-30 10:22:30,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:30,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 30 [2025-04-30 10:22:30,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:30,210 INFO L116 PetriNetUnfolderBase]: 33/118 cut-off events. [2025-04-30 10:22:30,212 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:22:30,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 118 events. 33/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 467 event pairs, 3 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 180. Up to 55 conditions per place. [2025-04-30 10:22:30,214 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 15 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2025-04-30 10:22:30,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 33 transitions, 105 flow [2025-04-30 10:22:30,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:22:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:22:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2025-04-30 10:22:30,225 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7555555555555555 [2025-04-30 10:22:30,227 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 57 flow. Second operand 3 states and 68 transitions. [2025-04-30 10:22:30,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 33 transitions, 105 flow [2025-04-30 10:22:30,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:30,233 INFO L231 Difference]: Finished difference. Result has 31 places, 29 transitions, 77 flow [2025-04-30 10:22:30,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=29} [2025-04-30 10:22:30,236 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-30 10:22:30,237 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 29 transitions, 77 flow [2025-04-30 10:22:30,237 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:30,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,237 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:22:30,237 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_dataraceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:30,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash -2065452134, now seen corresponding path program 1 times [2025-04-30 10:22:30,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,238 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359953290] [2025-04-30 10:22:30,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:22:30,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:22:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:30,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359953290] [2025-04-30 10:22:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359953290] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:30,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:22:30,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487497719] [2025-04-30 10:22:30,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:30,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:30,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:30,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:30,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:30,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:30,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:30,447 INFO L116 PetriNetUnfolderBase]: 54/165 cut-off events. [2025-04-30 10:22:30,447 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:22:30,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 165 events. 54/165 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 750 event pairs, 12 based on Foata normal form. 6/126 useless extension candidates. Maximal degree in co-relation 315. Up to 89 conditions per place. [2025-04-30 10:22:30,449 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 22 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2025-04-30 10:22:30,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 168 flow [2025-04-30 10:22:30,449 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:22:30,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:22:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-04-30 10:22:30,451 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-04-30 10:22:30,451 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 77 flow. Second operand 5 states and 98 transitions. [2025-04-30 10:22:30,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 168 flow [2025-04-30 10:22:30,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 164 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:30,454 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 120 flow [2025-04-30 10:22:30,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2025-04-30 10:22:30,455 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-04-30 10:22:30,455 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 120 flow [2025-04-30 10:22:30,456 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:30,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:30,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:22:30,456 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:30,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,457 INFO L85 PathProgramCache]: Analyzing trace with hash 369497746, now seen corresponding path program 1 times [2025-04-30 10:22:30,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048234976] [2025-04-30 10:22:30,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:30,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:22:30,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:22:30,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,555 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048234976] [2025-04-30 10:22:30,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048234976] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:30,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:30,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538082263] [2025-04-30 10:22:30,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,558 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:30,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:30,572 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:30,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 120 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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) [2025-04-30 10:22:30,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:30,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:30,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:30,668 INFO L116 PetriNetUnfolderBase]: 78/216 cut-off events. [2025-04-30 10:22:30,668 INFO L117 PetriNetUnfolderBase]: For 62/63 co-relation queries the response was YES. [2025-04-30 10:22:30,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 216 events. 78/216 cut-off events. For 62/63 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1026 event pairs, 23 based on Foata normal form. 13/189 useless extension candidates. Maximal degree in co-relation 473. Up to 97 conditions per place. [2025-04-30 10:22:30,670 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 32 selfloop transitions, 3 changer transitions 0/49 dead transitions. [2025-04-30 10:22:30,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 49 transitions, 242 flow [2025-04-30 10:22:30,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:22:30,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2025-04-30 10:22:30,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6916666666666667 [2025-04-30 10:22:30,671 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 120 flow. Second operand 4 states and 83 transitions. [2025-04-30 10:22:30,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 49 transitions, 242 flow [2025-04-30 10:22:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:30,672 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 140 flow [2025-04-30 10:22:30,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-04-30 10:22:30,673 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2025-04-30 10:22:30,673 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 140 flow [2025-04-30 10:22:30,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 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) [2025-04-30 10:22:30,673 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:30,673 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,673 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:22:30,673 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread_function_dataraceErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:30,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2083414391, now seen corresponding path program 1 times [2025-04-30 10:22:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347854546] [2025-04-30 10:22:30,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:30,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:22:30,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:22:30,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347854546] [2025-04-30 10:22:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347854546] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057605160] [2025-04-30 10:22:30,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:30,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:30,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:30,766 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:30,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2025-04-30 10:22:30,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:30,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:30,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:30,872 INFO L116 PetriNetUnfolderBase]: 120/380 cut-off events. [2025-04-30 10:22:30,873 INFO L117 PetriNetUnfolderBase]: For 225/246 co-relation queries the response was YES. [2025-04-30 10:22:30,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 963 conditions, 380 events. 120/380 cut-off events. For 225/246 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2090 event pairs, 19 based on Foata normal form. 16/340 useless extension candidates. Maximal degree in co-relation 946. Up to 104 conditions per place. [2025-04-30 10:22:30,877 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 42 selfloop transitions, 10 changer transitions 0/65 dead transitions. [2025-04-30 10:22:30,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 65 transitions, 363 flow [2025-04-30 10:22:30,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:22:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:22:30,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-04-30 10:22:30,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7055555555555556 [2025-04-30 10:22:30,880 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 140 flow. Second operand 6 states and 127 transitions. [2025-04-30 10:22:30,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 65 transitions, 363 flow [2025-04-30 10:22:30,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 65 transitions, 356 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:30,884 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 218 flow [2025-04-30 10:22:30,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-04-30 10:22:30,885 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 20 predicate places. [2025-04-30 10:22:30,885 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 218 flow [2025-04-30 10:22:30,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2025-04-30 10:22:30,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:30,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:30,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:22:30,885 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread_function_dataraceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:30,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,886 INFO L85 PathProgramCache]: Analyzing trace with hash 143251141, now seen corresponding path program 1 times [2025-04-30 10:22:30,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278983930] [2025-04-30 10:22:30,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:30,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:22:30,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:22:30,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:30,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:30,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:30,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278983930] [2025-04-30 10:22:30,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278983930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:30,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:30,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:30,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952148781] [2025-04-30 10:22:30,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:30,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:30,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:30,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:30,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:22:30,976 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:30,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2025-04-30 10:22:30,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:30,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:30,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:31,072 INFO L116 PetriNetUnfolderBase]: 134/463 cut-off events. [2025-04-30 10:22:31,072 INFO L117 PetriNetUnfolderBase]: For 764/779 co-relation queries the response was YES. [2025-04-30 10:22:31,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 463 events. 134/463 cut-off events. For 764/779 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2749 event pairs, 20 based on Foata normal form. 27/469 useless extension candidates. Maximal degree in co-relation 1309. Up to 203 conditions per place. [2025-04-30 10:22:31,074 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 37 selfloop transitions, 20 changer transitions 0/70 dead transitions. [2025-04-30 10:22:31,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 477 flow [2025-04-30 10:22:31,075 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:22:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:22:31,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 139 transitions. [2025-04-30 10:22:31,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6619047619047619 [2025-04-30 10:22:31,078 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 218 flow. Second operand 7 states and 139 transitions. [2025-04-30 10:22:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 477 flow [2025-04-30 10:22:31,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 465 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:31,084 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 370 flow [2025-04-30 10:22:31,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=370, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2025-04-30 10:22:31,085 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-04-30 10:22:31,085 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 370 flow [2025-04-30 10:22:31,087 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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) [2025-04-30 10:22:31,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:31,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:31,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:22:31,087 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread_function_dataraceErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:31,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:31,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1056889245, now seen corresponding path program 1 times [2025-04-30 10:22:31,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:31,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75831359] [2025-04-30 10:22:31,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:31,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:22:31,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:22:31,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:31,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:31,150 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75831359] [2025-04-30 10:22:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75831359] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:31,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753759851] [2025-04-30 10:22:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:31,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:31,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:31,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:31,159 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 30 [2025-04-30 10:22:31,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 370 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2025-04-30 10:22:31,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:31,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 30 [2025-04-30 10:22:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:31,233 INFO L116 PetriNetUnfolderBase]: 171/545 cut-off events. [2025-04-30 10:22:31,233 INFO L117 PetriNetUnfolderBase]: For 1639/1732 co-relation queries the response was YES. [2025-04-30 10:22:31,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 545 events. 171/545 cut-off events. For 1639/1732 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3438 event pairs, 44 based on Foata normal form. 41/554 useless extension candidates. Maximal degree in co-relation 1776. Up to 236 conditions per place. [2025-04-30 10:22:31,237 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 44 selfloop transitions, 3 changer transitions 0/73 dead transitions. [2025-04-30 10:22:31,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 73 transitions, 604 flow [2025-04-30 10:22:31,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:22:31,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2025-04-30 10:22:31,238 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7166666666666667 [2025-04-30 10:22:31,238 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 370 flow. Second operand 4 states and 86 transitions. [2025-04-30 10:22:31,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 73 transitions, 604 flow [2025-04-30 10:22:31,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 73 transitions, 581 flow, removed 7 selfloop flow, removed 2 redundant places. [2025-04-30 10:22:31,243 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 374 flow [2025-04-30 10:22:31,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2025-04-30 10:22:31,244 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2025-04-30 10:22:31,244 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 374 flow [2025-04-30 10:22:31,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) [2025-04-30 10:22:31,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:31,244 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:31,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:22:31,245 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:31,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:31,245 INFO L85 PathProgramCache]: Analyzing trace with hash 605793426, now seen corresponding path program 1 times [2025-04-30 10:22:31,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:31,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295079299] [2025-04-30 10:22:31,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:31,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:22:31,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:22:31,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:31,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:31,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295079299] [2025-04-30 10:22:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295079299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:31,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:22:31,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598449703] [2025-04-30 10:22:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:31,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:22:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:31,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:22:31,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:22:31,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:31,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 374 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) [2025-04-30 10:22:31,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:31,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:31,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:31,482 INFO L116 PetriNetUnfolderBase]: 208/662 cut-off events. [2025-04-30 10:22:31,482 INFO L117 PetriNetUnfolderBase]: For 2233/2281 co-relation queries the response was YES. [2025-04-30 10:22:31,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2413 conditions, 662 events. 208/662 cut-off events. For 2233/2281 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 4105 event pairs, 29 based on Foata normal form. 46/698 useless extension candidates. Maximal degree in co-relation 2385. Up to 227 conditions per place. [2025-04-30 10:22:31,488 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 59 selfloop transitions, 31 changer transitions 0/104 dead transitions. [2025-04-30 10:22:31,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 896 flow [2025-04-30 10:22:31,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:22:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:22:31,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 199 transitions. [2025-04-30 10:22:31,489 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2025-04-30 10:22:31,489 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 374 flow. Second operand 10 states and 199 transitions. [2025-04-30 10:22:31,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 896 flow [2025-04-30 10:22:31,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 890 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:22:31,496 INFO L231 Difference]: Finished difference. Result has 72 places, 72 transitions, 672 flow [2025-04-30 10:22:31,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=672, PETRI_PLACES=72, PETRI_TRANSITIONS=72} [2025-04-30 10:22:31,497 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2025-04-30 10:22:31,497 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 72 transitions, 672 flow [2025-04-30 10:22:31,497 INFO L486 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) [2025-04-30 10:22:31,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:31,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:31,497 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:22:31,497 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:31,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:31,498 INFO L85 PathProgramCache]: Analyzing trace with hash 605793425, now seen corresponding path program 1 times [2025-04-30 10:22:31,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:31,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009151052] [2025-04-30 10:22:31,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:31,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:22:31,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:22:31,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:31,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:31,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:31,564 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009151052] [2025-04-30 10:22:31,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009151052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:31,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:31,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-30 10:22:31,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229931586] [2025-04-30 10:22:31,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:31,564 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:22:31,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:31,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:22:31,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:22:31,579 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:31,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 72 transitions, 672 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) [2025-04-30 10:22:31,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:31,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:31,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:31,714 INFO L116 PetriNetUnfolderBase]: 158/538 cut-off events. [2025-04-30 10:22:31,714 INFO L117 PetriNetUnfolderBase]: For 3073/3111 co-relation queries the response was YES. [2025-04-30 10:22:31,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2111 conditions, 538 events. 158/538 cut-off events. For 3073/3111 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3182 event pairs, 39 based on Foata normal form. 66/590 useless extension candidates. Maximal degree in co-relation 2078. Up to 300 conditions per place. [2025-04-30 10:22:31,718 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 49 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2025-04-30 10:22:31,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 74 transitions, 728 flow [2025-04-30 10:22:31,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-30 10:22:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-30 10:22:31,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2025-04-30 10:22:31,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5708333333333333 [2025-04-30 10:22:31,719 INFO L175 Difference]: Start difference. First operand has 72 places, 72 transitions, 672 flow. Second operand 8 states and 137 transitions. [2025-04-30 10:22:31,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 74 transitions, 728 flow [2025-04-30 10:22:31,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 74 transitions, 652 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-30 10:22:31,725 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 473 flow [2025-04-30 10:22:31,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2025-04-30 10:22:31,726 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 41 predicate places. [2025-04-30 10:22:31,726 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 473 flow [2025-04-30 10:22:31,726 INFO L486 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) [2025-04-30 10:22:31,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:31,726 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:31,726 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:22:31,726 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:31,727 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1445209513, now seen corresponding path program 1 times [2025-04-30 10:22:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:31,727 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85455101] [2025-04-30 10:22:31,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:31,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:22:31,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:22:31,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:31,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:31,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85455101] [2025-04-30 10:22:31,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85455101] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:31,807 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775645678] [2025-04-30 10:22:31,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:31,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:31,810 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) [2025-04-30 10:22:31,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-30 10:22:31,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-30 10:22:31,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-30 10:22:31,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:31,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:31,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:22:31,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:31,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:31,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775645678] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:31,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:31,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-04-30 10:22:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668889348] [2025-04-30 10:22:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:31,981 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:22:31,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:31,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:22:31,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:22:31,991 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 30 [2025-04-30 10:22:31,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 473 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-04-30 10:22:31,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:31,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 30 [2025-04-30 10:22:31,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:32,092 INFO L116 PetriNetUnfolderBase]: 247/650 cut-off events. [2025-04-30 10:22:32,092 INFO L117 PetriNetUnfolderBase]: For 2551/2650 co-relation queries the response was YES. [2025-04-30 10:22:32,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2498 conditions, 650 events. 247/650 cut-off events. For 2551/2650 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3902 event pairs, 36 based on Foata normal form. 61/652 useless extension candidates. Maximal degree in co-relation 2468. Up to 279 conditions per place. [2025-04-30 10:22:32,096 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 48 selfloop transitions, 5 changer transitions 0/78 dead transitions. [2025-04-30 10:22:32,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 78 transitions, 702 flow [2025-04-30 10:22:32,097 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:22:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-30 10:22:32,097 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-04-30 10:22:32,097 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 473 flow. Second operand 4 states and 71 transitions. [2025-04-30 10:22:32,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 78 transitions, 702 flow [2025-04-30 10:22:32,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 78 transitions, 683 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-30 10:22:32,103 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 464 flow [2025-04-30 10:22:32,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=464, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-04-30 10:22:32,104 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2025-04-30 10:22:32,104 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 464 flow [2025-04-30 10:22:32,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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) [2025-04-30 10:22:32,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:32,104 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:22:32,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:22:32,309 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:32,309 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:32,309 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1851822306, now seen corresponding path program 1 times [2025-04-30 10:22:32,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:32,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291540006] [2025-04-30 10:22:32,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:32,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:32,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:22:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:22:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:22:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:32,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291540006] [2025-04-30 10:22:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291540006] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:32,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:32,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:32,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652120522] [2025-04-30 10:22:32,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:32,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:32,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:32,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:32,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:32,361 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 30 [2025-04-30 10:22:32,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 464 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2025-04-30 10:22:32,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:32,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 30 [2025-04-30 10:22:32,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:32,450 INFO L116 PetriNetUnfolderBase]: 230/663 cut-off events. [2025-04-30 10:22:32,450 INFO L117 PetriNetUnfolderBase]: For 2351/2438 co-relation queries the response was YES. [2025-04-30 10:22:32,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2568 conditions, 663 events. 230/663 cut-off events. For 2351/2438 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4028 event pairs, 27 based on Foata normal form. 59/701 useless extension candidates. Maximal degree in co-relation 2539. Up to 239 conditions per place. [2025-04-30 10:22:32,454 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 52 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-04-30 10:22:32,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 747 flow [2025-04-30 10:22:32,454 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:32,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:22:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-30 10:22:32,454 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5916666666666667 [2025-04-30 10:22:32,455 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 464 flow. Second operand 4 states and 71 transitions. [2025-04-30 10:22:32,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 747 flow [2025-04-30 10:22:32,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 83 transitions, 737 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:22:32,460 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 470 flow [2025-04-30 10:22:32,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=470, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2025-04-30 10:22:32,460 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 38 predicate places. [2025-04-30 10:22:32,460 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 470 flow [2025-04-30 10:22:32,461 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) [2025-04-30 10:22:32,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:32,461 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:32,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:22:32,461 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting thread_function_dataraceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:32,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:32,462 INFO L85 PathProgramCache]: Analyzing trace with hash 203162676, now seen corresponding path program 1 times [2025-04-30 10:22:32,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:32,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728414646] [2025-04-30 10:22:32,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:32,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:32,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:22:32,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:22:32,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:32,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:32,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:32,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:32,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728414646] [2025-04-30 10:22:32,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728414646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:32,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629054230] [2025-04-30 10:22:32,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:32,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:32,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:32,521 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) [2025-04-30 10:22:32,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-30 10:22:32,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:22:32,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:22:32,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:32,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:32,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:22:32,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:32,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:32,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629054230] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:32,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:32,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:22:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892321388] [2025-04-30 10:22:32,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:32,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:22:32,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:32,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:22:32,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:22:32,704 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:32,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 470 flow. Second operand has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:32,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:32,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:32,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:32,947 INFO L116 PetriNetUnfolderBase]: 261/880 cut-off events. [2025-04-30 10:22:32,948 INFO L117 PetriNetUnfolderBase]: For 4698/4726 co-relation queries the response was YES. [2025-04-30 10:22:32,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3638 conditions, 880 events. 261/880 cut-off events. For 4698/4726 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5471 event pairs, 11 based on Foata normal form. 94/970 useless extension candidates. Maximal degree in co-relation 3609. Up to 226 conditions per place. [2025-04-30 10:22:32,953 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 64 selfloop transitions, 71 changer transitions 0/148 dead transitions. [2025-04-30 10:22:32,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 148 transitions, 1533 flow [2025-04-30 10:22:32,954 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:22:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-30 10:22:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 403 transitions. [2025-04-30 10:22:32,955 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6106060606060606 [2025-04-30 10:22:32,955 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 470 flow. Second operand 22 states and 403 transitions. [2025-04-30 10:22:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 148 transitions, 1533 flow [2025-04-30 10:22:32,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 148 transitions, 1500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:22:32,964 INFO L231 Difference]: Finished difference. Result has 100 places, 109 transitions, 1301 flow [2025-04-30 10:22:32,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1301, PETRI_PLACES=100, PETRI_TRANSITIONS=109} [2025-04-30 10:22:32,964 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2025-04-30 10:22:32,964 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 109 transitions, 1301 flow [2025-04-30 10:22:32,965 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.0) internal successors, (165), 11 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:32,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:32,965 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:32,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:33,165 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-30 10:22:33,165 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:33,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:33,166 INFO L85 PathProgramCache]: Analyzing trace with hash 365580511, now seen corresponding path program 1 times [2025-04-30 10:22:33,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:33,166 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687150157] [2025-04-30 10:22:33,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:33,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:22:33,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:22:33,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:33,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:33,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:33,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687150157] [2025-04-30 10:22:33,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687150157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:33,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122132168] [2025-04-30 10:22:33,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:33,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:33,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:33,227 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) [2025-04-30 10:22:33,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-30 10:22:33,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:22:33,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:22:33,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:33,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:33,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:22:33,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:33,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:33,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:33,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122132168] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:33,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:33,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-04-30 10:22:33,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096929344] [2025-04-30 10:22:33,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:33,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-30 10:22:33,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:33,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-30 10:22:33,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-30 10:22:33,418 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:33,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 109 transitions, 1301 flow. Second operand has 14 states, 14 states have (on average 14.857142857142858) internal successors, (208), 14 states have internal predecessors, (208), 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) [2025-04-30 10:22:33,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:33,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:33,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:33,905 INFO L116 PetriNetUnfolderBase]: 565/1987 cut-off events. [2025-04-30 10:22:33,905 INFO L117 PetriNetUnfolderBase]: For 22105/22203 co-relation queries the response was YES. [2025-04-30 10:22:33,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9028 conditions, 1987 events. 565/1987 cut-off events. For 22105/22203 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 15793 event pairs, 21 based on Foata normal form. 195/2176 useless extension candidates. Maximal degree in co-relation 8983. Up to 483 conditions per place. [2025-04-30 10:22:33,923 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 140 selfloop transitions, 165 changer transitions 0/318 dead transitions. [2025-04-30 10:22:33,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 318 transitions, 4123 flow [2025-04-30 10:22:33,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-30 10:22:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-04-30 10:22:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 630 transitions. [2025-04-30 10:22:33,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2025-04-30 10:22:33,925 INFO L175 Difference]: Start difference. First operand has 100 places, 109 transitions, 1301 flow. Second operand 33 states and 630 transitions. [2025-04-30 10:22:33,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 318 transitions, 4123 flow [2025-04-30 10:22:33,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 318 transitions, 3514 flow, removed 292 selfloop flow, removed 5 redundant places. [2025-04-30 10:22:33,956 INFO L231 Difference]: Finished difference. Result has 143 places, 219 transitions, 2907 flow [2025-04-30 10:22:33,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1040, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2907, PETRI_PLACES=143, PETRI_TRANSITIONS=219} [2025-04-30 10:22:33,957 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 114 predicate places. [2025-04-30 10:22:33,957 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 219 transitions, 2907 flow [2025-04-30 10:22:33,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 14.857142857142858) internal successors, (208), 14 states have internal predecessors, (208), 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) [2025-04-30 10:22:33,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:33,957 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:33,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:22:34,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:34,162 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting thread_function_dataraceErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:34,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:34,162 INFO L85 PathProgramCache]: Analyzing trace with hash -770865450, now seen corresponding path program 1 times [2025-04-30 10:22:34,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:34,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528226966] [2025-04-30 10:22:34,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:34,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:34,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:22:34,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:22:34,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:34,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:34,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:34,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:34,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528226966] [2025-04-30 10:22:34,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528226966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:34,227 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300278837] [2025-04-30 10:22:34,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:34,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:34,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:34,231 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) [2025-04-30 10:22:34,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-30 10:22:34,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:22:34,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:22:34,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:34,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:34,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:22:34,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:34,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:22:34,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300278837] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:34,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:22:34,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-04-30 10:22:34,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542457131] [2025-04-30 10:22:34,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:34,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:22:34,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:34,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:22:34,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:22:34,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 30 [2025-04-30 10:22:34,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 219 transitions, 2907 flow. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) [2025-04-30 10:22:34,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:34,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 30 [2025-04-30 10:22:34,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:34,620 INFO L116 PetriNetUnfolderBase]: 609/2043 cut-off events. [2025-04-30 10:22:34,620 INFO L117 PetriNetUnfolderBase]: For 33286/33391 co-relation queries the response was YES. [2025-04-30 10:22:34,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10599 conditions, 2043 events. 609/2043 cut-off events. For 33286/33391 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16335 event pairs, 63 based on Foata normal form. 100/2080 useless extension candidates. Maximal degree in co-relation 10537. Up to 604 conditions per place. [2025-04-30 10:22:34,636 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 200 selfloop transitions, 5 changer transitions 0/289 dead transitions. [2025-04-30 10:22:34,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 289 transitions, 4525 flow [2025-04-30 10:22:34,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:22:34,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:22:34,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 116 transitions. [2025-04-30 10:22:34,637 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2025-04-30 10:22:34,637 INFO L175 Difference]: Start difference. First operand has 143 places, 219 transitions, 2907 flow. Second operand 6 states and 116 transitions. [2025-04-30 10:22:34,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 289 transitions, 4525 flow [2025-04-30 10:22:34,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 289 transitions, 3628 flow, removed 396 selfloop flow, removed 12 redundant places. [2025-04-30 10:22:34,697 INFO L231 Difference]: Finished difference. Result has 135 places, 218 transitions, 2281 flow [2025-04-30 10:22:34,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2271, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2281, PETRI_PLACES=135, PETRI_TRANSITIONS=218} [2025-04-30 10:22:34,698 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2025-04-30 10:22:34,698 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 218 transitions, 2281 flow [2025-04-30 10:22:34,698 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 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) [2025-04-30 10:22:34,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:34,698 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:22:34,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:34,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:34,903 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting thread_function_dataraceErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:34,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:34,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1872975212, now seen corresponding path program 1 times [2025-04-30 10:22:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:34,903 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177087508] [2025-04-30 10:22:34,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:34,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-30 10:22:34,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-30 10:22:34,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:34,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-30 10:22:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:34,940 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177087508] [2025-04-30 10:22:34,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177087508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:34,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:34,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832614134] [2025-04-30 10:22:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:34,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:34,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:34,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:34,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:34,946 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:34,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 218 transitions, 2281 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2025-04-30 10:22:34,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:34,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:34,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:35,175 INFO L116 PetriNetUnfolderBase]: 663/2170 cut-off events. [2025-04-30 10:22:35,175 INFO L117 PetriNetUnfolderBase]: For 29589/29670 co-relation queries the response was YES. [2025-04-30 10:22:35,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10012 conditions, 2170 events. 663/2170 cut-off events. For 29589/29670 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 17106 event pairs, 98 based on Foata normal form. 103/2253 useless extension candidates. Maximal degree in co-relation 9952. Up to 699 conditions per place. [2025-04-30 10:22:35,194 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 187 selfloop transitions, 6 changer transitions 0/276 dead transitions. [2025-04-30 10:22:35,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 276 transitions, 3377 flow [2025-04-30 10:22:35,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:22:35,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2025-04-30 10:22:35,195 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-04-30 10:22:35,195 INFO L175 Difference]: Start difference. First operand has 135 places, 218 transitions, 2281 flow. Second operand 4 states and 74 transitions. [2025-04-30 10:22:35,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 276 transitions, 3377 flow [2025-04-30 10:22:35,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 276 transitions, 3368 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-30 10:22:35,243 INFO L231 Difference]: Finished difference. Result has 134 places, 218 transitions, 2288 flow [2025-04-30 10:22:35,244 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2268, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2288, PETRI_PLACES=134, PETRI_TRANSITIONS=218} [2025-04-30 10:22:35,244 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 105 predicate places. [2025-04-30 10:22:35,244 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 218 transitions, 2288 flow [2025-04-30 10:22:35,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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) [2025-04-30 10:22:35,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:35,244 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:35,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:22:35,245 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting thread_function_dataraceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:35,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash -915172702, now seen corresponding path program 1 times [2025-04-30 10:22:35,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:35,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382152939] [2025-04-30 10:22:35,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:35,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:35,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:22:35,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:22:35,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:35,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:35,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:35,332 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382152939] [2025-04-30 10:22:35,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382152939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:35,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852524880] [2025-04-30 10:22:35,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:35,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:35,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:35,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:35,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-30 10:22:35,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-30 10:22:35,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:22:35,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:35,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:35,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-30 10:22:35,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:35,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:35,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852524880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:35,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:35,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:22:35,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025395176] [2025-04-30 10:22:35,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:35,608 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-30 10:22:35,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:35,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-30 10:22:35,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2025-04-30 10:22:35,622 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:35,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 218 transitions, 2288 flow. Second operand has 19 states, 19 states have (on average 14.842105263157896) internal successors, (282), 19 states have internal predecessors, (282), 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) [2025-04-30 10:22:35,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:35,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:35,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:36,798 INFO L116 PetriNetUnfolderBase]: 1312/4645 cut-off events. [2025-04-30 10:22:36,798 INFO L117 PetriNetUnfolderBase]: For 127977/128048 co-relation queries the response was YES. [2025-04-30 10:22:36,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21496 conditions, 4645 events. 1312/4645 cut-off events. For 127977/128048 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 41472 event pairs, 14 based on Foata normal form. 468/5106 useless extension candidates. Maximal degree in co-relation 21437. Up to 973 conditions per place. [2025-04-30 10:22:36,824 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 237 selfloop transitions, 415 changer transitions 0/664 dead transitions. [2025-04-30 10:22:36,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 664 transitions, 8568 flow [2025-04-30 10:22:36,824 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-30 10:22:36,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-30 10:22:36,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 1173 transitions. [2025-04-30 10:22:36,827 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6409836065573771 [2025-04-30 10:22:36,827 INFO L175 Difference]: Start difference. First operand has 134 places, 218 transitions, 2288 flow. Second operand 61 states and 1173 transitions. [2025-04-30 10:22:36,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 664 transitions, 8568 flow [2025-04-30 10:22:36,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 664 transitions, 8433 flow, removed 36 selfloop flow, removed 2 redundant places. [2025-04-30 10:22:36,922 INFO L231 Difference]: Finished difference. Result has 228 places, 478 transitions, 7302 flow [2025-04-30 10:22:36,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2260, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=7302, PETRI_PLACES=228, PETRI_TRANSITIONS=478} [2025-04-30 10:22:36,923 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 199 predicate places. [2025-04-30 10:22:36,923 INFO L485 AbstractCegarLoop]: Abstraction has has 228 places, 478 transitions, 7302 flow [2025-04-30 10:22:36,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.842105263157896) internal successors, (282), 19 states have internal predecessors, (282), 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) [2025-04-30 10:22:36,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:36,924 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:22:36,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:37,124 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-30 10:22:37,124 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:37,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:37,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1729425941, now seen corresponding path program 1 times [2025-04-30 10:22:37,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:37,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289052908] [2025-04-30 10:22:37,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:37,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:37,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:22:37,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:22:37,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:37,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:37,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:37,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:37,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289052908] [2025-04-30 10:22:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289052908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:37,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666919386] [2025-04-30 10:22:37,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:37,304 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:37,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-30 10:22:37,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-30 10:22:37,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-30 10:22:37,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:37,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:37,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-30 10:22:37,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:37,464 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:37,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:37,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666919386] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:37,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:37,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 28 [2025-04-30 10:22:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639400800] [2025-04-30 10:22:37,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:37,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-30 10:22:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:37,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-30 10:22:37,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2025-04-30 10:22:37,659 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:37,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 478 transitions, 7302 flow. Second operand has 30 states, 30 states have (on average 14.666666666666666) internal successors, (440), 30 states have internal predecessors, (440), 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) [2025-04-30 10:22:37,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:37,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:37,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:22:42,368 INFO L116 PetriNetUnfolderBase]: 4348/16213 cut-off events. [2025-04-30 10:22:42,368 INFO L117 PetriNetUnfolderBase]: For 1585402/1585532 co-relation queries the response was YES. [2025-04-30 10:22:42,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85320 conditions, 16213 events. 4348/16213 cut-off events. For 1585402/1585532 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 179052 event pairs, 18 based on Foata normal form. 1355/17562 useless extension candidates. Maximal degree in co-relation 85223. Up to 3825 conditions per place. [2025-04-30 10:22:42,515 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 609 selfloop transitions, 1334 changer transitions 0/1955 dead transitions. [2025-04-30 10:22:42,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 1955 transitions, 32576 flow [2025-04-30 10:22:42,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2025-04-30 10:22:42,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2025-04-30 10:22:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 2733 transitions. [2025-04-30 10:22:42,524 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6649635036496351 [2025-04-30 10:22:42,524 INFO L175 Difference]: Start difference. First operand has 228 places, 478 transitions, 7302 flow. Second operand 137 states and 2733 transitions. [2025-04-30 10:22:42,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 1955 transitions, 32576 flow [2025-04-30 10:22:44,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1955 transitions, 26387 flow, removed 3065 selfloop flow, removed 9 redundant places. [2025-04-30 10:22:44,042 INFO L231 Difference]: Finished difference. Result has 440 places, 1445 transitions, 22547 flow [2025-04-30 10:22:44,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=5729, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=478, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=137, PETRI_FLOW=22547, PETRI_PLACES=440, PETRI_TRANSITIONS=1445} [2025-04-30 10:22:44,043 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 411 predicate places. [2025-04-30 10:22:44,044 INFO L485 AbstractCegarLoop]: Abstraction has has 440 places, 1445 transitions, 22547 flow [2025-04-30 10:22:44,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 14.666666666666666) internal successors, (440), 30 states have internal predecessors, (440), 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) [2025-04-30 10:22:44,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:22:44,045 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:44,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:44,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-30 10:22:44,245 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting thread_function_dataraceErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:22:44,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1938897610, now seen corresponding path program 2 times [2025-04-30 10:22:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:44,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988048163] [2025-04-30 10:22:44,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:44,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:44,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-04-30 10:22:44,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:22:44,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:44,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:44,607 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:44,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:44,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988048163] [2025-04-30 10:22:44,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988048163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:44,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993233927] [2025-04-30 10:22:44,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:44,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:44,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:44,611 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:44,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-30 10:22:44,708 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-04-30 10:22:44,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:22:44,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:44,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:44,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-30 10:22:44,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:44,807 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:44,807 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:45,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993233927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:45,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:45,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 33 [2025-04-30 10:22:45,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886173653] [2025-04-30 10:22:45,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:45,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-30 10:22:45,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:45,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-30 10:22:45,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=757, Unknown=0, NotChecked=0, Total=1190 [2025-04-30 10:22:45,103 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:22:45,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 1445 transitions, 22547 flow. Second operand has 35 states, 35 states have (on average 14.914285714285715) internal successors, (522), 35 states have internal predecessors, (522), 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) [2025-04-30 10:22:45,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:22:45,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:22:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:23:02,729 INFO L116 PetriNetUnfolderBase]: 13492/48842 cut-off events. [2025-04-30 10:23:02,729 INFO L117 PetriNetUnfolderBase]: For 16590583/16590713 co-relation queries the response was YES. [2025-04-30 10:23:03,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283010 conditions, 48842 events. 13492/48842 cut-off events. For 16590583/16590713 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 614162 event pairs, 322 based on Foata normal form. 2291/51088 useless extension candidates. Maximal degree in co-relation 282827. Up to 10385 conditions per place. [2025-04-30 10:23:04,098 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 783 selfloop transitions, 5760 changer transitions 0/6555 dead transitions. [2025-04-30 10:23:04,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 6555 transitions, 116006 flow [2025-04-30 10:23:04,099 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2025-04-30 10:23:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2025-04-30 10:23:04,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 2737 transitions. [2025-04-30 10:23:04,102 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6291954022988506 [2025-04-30 10:23:04,102 INFO L175 Difference]: Start difference. First operand has 440 places, 1445 transitions, 22547 flow. Second operand 145 states and 2737 transitions. [2025-04-30 10:23:04,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 6555 transitions, 116006 flow [2025-04-30 10:23:27,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 6555 transitions, 89248 flow, removed 13254 selfloop flow, removed 23 redundant places. [2025-04-30 10:23:27,783 INFO L231 Difference]: Finished difference. Result has 651 places, 6167 transitions, 93607 flow [2025-04-30 10:23:27,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=17903, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1342, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=145, PETRI_FLOW=93607, PETRI_PLACES=651, PETRI_TRANSITIONS=6167} [2025-04-30 10:23:27,785 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 622 predicate places. [2025-04-30 10:23:27,785 INFO L485 AbstractCegarLoop]: Abstraction has has 651 places, 6167 transitions, 93607 flow [2025-04-30 10:23:27,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 14.914285714285715) internal successors, (522), 35 states have internal predecessors, (522), 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) [2025-04-30 10:23:27,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:23:27,785 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 9, 9, 9, 9, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:23:27,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:23:27,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:27,986 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:23:27,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:23:27,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1927231015, now seen corresponding path program 2 times [2025-04-30 10:23:27,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:23:27,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351797871] [2025-04-30 10:23:27,987 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:23:27,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:23:27,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:23:28,012 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:23:28,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:23:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:28,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:23:28,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351797871] [2025-04-30 10:23:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351797871] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:23:28,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865980853] [2025-04-30 10:23:28,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:23:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:23:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:23:28,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:23:28,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-30 10:23:28,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-04-30 10:23:28,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-04-30 10:23:28,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:23:28,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:23:28,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-30 10:23:28,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:23:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:28,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:28,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865980853] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:28,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:28,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 40 [2025-04-30 10:23:28,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828064610] [2025-04-30 10:23:28,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:28,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-30 10:23:28,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:28,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-30 10:23:28,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=510, Invalid=1212, Unknown=0, NotChecked=0, Total=1722 [2025-04-30 10:23:28,864 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2025-04-30 10:23:28,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 6167 transitions, 93607 flow. Second operand has 42 states, 42 states have (on average 14.761904761904763) internal successors, (620), 42 states have internal predecessors, (620), 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) [2025-04-30 10:23:28,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:23:28,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2025-04-30 10:23:28,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15