./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:22,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:22,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:46:22,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:22,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:22,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:22,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:22,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:22,919 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:22,919 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:22,919 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:22,919 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:22,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:22,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:22,919 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:22,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:22,920 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:22,921 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:22,921 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:22,921 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:22,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:22,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:22,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:22,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:22,922 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-jdk21/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 -> 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 [2025-01-10 06:46:23,186 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:23,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:23,198 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:23,199 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:23,199 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:23,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-01-10 06:46:24,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db778bf83/6357378922874da5add28540d29e3afe/FLAG1b295cfe0 [2025-01-10 06:46:24,821 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:24,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-01-10 06:46:24,830 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db778bf83/6357378922874da5add28540d29e3afe/FLAG1b295cfe0 [2025-01-10 06:46:24,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db778bf83/6357378922874da5add28540d29e3afe [2025-01-10 06:46:24,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:24,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:24,844 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:24,844 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:24,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:24,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:24" (1/1) ... [2025-01-10 06:46:24,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6877c3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:24, skipping insertion in model container [2025-01-10 06:46:24,848 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:24" (1/1) ... [2025-01-10 06:46:24,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:25,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:25,152 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:25,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:25,198 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:46:25,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25 WrapperNode [2025-01-10 06:46:25,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:25,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:25,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:46:25,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:46:25,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,211 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,223 INFO L138 Inliner]: procedures = 170, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-01-10 06:46:25,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:25,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:46:25,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:46:25,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:46:25,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,239 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-01-10 06:46:25,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,243 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,244 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,249 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,251 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:46:25,252 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:46:25,252 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:46:25,252 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:46:25,253 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (1/1) ... [2025-01-10 06:46:25,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:25,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:46:25,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:46:25,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:46:25,299 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:46:25,299 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:46:25,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:46:25,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:46:25,301 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:46:25,420 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:46:25,425 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:46:25,609 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:46:25,611 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:46:25,755 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:46:25,755 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:46:25,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:25 BoogieIcfgContainer [2025-01-10 06:46:25,755 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:46:25,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:46:25,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:46:25,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:46:25,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:24" (1/3) ... [2025-01-10 06:46:25,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43806ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:25, skipping insertion in model container [2025-01-10 06:46:25,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:25" (2/3) ... [2025-01-10 06:46:25,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43806ca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:25, skipping insertion in model container [2025-01-10 06:46:25,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:25" (3/3) ... [2025-01-10 06:46:25,765 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2025-01-10 06:46:25,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:46:25,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_22-deref_read_racefree.i that has 2 procedures, 44 locations, 1 initial locations, 5 loop locations, and 6 error locations. [2025-01-10 06:46:25,780 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:46:25,809 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:46:25,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 52 transitions, 108 flow [2025-01-10 06:46:25,853 INFO L124 PetriNetUnfolderBase]: 10/65 cut-off events. [2025-01-10 06:46:25,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:25,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 65 events. 10/65 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 187 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 49. Up to 4 conditions per place. [2025-01-10 06:46:25,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 52 transitions, 108 flow [2025-01-10 06:46:25,860 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 52 transitions, 108 flow [2025-01-10 06:46:25,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:25,876 INFO L333 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;@5d7fc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:25,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-10 06:46:25,883 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:25,883 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:46:25,883 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:25,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:25,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:25,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:46:25,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:25,887 INFO L85 PathProgramCache]: Analyzing trace with hash 330017096, now seen corresponding path program 1 times [2025-01-10 06:46:25,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:25,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753713451] [2025-01-10 06:46:25,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:25,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:25,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:25,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:25,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:25,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:26,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:26,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:26,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753713451] [2025-01-10 06:46:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753713451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:26,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156815162] [2025-01-10 06:46:26,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:26,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:26,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:26,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:26,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 52 [2025-01-10 06:46:26,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 52 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:26,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:26,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 52 [2025-01-10 06:46:26,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:26,315 INFO L124 PetriNetUnfolderBase]: 110/310 cut-off events. [2025-01-10 06:46:26,316 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:26,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 559 conditions, 310 events. 110/310 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1454 event pairs, 16 based on Foata normal form. 68/364 useless extension candidates. Maximal degree in co-relation 538. Up to 208 conditions per place. [2025-01-10 06:46:26,321 INFO L140 encePairwiseOnDemand]: 38/52 looper letters, 43 selfloop transitions, 3 changer transitions 0/65 dead transitions. [2025-01-10 06:46:26,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 65 transitions, 226 flow [2025-01-10 06:46:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2025-01-10 06:46:26,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6971153846153846 [2025-01-10 06:46:26,335 INFO L175 Difference]: Start difference. First operand has 47 places, 52 transitions, 108 flow. Second operand 4 states and 145 transitions. [2025-01-10 06:46:26,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 65 transitions, 226 flow [2025-01-10 06:46:26,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:26,341 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 98 flow [2025-01-10 06:46:26,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-01-10 06:46:26,347 INFO L279 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2025-01-10 06:46:26,347 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 98 flow [2025-01-10 06:46:26,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:26,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:26,348 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:26,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:46:26,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-01-10 06:46:26,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:26,349 INFO L85 PathProgramCache]: Analyzing trace with hash 359493455, now seen corresponding path program 1 times [2025-01-10 06:46:26,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:26,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388331624] [2025-01-10 06:46:26,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:26,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:26,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:26,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:26,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:26,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:26,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:26,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:26,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:26,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:26,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:26,414 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:26,414 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:26,415 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-10 06:46:26,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-01-10 06:46:26,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-01-10 06:46:26,417 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-01-10 06:46:26,418 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-01-10 06:46:26,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:46:26,419 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:46:26,420 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:26,420 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:46:26,434 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:46:26,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 84 transitions, 178 flow [2025-01-10 06:46:26,446 INFO L124 PetriNetUnfolderBase]: 18/115 cut-off events. [2025-01-10 06:46:26,446 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:46:26,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 115 events. 18/115 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 407 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 80. Up to 6 conditions per place. [2025-01-10 06:46:26,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 84 transitions, 178 flow [2025-01-10 06:46:26,448 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 84 transitions, 178 flow [2025-01-10 06:46:26,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:26,449 INFO L333 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;@5d7fc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:26,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-10 06:46:26,451 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:26,451 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:26,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:26,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:26,452 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:26,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:46:26,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:26,452 INFO L85 PathProgramCache]: Analyzing trace with hash 410208507, now seen corresponding path program 1 times [2025-01-10 06:46:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080139586] [2025-01-10 06:46:26,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:26,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:26,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:26,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:26,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:26,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080139586] [2025-01-10 06:46:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080139586] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29997125] [2025-01-10 06:46:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:26,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:26,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:26,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:26,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:26,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-01-10 06:46:26,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-10 06:46:26,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:26,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-01-10 06:46:26,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:27,248 INFO L124 PetriNetUnfolderBase]: 3410/7375 cut-off events. [2025-01-10 06:46:27,249 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-10 06:46:27,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12833 conditions, 7375 events. 3410/7375 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 61348 event pairs, 1584 based on Foata normal form. 1448/8169 useless extension candidates. Maximal degree in co-relation 1044. Up to 5380 conditions per place. [2025-01-10 06:46:27,296 INFO L140 encePairwiseOnDemand]: 64/84 looper letters, 59 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2025-01-10 06:46:27,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 324 flow [2025-01-10 06:46:27,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:27,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 223 transitions. [2025-01-10 06:46:27,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6636904761904762 [2025-01-10 06:46:27,300 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 178 flow. Second operand 4 states and 223 transitions. [2025-01-10 06:46:27,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 324 flow [2025-01-10 06:46:27,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 95 transitions, 324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:27,303 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 174 flow [2025-01-10 06:46:27,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-01-10 06:46:27,304 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2025-01-10 06:46:27,304 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 174 flow [2025-01-10 06:46:27,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 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-01-10 06:46:27,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:27,305 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:27,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:46:27,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:46:27,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:27,305 INFO L85 PathProgramCache]: Analyzing trace with hash -2052958493, now seen corresponding path program 1 times [2025-01-10 06:46:27,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:27,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096173601] [2025-01-10 06:46:27,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:27,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:27,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:27,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:27,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:27,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:27,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:27,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096173601] [2025-01-10 06:46:27,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096173601] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:27,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:27,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:27,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522548857] [2025-01-10 06:46:27,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:27,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:27,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:27,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:27,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:27,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 84 [2025-01-10 06:46:27,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:27,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:27,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 84 [2025-01-10 06:46:27,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:28,012 INFO L124 PetriNetUnfolderBase]: 3033/6479 cut-off events. [2025-01-10 06:46:28,012 INFO L125 PetriNetUnfolderBase]: For 394/729 co-relation queries the response was YES. [2025-01-10 06:46:28,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11743 conditions, 6479 events. 3033/6479 cut-off events. For 394/729 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 51726 event pairs, 949 based on Foata normal form. 140/6281 useless extension candidates. Maximal degree in co-relation 11642. Up to 4227 conditions per place. [2025-01-10 06:46:28,042 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 82 selfloop transitions, 6 changer transitions 0/123 dead transitions. [2025-01-10 06:46:28,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 123 transitions, 480 flow [2025-01-10 06:46:28,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 259 transitions. [2025-01-10 06:46:28,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 06:46:28,044 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 174 flow. Second operand 5 states and 259 transitions. [2025-01-10 06:46:28,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 123 transitions, 480 flow [2025-01-10 06:46:28,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 123 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:28,048 INFO L231 Difference]: Finished difference. Result has 86 places, 77 transitions, 216 flow [2025-01-10 06:46:28,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=216, PETRI_PLACES=86, PETRI_TRANSITIONS=77} [2025-01-10 06:46:28,048 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-01-10 06:46:28,048 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 77 transitions, 216 flow [2025-01-10 06:46:28,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:28,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:28,049 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:28,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:46:28,049 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:46:28,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -668083952, now seen corresponding path program 1 times [2025-01-10 06:46:28,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968782992] [2025-01-10 06:46:28,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:28,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:28,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:28,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:28,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:28,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:28,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:28,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968782992] [2025-01-10 06:46:28,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968782992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:28,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:28,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:28,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483171215] [2025-01-10 06:46:28,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:28,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:28,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:28,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:28,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:28,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-01-10 06:46:28,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 77 transitions, 216 flow. Second operand has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 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-01-10 06:46:28,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:28,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-01-10 06:46:28,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:28,954 INFO L124 PetriNetUnfolderBase]: 3318/6480 cut-off events. [2025-01-10 06:46:28,955 INFO L125 PetriNetUnfolderBase]: For 1235/1235 co-relation queries the response was YES. [2025-01-10 06:46:28,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13334 conditions, 6480 events. 3318/6480 cut-off events. For 1235/1235 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 50199 event pairs, 523 based on Foata normal form. 152/6327 useless extension candidates. Maximal degree in co-relation 12370. Up to 3179 conditions per place. [2025-01-10 06:46:28,986 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 114 selfloop transitions, 6 changer transitions 0/153 dead transitions. [2025-01-10 06:46:28,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 153 transitions, 666 flow [2025-01-10 06:46:28,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:28,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:28,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2025-01-10 06:46:28,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-01-10 06:46:28,989 INFO L175 Difference]: Start difference. First operand has 86 places, 77 transitions, 216 flow. Second operand 6 states and 304 transitions. [2025-01-10 06:46:28,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 153 transitions, 666 flow [2025-01-10 06:46:28,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 153 transitions, 666 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:28,994 INFO L231 Difference]: Finished difference. Result has 90 places, 76 transitions, 224 flow [2025-01-10 06:46:28,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=90, PETRI_TRANSITIONS=76} [2025-01-10 06:46:28,995 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2025-01-10 06:46:28,995 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 76 transitions, 224 flow [2025-01-10 06:46:28,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.5) internal successors, (207), 6 states have internal predecessors, (207), 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-01-10 06:46:28,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:28,995 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:46:28,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:46:28,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:28,996 INFO L85 PathProgramCache]: Analyzing trace with hash 764234382, now seen corresponding path program 1 times [2025-01-10 06:46:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068073385] [2025-01-10 06:46:28,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:29,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:29,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:29,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:29,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:29,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:29,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:29,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068073385] [2025-01-10 06:46:29,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068073385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:29,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:29,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:29,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649253697] [2025-01-10 06:46:29,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:29,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:29,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:29,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:29,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 84 [2025-01-10 06:46:29,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 76 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-01-10 06:46:29,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:29,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 84 [2025-01-10 06:46:29,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:29,628 INFO L124 PetriNetUnfolderBase]: 3039/5901 cut-off events. [2025-01-10 06:46:29,628 INFO L125 PetriNetUnfolderBase]: For 1854/1854 co-relation queries the response was YES. [2025-01-10 06:46:29,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12602 conditions, 5901 events. 3039/5901 cut-off events. For 1854/1854 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 44414 event pairs, 254 based on Foata normal form. 152/5953 useless extension candidates. Maximal degree in co-relation 11695. Up to 3633 conditions per place. [2025-01-10 06:46:29,651 INFO L140 encePairwiseOnDemand]: 79/84 looper letters, 91 selfloop transitions, 6 changer transitions 0/130 dead transitions. [2025-01-10 06:46:29,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 130 transitions, 570 flow [2025-01-10 06:46:29,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:29,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:29,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-01-10 06:46:29,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6339285714285714 [2025-01-10 06:46:29,653 INFO L175 Difference]: Start difference. First operand has 90 places, 76 transitions, 224 flow. Second operand 4 states and 213 transitions. [2025-01-10 06:46:29,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 130 transitions, 570 flow [2025-01-10 06:46:29,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 130 transitions, 554 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:46:29,660 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 224 flow [2025-01-10 06:46:29,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-01-10 06:46:29,660 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2025-01-10 06:46:29,660 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 224 flow [2025-01-10 06:46:29,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 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-01-10 06:46:29,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:29,661 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:46:29,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:46:29,661 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-01-10 06:46:29,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:29,661 INFO L85 PathProgramCache]: Analyzing trace with hash -10153862, now seen corresponding path program 1 times [2025-01-10 06:46:29,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:29,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016660619] [2025-01-10 06:46:29,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:29,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:29,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:29,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:29,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:29,677 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:29,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:29,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:29,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:29,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:29,693 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:29,693 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:29,693 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-10 06:46:29,693 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-01-10 06:46:29,694 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-01-10 06:46:29,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:46:29,694 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-10 06:46:29,694 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:29,694 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:46:29,712 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:46:29,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 116 transitions, 250 flow [2025-01-10 06:46:29,726 INFO L124 PetriNetUnfolderBase]: 26/165 cut-off events. [2025-01-10 06:46:29,726 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:46:29,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 165 events. 26/165 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 628 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 126. Up to 8 conditions per place. [2025-01-10 06:46:29,727 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 116 transitions, 250 flow [2025-01-10 06:46:29,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 116 transitions, 250 flow [2025-01-10 06:46:29,730 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:29,731 INFO L333 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;@5d7fc2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:29,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 06:46:29,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:29,732 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:46:29,732 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:29,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:29,732 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:29,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:46:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:29,736 INFO L85 PathProgramCache]: Analyzing trace with hash 520937678, now seen corresponding path program 1 times [2025-01-10 06:46:29,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:29,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-01-10 06:46:29,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:29,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:29,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:29,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:29,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:29,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:29,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377546316] [2025-01-10 06:46:29,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377546316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:29,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:29,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:29,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264001629] [2025-01-10 06:46:29,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:29,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:29,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:29,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:29,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 116 [2025-01-10 06:46:29,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 116 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-01-10 06:46:29,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:29,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 116 [2025-01-10 06:46:29,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:36,198 INFO L124 PetriNetUnfolderBase]: 63602/114872 cut-off events. [2025-01-10 06:46:36,199 INFO L125 PetriNetUnfolderBase]: For 1092/1092 co-relation queries the response was YES. [2025-01-10 06:46:36,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203563 conditions, 114872 events. 63602/114872 cut-off events. For 1092/1092 co-relation queries the response was YES. Maximal size of possible extension queue 2805. Compared 1191256 event pairs, 41184 based on Foata normal form. 25124/130894 useless extension candidates. Maximal degree in co-relation 13419. Up to 88036 conditions per place. [2025-01-10 06:46:36,805 INFO L140 encePairwiseOnDemand]: 90/116 looper letters, 71 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-01-10 06:46:36,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 408 flow [2025-01-10 06:46:36,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 297 transitions. [2025-01-10 06:46:36,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6400862068965517 [2025-01-10 06:46:36,807 INFO L175 Difference]: Start difference. First operand has 103 places, 116 transitions, 250 flow. Second operand 4 states and 297 transitions. [2025-01-10 06:46:36,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 408 flow [2025-01-10 06:46:36,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 121 transitions, 406 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:36,809 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 232 flow [2025-01-10 06:46:36,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=232, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-01-10 06:46:36,810 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 5 predicate places. [2025-01-10 06:46:36,810 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 232 flow [2025-01-10 06:46:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.25) internal successors, (193), 4 states have internal predecessors, (193), 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-01-10 06:46:36,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:36,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:36,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:46:36,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:46:36,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 597869808, now seen corresponding path program 1 times [2025-01-10 06:46:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-01-10 06:46:36,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:36,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:36,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:36,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:36,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:36,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:36,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674692684] [2025-01-10 06:46:36,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674692684] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:36,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598060613] [2025-01-10 06:46:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:36,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:36,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:36,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:36,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:36,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 116 [2025-01-10 06:46:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-01-10 06:46:36,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:36,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 116 [2025-01-10 06:46:36,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:42,690 INFO L124 PetriNetUnfolderBase]: 58586/97290 cut-off events. [2025-01-10 06:46:42,691 INFO L125 PetriNetUnfolderBase]: For 7918/7918 co-relation queries the response was YES. [2025-01-10 06:46:42,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186501 conditions, 97290 events. 58586/97290 cut-off events. For 7918/7918 co-relation queries the response was YES. Maximal size of possible extension queue 2317. Compared 917818 event pairs, 7884 based on Foata normal form. 1872/94984 useless extension candidates. Maximal degree in co-relation 15843. Up to 48378 conditions per place. [2025-01-10 06:46:43,287 INFO L140 encePairwiseOnDemand]: 111/116 looper letters, 133 selfloop transitions, 6 changer transitions 0/186 dead transitions. [2025-01-10 06:46:43,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 186 transitions, 684 flow [2025-01-10 06:46:43,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2025-01-10 06:46:43,289 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6063218390804598 [2025-01-10 06:46:43,289 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 232 flow. Second operand 6 states and 422 transitions. [2025-01-10 06:46:43,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 186 transitions, 684 flow [2025-01-10 06:46:43,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 186 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:43,304 INFO L231 Difference]: Finished difference. Result has 111 places, 97 transitions, 238 flow [2025-01-10 06:46:43,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=111, PETRI_TRANSITIONS=97} [2025-01-10 06:46:43,308 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 8 predicate places. [2025-01-10 06:46:43,308 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 97 transitions, 238 flow [2025-01-10 06:46:43,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 48.5) internal successors, (291), 6 states have internal predecessors, (291), 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-01-10 06:46:43,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:43,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:43,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:46:43,308 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:46:43,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:43,309 INFO L85 PathProgramCache]: Analyzing trace with hash 237793122, now seen corresponding path program 1 times [2025-01-10 06:46:43,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:43,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-01-10 06:46:43,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:43,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:43,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:43,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:43,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:43,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:43,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:43,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437147865] [2025-01-10 06:46:43,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437147865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:43,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:43,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:43,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37169905] [2025-01-10 06:46:43,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:43,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:43,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:43,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:43,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:43,382 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 116 [2025-01-10 06:46:43,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 97 transitions, 238 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-01-10 06:46:43,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:43,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 116 [2025-01-10 06:46:43,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:49,421 INFO L124 PetriNetUnfolderBase]: 59409/103310 cut-off events. [2025-01-10 06:46:49,422 INFO L125 PetriNetUnfolderBase]: For 14287/16535 co-relation queries the response was YES. [2025-01-10 06:46:49,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195400 conditions, 103310 events. 59409/103310 cut-off events. For 14287/16535 co-relation queries the response was YES. Maximal size of possible extension queue 2595. Compared 1009317 event pairs, 23553 based on Foata normal form. 1570/99839 useless extension candidates. Maximal degree in co-relation 167322. Up to 76131 conditions per place. [2025-01-10 06:46:50,096 INFO L140 encePairwiseOnDemand]: 109/116 looper letters, 118 selfloop transitions, 8 changer transitions 0/174 dead transitions. [2025-01-10 06:46:50,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 174 transitions, 701 flow [2025-01-10 06:46:50,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:46:50,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:46:50,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 367 transitions. [2025-01-10 06:46:50,102 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6327586206896552 [2025-01-10 06:46:50,102 INFO L175 Difference]: Start difference. First operand has 111 places, 97 transitions, 238 flow. Second operand 5 states and 367 transitions. [2025-01-10 06:46:50,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 174 transitions, 701 flow [2025-01-10 06:46:50,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 174 transitions, 678 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-10 06:46:50,109 INFO L231 Difference]: Finished difference. Result has 114 places, 104 transitions, 287 flow [2025-01-10 06:46:50,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=287, PETRI_PLACES=114, PETRI_TRANSITIONS=104} [2025-01-10 06:46:50,109 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 11 predicate places. [2025-01-10 06:46:50,109 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 104 transitions, 287 flow [2025-01-10 06:46:50,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 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-01-10 06:46:50,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:50,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:50,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:46:50,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:46:50,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:50,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1354095394, now seen corresponding path program 1 times [2025-01-10 06:46:50,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:50,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243950859] [2025-01-10 06:46:50,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:50,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:50,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:50,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:50,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:50,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243950859] [2025-01-10 06:46:50,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243950859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:50,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:50,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536744353] [2025-01-10 06:46:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:50,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:50,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:50,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:50,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 116 [2025-01-10 06:46:50,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 104 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-01-10 06:46:50,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:50,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 116 [2025-01-10 06:46:50,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:56,158 INFO L124 PetriNetUnfolderBase]: 60195/98029 cut-off events. [2025-01-10 06:46:56,158 INFO L125 PetriNetUnfolderBase]: For 27408/27408 co-relation queries the response was YES. [2025-01-10 06:46:56,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203630 conditions, 98029 events. 60195/98029 cut-off events. For 27408/27408 co-relation queries the response was YES. Maximal size of possible extension queue 2415. Compared 902398 event pairs, 7405 based on Foata normal form. 2120/98249 useless extension candidates. Maximal degree in co-relation 193792. Up to 62433 conditions per place. [2025-01-10 06:46:56,742 INFO L140 encePairwiseOnDemand]: 111/116 looper letters, 131 selfloop transitions, 6 changer transitions 0/184 dead transitions. [2025-01-10 06:46:56,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 184 transitions, 791 flow [2025-01-10 06:46:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 303 transitions. [2025-01-10 06:46:56,744 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6530172413793104 [2025-01-10 06:46:56,744 INFO L175 Difference]: Start difference. First operand has 114 places, 104 transitions, 287 flow. Second operand 4 states and 303 transitions. [2025-01-10 06:46:56,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 184 transitions, 791 flow [2025-01-10 06:46:56,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 184 transitions, 787 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:56,786 INFO L231 Difference]: Finished difference. Result has 116 places, 104 transitions, 299 flow [2025-01-10 06:46:56,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=116, PETRI_TRANSITIONS=104} [2025-01-10 06:46:56,786 INFO L279 CegarLoopForPetriNet]: 103 programPoint places, 13 predicate places. [2025-01-10 06:46:56,787 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 104 transitions, 299 flow [2025-01-10 06:46:56,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 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-01-10 06:46:56,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:56,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:56,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:46:56,787 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-01-10 06:46:56,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:56,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1399574654, now seen corresponding path program 1 times [2025-01-10 06:46:56,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:56,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-10 06:46:56,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:56,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:56,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:46:56,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:46:56,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:56,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:56,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:56,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043982083] [2025-01-10 06:46:56,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043982083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:56,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:56,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:56,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256785787] [2025-01-10 06:46:56,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:56,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:56,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:56,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:56,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:56,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 116 [2025-01-10 06:46:56,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 104 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 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-01-10 06:46:56,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:56,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 116 [2025-01-10 06:46:56,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand