./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_51-mutex_ptr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_51-mutex_ptr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash da56c50ed0f75402bda65265a96d47b7969cdbfa49930cde28435a08541b430a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:52,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:52,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:52,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:52,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:52,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:52,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:52,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:52,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:52,093 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:52,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:52,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:52,094 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:52,094 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:52,094 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:52,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:52,094 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:52,095 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:52,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:52,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:52,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:52,096 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:52,097 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> da56c50ed0f75402bda65265a96d47b7969cdbfa49930cde28435a08541b430a [2025-04-29 11:00:52,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:52,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:52,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:52,320 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:52,321 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:52,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_51-mutex_ptr.c [2025-04-29 11:00:53,584 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edabe8606/44e757d9ffe6462ebf2e4195f587288c/FLAG577deb9f2 [2025-04-29 11:00:53,805 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:53,805 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_51-mutex_ptr.c [2025-04-29 11:00:53,807 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:53,807 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:53,811 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edabe8606/44e757d9ffe6462ebf2e4195f587288c/FLAG577deb9f2 [2025-04-29 11:00:54,585 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edabe8606/44e757d9ffe6462ebf2e4195f587288c [2025-04-29 11:00:54,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:54,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:54,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:54,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:54,592 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:54,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e6d86f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54, skipping insertion in model container [2025-04-29 11:00:54,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:54,757 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:54,767 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:54,789 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:54,801 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:54,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54 WrapperNode [2025-04-29 11:00:54,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:54,803 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:54,803 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:54,803 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:54,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,829 INFO L138 Inliner]: procedures = 11, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2025-04-29 11:00:54,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:54,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:54,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:54,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:54,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,850 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [5, 1]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [1, 1]. The 2 writes are split as follows [2, 0]. [2025-04-29 11:00:54,851 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,855 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,858 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,861 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,868 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:54,869 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:54,869 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:54,869 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:54,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (1/1) ... [2025-04-29 11:00:54,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:54,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:54,893 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:00:54,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:00:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:54,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:00:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-29 11:00:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:00:54,916 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:00:54,917 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:00:54,985 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:54,987 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:55,103 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:00:55,104 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:55,149 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:55,149 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:55,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55 BoogieIcfgContainer [2025-04-29 11:00:55,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:55,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:55,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:55,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:55,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:54" (1/3) ... [2025-04-29 11:00:55,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d05fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:55, skipping insertion in model container [2025-04-29 11:00:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:54" (2/3) ... [2025-04-29 11:00:55,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d05fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:55, skipping insertion in model container [2025-04-29 11:00:55,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55" (3/3) ... [2025-04-29 11:00:55,159 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_51-mutex_ptr.c [2025-04-29 11:00:55,169 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:55,170 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_51-mutex_ptr.c that has 2 procedures, 24 locations, 22 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 11:00:55,170 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:00:55,197 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:00:55,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 53 flow [2025-04-29 11:00:55,240 INFO L116 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-04-29 11:00:55,242 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:00:55,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-29 11:00:55,243 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 53 flow [2025-04-29 11:00:55,245 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-04-29 11:00:55,250 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:55,258 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6f2e098c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:55,258 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:00:55,262 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:00:55,262 INFO L116 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-04-29 11:00:55,262 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:55,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:55,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:55,262 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:55,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:55,267 INFO L85 PathProgramCache]: Analyzing trace with hash 187943926, now seen corresponding path program 1 times [2025-04-29 11:00:55,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:55,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644734190] [2025-04-29 11:00:55,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:55,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:55,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:55,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:55,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:55,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:55,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:55,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644734190] [2025-04-29 11:00:55,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644734190] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:55,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:55,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272414297] [2025-04-29 11:00:55,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:55,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:55,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:55,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:55,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:55,464 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-04-29 11:00:55,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:55,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-04-29 11:00:55,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:55,550 INFO L116 PetriNetUnfolderBase]: 36/108 cut-off events. [2025-04-29 11:00:55,550 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:55,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 108 events. 36/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 365 event pairs, 15 based on Foata normal form. 7/109 useless extension candidates. Maximal degree in co-relation 192. Up to 60 conditions per place. [2025-04-29 11:00:55,552 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 20 selfloop transitions, 4 changer transitions 6/35 dead transitions. [2025-04-29 11:00:55,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 35 transitions, 133 flow [2025-04-29 11:00:55,553 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-29 11:00:55,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5565217391304348 [2025-04-29 11:00:55,562 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 5 states and 64 transitions. [2025-04-29 11:00:55,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 35 transitions, 133 flow [2025-04-29 11:00:55,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:55,566 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 67 flow [2025-04-29 11:00:55,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2025-04-29 11:00:55,570 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2025-04-29 11:00:55,570 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 67 flow [2025-04-29 11:00:55,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:55,570 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:55,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:55,570 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:55,571 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 188050932, now seen corresponding path program 1 times [2025-04-29 11:00:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:55,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672548691] [2025-04-29 11:00:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:55,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:55,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:55,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:55,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:55,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:55,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:55,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672548691] [2025-04-29 11:00:55,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672548691] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:55,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:55,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:55,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956932115] [2025-04-29 11:00:55,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:55,652 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:00:55,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:55,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:00:55,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:00:55,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-04-29 11:00:55,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:55,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-04-29 11:00:55,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:55,752 INFO L116 PetriNetUnfolderBase]: 24/87 cut-off events. [2025-04-29 11:00:55,753 INFO L117 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-04-29 11:00:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 87 events. 24/87 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 300 event pairs, 5 based on Foata normal form. 12/99 useless extension candidates. Maximal degree in co-relation 187. Up to 40 conditions per place. [2025-04-29 11:00:55,755 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 21 selfloop transitions, 6 changer transitions 3/35 dead transitions. [2025-04-29 11:00:55,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 169 flow [2025-04-29 11:00:55,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:00:55,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2025-04-29 11:00:55,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2025-04-29 11:00:55,757 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 67 flow. Second operand 6 states and 70 transitions. [2025-04-29 11:00:55,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 169 flow [2025-04-29 11:00:55,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 160 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:55,758 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 100 flow [2025-04-29 11:00:55,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-04-29 11:00:55,759 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-04-29 11:00:55,759 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 100 flow [2025-04-29 11:00:55,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,759 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:55,759 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:55,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:55,761 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:55,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:55,763 INFO L85 PathProgramCache]: Analyzing trace with hash -569211759, now seen corresponding path program 1 times [2025-04-29 11:00:55,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:55,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067225652] [2025-04-29 11:00:55,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:55,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:55,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-29 11:00:55,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-29 11:00:55,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:55,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:55,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:55,856 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067225652] [2025-04-29 11:00:55,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067225652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:55,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:55,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:55,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82888135] [2025-04-29 11:00:55,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:55,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:55,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:55,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:55,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:55,858 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 23 [2025-04-29 11:00:55,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:55,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 23 [2025-04-29 11:00:55,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:55,916 INFO L116 PetriNetUnfolderBase]: 12/56 cut-off events. [2025-04-29 11:00:55,917 INFO L117 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-04-29 11:00:55,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 56 events. 12/56 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 3 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 136. Up to 26 conditions per place. [2025-04-29 11:00:55,918 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-04-29 11:00:55,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 156 flow [2025-04-29 11:00:55,920 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:00:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-29 11:00:55,920 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-04-29 11:00:55,920 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 100 flow. Second operand 3 states and 42 transitions. [2025-04-29 11:00:55,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 156 flow [2025-04-29 11:00:55,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:55,921 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2025-04-29 11:00:55,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-04-29 11:00:55,922 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-04-29 11:00:55,922 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2025-04-29 11:00:55,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:55,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:55,922 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:55,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:55,922 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:55,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:55,922 INFO L85 PathProgramCache]: Analyzing trace with hash 2099646476, now seen corresponding path program 1 times [2025-04-29 11:00:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:55,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508281723] [2025-04-29 11:00:55,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:55,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:55,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:55,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:55,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508281723] [2025-04-29 11:00:56,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508281723] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564038520] [2025-04-29 11:00:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:56,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:56,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:56,123 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:56,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:56,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,202 INFO L116 PetriNetUnfolderBase]: 13/54 cut-off events. [2025-04-29 11:00:56,202 INFO L117 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-04-29 11:00:56,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 54 events. 13/54 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 1 based on Foata normal form. 4/58 useless extension candidates. Maximal degree in co-relation 140. Up to 12 conditions per place. [2025-04-29 11:00:56,203 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2025-04-29 11:00:56,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 178 flow [2025-04-29 11:00:56,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:56,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-04-29 11:00:56,206 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35403726708074534 [2025-04-29 11:00:56,206 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 7 states and 57 transitions. [2025-04-29 11:00:56,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 178 flow [2025-04-29 11:00:56,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:56,209 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 106 flow [2025-04-29 11:00:56,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2025-04-29 11:00:56,210 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2025-04-29 11:00:56,210 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 106 flow [2025-04-29 11:00:56,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:56,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:00:56,211 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:56,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1204902620, now seen corresponding path program 1 times [2025-04-29 11:00:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,212 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759223508] [2025-04-29 11:00:56,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:56,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:56,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759223508] [2025-04-29 11:00:56,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759223508] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054447996] [2025-04-29 11:00:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:56,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:56,323 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:56,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:56,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,401 INFO L116 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-04-29 11:00:56,401 INFO L117 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-04-29 11:00:56,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 62 events. 12/62 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 171 event pairs, 7 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 164. Up to 28 conditions per place. [2025-04-29 11:00:56,402 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2025-04-29 11:00:56,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 202 flow [2025-04-29 11:00:56,402 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:56,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:56,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2025-04-29 11:00:56,403 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33152173913043476 [2025-04-29 11:00:56,403 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 106 flow. Second operand 8 states and 61 transitions. [2025-04-29 11:00:56,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 202 flow [2025-04-29 11:00:56,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 182 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-29 11:00:56,405 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 148 flow [2025-04-29 11:00:56,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-04-29 11:00:56,405 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2025-04-29 11:00:56,405 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 148 flow [2025-04-29 11:00:56,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,405 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,405 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:56,406 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:56,406 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:56,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -229682584, now seen corresponding path program 2 times [2025-04-29 11:00:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671135557] [2025-04-29 11:00:56,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:56,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:56,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:56,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671135557] [2025-04-29 11:00:56,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671135557] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:56,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505226285] [2025-04-29 11:00:56,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:56,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:56,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:56,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:56,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:56,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,607 INFO L116 PetriNetUnfolderBase]: 11/68 cut-off events. [2025-04-29 11:00:56,607 INFO L117 PetriNetUnfolderBase]: For 114/118 co-relation queries the response was YES. [2025-04-29 11:00:56,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 68 events. 11/68 cut-off events. For 114/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 218 event pairs, 4 based on Foata normal form. 5/73 useless extension candidates. Maximal degree in co-relation 186. Up to 31 conditions per place. [2025-04-29 11:00:56,608 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 23 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2025-04-29 11:00:56,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 256 flow [2025-04-29 11:00:56,608 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-04-29 11:00:56,609 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2025-04-29 11:00:56,609 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 148 flow. Second operand 8 states and 64 transitions. [2025-04-29 11:00:56,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 256 flow [2025-04-29 11:00:56,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:56,611 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 202 flow [2025-04-29 11:00:56,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2025-04-29 11:00:56,611 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 30 predicate places. [2025-04-29 11:00:56,611 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 202 flow [2025-04-29 11:00:56,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:56,613 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:56,613 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:56,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,614 INFO L85 PathProgramCache]: Analyzing trace with hash -150294666, now seen corresponding path program 3 times [2025-04-29 11:00:56,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,614 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069221412] [2025-04-29 11:00:56,614 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:56,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:00:56,624 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:00:56,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:00:56,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,689 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069221412] [2025-04-29 11:00:56,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069221412] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596440452] [2025-04-29 11:00:56,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:56,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:56,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:56,702 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:56,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:56,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,788 INFO L116 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-04-29 11:00:56,788 INFO L117 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-04-29 11:00:56,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 66 events. 11/66 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 7 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 201. Up to 19 conditions per place. [2025-04-29 11:00:56,789 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-04-29 11:00:56,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 34 transitions, 270 flow [2025-04-29 11:00:56,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-29 11:00:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-29 11:00:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-04-29 11:00:56,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32065217391304346 [2025-04-29 11:00:56,790 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 202 flow. Second operand 8 states and 59 transitions. [2025-04-29 11:00:56,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 34 transitions, 270 flow [2025-04-29 11:00:56,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 252 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-29 11:00:56,792 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 198 flow [2025-04-29 11:00:56,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2025-04-29 11:00:56,792 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-04-29 11:00:56,792 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 198 flow [2025-04-29 11:00:56,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:56,793 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:00:56,793 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:56,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 664531456, now seen corresponding path program 1 times [2025-04-29 11:00:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283712717] [2025-04-29 11:00:56,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:56,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:56,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283712717] [2025-04-29 11:00:56,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283712717] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:56,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119341182] [2025-04-29 11:00:56,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,906 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:56,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:56,928 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:56,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:56,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,011 INFO L116 PetriNetUnfolderBase]: 10/64 cut-off events. [2025-04-29 11:00:57,011 INFO L117 PetriNetUnfolderBase]: For 178/180 co-relation queries the response was YES. [2025-04-29 11:00:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 64 events. 10/64 cut-off events. For 178/180 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 201 event pairs, 2 based on Foata normal form. 4/68 useless extension candidates. Maximal degree in co-relation 199. Up to 19 conditions per place. [2025-04-29 11:00:57,012 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 14 selfloop transitions, 8 changer transitions 10/35 dead transitions. [2025-04-29 11:00:57,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 35 transitions, 275 flow [2025-04-29 11:00:57,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:00:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:00:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 64 transitions. [2025-04-29 11:00:57,013 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30917874396135264 [2025-04-29 11:00:57,013 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 198 flow. Second operand 9 states and 64 transitions. [2025-04-29 11:00:57,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 35 transitions, 275 flow [2025-04-29 11:00:57,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 35 transitions, 238 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-04-29 11:00:57,015 INFO L231 Difference]: Finished difference. Result has 55 places, 23 transitions, 149 flow [2025-04-29 11:00:57,015 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=55, PETRI_TRANSITIONS=23} [2025-04-29 11:00:57,015 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-04-29 11:00:57,015 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 23 transitions, 149 flow [2025-04-29 11:00:57,015 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:00:57,015 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:57,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 359928408, now seen corresponding path program 1 times [2025-04-29 11:00:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178290975] [2025-04-29 11:00:57,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:57,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:57,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178290975] [2025-04-29 11:00:57,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178290975] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:57,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084190788] [2025-04-29 11:00:57,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:57,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:57,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:57,119 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:57,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 23 transitions, 149 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:57,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,168 INFO L116 PetriNetUnfolderBase]: 4/41 cut-off events. [2025-04-29 11:00:57,168 INFO L117 PetriNetUnfolderBase]: For 100/102 co-relation queries the response was YES. [2025-04-29 11:00:57,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 41 events. 4/41 cut-off events. For 100/102 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 87 event pairs, 1 based on Foata normal form. 3/44 useless extension candidates. Maximal degree in co-relation 125. Up to 14 conditions per place. [2025-04-29 11:00:57,169 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 11 selfloop transitions, 4 changer transitions 9/27 dead transitions. [2025-04-29 11:00:57,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 27 transitions, 202 flow [2025-04-29 11:00:57,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2025-04-29 11:00:57,169 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3105590062111801 [2025-04-29 11:00:57,169 INFO L175 Difference]: Start difference. First operand has 55 places, 23 transitions, 149 flow. Second operand 7 states and 50 transitions. [2025-04-29 11:00:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 27 transitions, 202 flow [2025-04-29 11:00:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 27 transitions, 156 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-04-29 11:00:57,171 INFO L231 Difference]: Finished difference. Result has 42 places, 18 transitions, 83 flow [2025-04-29 11:00:57,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=18} [2025-04-29 11:00:57,171 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 18 predicate places. [2025-04-29 11:00:57,171 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 18 transitions, 83 flow [2025-04-29 11:00:57,171 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,171 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:57,172 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:57,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1302724280, now seen corresponding path program 2 times [2025-04-29 11:00:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232664952] [2025-04-29 11:00:57,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:57,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:57,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:57,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232664952] [2025-04-29 11:00:57,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232664952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:57,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201982460] [2025-04-29 11:00:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:57,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:57,270 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:57,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 18 transitions, 83 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:57,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,320 INFO L116 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-04-29 11:00:57,320 INFO L117 PetriNetUnfolderBase]: For 21/23 co-relation queries the response was YES. [2025-04-29 11:00:57,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 24 events. 1/24 cut-off events. For 21/23 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 28 event pairs, 1 based on Foata normal form. 3/27 useless extension candidates. Maximal degree in co-relation 59. Up to 9 conditions per place. [2025-04-29 11:00:57,321 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 8 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2025-04-29 11:00:57,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 19 transitions, 113 flow [2025-04-29 11:00:57,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2025-04-29 11:00:57,322 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2795031055900621 [2025-04-29 11:00:57,322 INFO L175 Difference]: Start difference. First operand has 42 places, 18 transitions, 83 flow. Second operand 7 states and 45 transitions. [2025-04-29 11:00:57,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 19 transitions, 113 flow [2025-04-29 11:00:57,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 19 transitions, 96 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:00:57,323 INFO L231 Difference]: Finished difference. Result has 34 places, 14 transitions, 51 flow [2025-04-29 11:00:57,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51, PETRI_PLACES=34, PETRI_TRANSITIONS=14} [2025-04-29 11:00:57,323 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-04-29 11:00:57,323 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 14 transitions, 51 flow [2025-04-29 11:00:57,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,324 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:00:57,324 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-29 11:00:57,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash -364167186, now seen corresponding path program 3 times [2025-04-29 11:00:57,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832101203] [2025-04-29 11:00:57,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:00:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-04-29 11:00:57,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-29 11:00:57,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:00:57,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832101203] [2025-04-29 11:00:57,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832101203] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:00:57,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873359841] [2025-04-29 11:00:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:00:57,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:00:57,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:00:57,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-04-29 11:00:57,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 14 transitions, 51 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-04-29 11:00:57,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,467 INFO L116 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-04-29 11:00:57,467 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-29 11:00:57,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 15 events. 1/15 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-04-29 11:00:57,468 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-04-29 11:00:57,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 71 flow [2025-04-29 11:00:57,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-04-29 11:00:57,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2484472049689441 [2025-04-29 11:00:57,468 INFO L175 Difference]: Start difference. First operand has 34 places, 14 transitions, 51 flow. Second operand 7 states and 40 transitions. [2025-04-29 11:00:57,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 71 flow [2025-04-29 11:00:57,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-04-29 11:00:57,468 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-04-29 11:00:57,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-04-29 11:00:57,469 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-04-29 11:00:57,469 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-04-29 11:00:57,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:57,471 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-04-29 11:00:57,472 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-04-29 11:00:57,472 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:00:57,473 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,476 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:00:57,476 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:57,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:57 BasicIcfg [2025-04-29 11:00:57,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:57,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:57,480 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:57,480 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:57,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55" (3/4) ... [2025-04-29 11:00:57,482 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:00:57,484 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:00:57,486 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2025-04-29 11:00:57,486 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-29 11:00:57,486 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:00:57,535 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:57,536 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:57,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:57,537 INFO L158 Benchmark]: Toolchain (without parser) took 2948.33ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 73.0MB in the end (delta: 51.3MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-04-29 11:00:57,537 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:57,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.71ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 110.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:57,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.90ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:57,538 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:57,538 INFO L158 Benchmark]: RCFGBuilder took 280.98ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 89.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:57,539 INFO L158 Benchmark]: TraceAbstraction took 2328.83ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 77.0MB in the end (delta: 12.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2025-04-29 11:00:57,539 INFO L158 Benchmark]: Witness Printer took 55.58ms. Allocated memory is still 167.8MB. Free memory was 77.0MB in the beginning and 73.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:57,540 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.71ms. Allocated memory is still 167.8MB. Free memory was 124.3MB in the beginning and 110.3MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.90ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 107.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 280.98ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 89.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2328.83ms. Allocated memory is still 167.8MB. Free memory was 89.2MB in the beginning and 77.0MB in the end (delta: 12.1MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Witness Printer took 55.58ms. Allocated memory is still 167.8MB. Free memory was 77.0MB in the beginning and 73.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 35 locations, 34 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 314 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 249 mSDsluCounter, 357 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 323 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 965 IncrementalHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 34 mSDtfsCounter, 965 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=6, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:00:57,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE