./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:46:28,975 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:46:29,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:46:29,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:46:29,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:46:29,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:46:29,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:46:29,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:46:29,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:46:29,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:46:29,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:46:29,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:46:29,045 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:46:29,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:29,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:29,048 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:29,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:46:29,048 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3e2d1ca14c91be6e836759580a015ed2d4b9eb8ea9888f9f925ea579405b630f [2025-01-10 06:46:29,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:46:29,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:46:29,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:46:29,290 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:46:29,290 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:46:29,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-01-10 06:46:30,599 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca17b0a8a/1094e29e632e4f2a94eeb9473427bb9a/FLAGd695ffbd6 [2025-01-10 06:46:30,889 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:46:30,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_28-funptr_racefree.i [2025-01-10 06:46:30,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca17b0a8a/1094e29e632e4f2a94eeb9473427bb9a/FLAGd695ffbd6 [2025-01-10 06:46:31,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca17b0a8a/1094e29e632e4f2a94eeb9473427bb9a [2025-01-10 06:46:31,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:46:31,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:46:31,204 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:31,204 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:46:31,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:46:31,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21ab9733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31, skipping insertion in model container [2025-01-10 06:46:31,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:46:31,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:31,594 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:46:31,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:46:31,667 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:46:31,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31 WrapperNode [2025-01-10 06:46:31,668 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:46:31,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:31,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:46:31,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:46:31,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,703 INFO L138 Inliner]: procedures = 252, calls = 52, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 141 [2025-01-10 06:46:31,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:46:31,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:46:31,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:46:31,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:46:31,712 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,735 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 2, 5, 5]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 0, 5, 5]. The 1 writes are split as follows [0, 0, 1, 0, 0]. [2025-01-10 06:46:31,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,750 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:46:31,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:46:31,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:46:31,757 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:46:31,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (1/1) ... [2025-01-10 06:46:31,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:46:31,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:46:31,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:46:31,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 06:46:31,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 06:46:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 06:46:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:46:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:46:31,808 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:46:31,809 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:46:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:46:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:46:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:46:31,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:46:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 06:46:31,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:46:31,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:46:31,811 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:46:31,944 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:46:31,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:46:32,122 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:46:32,122 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:46:32,319 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:46:32,319 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:46:32,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:32 BoogieIcfgContainer [2025-01-10 06:46:32,320 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:46:32,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:46:32,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:46:32,325 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:46:32,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:46:31" (1/3) ... [2025-01-10 06:46:32,326 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c2f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:32, skipping insertion in model container [2025-01-10 06:46:32,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:46:31" (2/3) ... [2025-01-10 06:46:32,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@284c2f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:46:32, skipping insertion in model container [2025-01-10 06:46:32,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:46:32" (3/3) ... [2025-01-10 06:46:32,328 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2025-01-10 06:46:32,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:46:32,341 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_28-funptr_racefree.i that has 2 procedures, 59 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-01-10 06:46:32,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:46:32,392 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-10 06:46:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 68 transitions, 143 flow [2025-01-10 06:46:32,483 INFO L124 PetriNetUnfolderBase]: 11/87 cut-off events. [2025-01-10 06:46:32,485 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:32,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 87 events. 11/87 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 239 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 59. Up to 4 conditions per place. [2025-01-10 06:46:32,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 68 transitions, 143 flow [2025-01-10 06:46:32,492 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 67 transitions, 141 flow [2025-01-10 06:46:32,499 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:32,512 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d258f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:32,512 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:46:32,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:32,521 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:46:32,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:32,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:32,522 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:32,522 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:32,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:32,527 INFO L85 PathProgramCache]: Analyzing trace with hash 370552390, now seen corresponding path program 1 times [2025-01-10 06:46:32,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:32,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784577410] [2025-01-10 06:46:32,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:32,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:32,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:32,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:32,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:32,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:32,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:32,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:32,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784577410] [2025-01-10 06:46:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784577410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:32,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:32,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746015970] [2025-01-10 06:46:32,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:32,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:32,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:32,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:32,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 68 [2025-01-10 06:46:32,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 67 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:32,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:32,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 68 [2025-01-10 06:46:32,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:33,066 INFO L124 PetriNetUnfolderBase]: 240/694 cut-off events. [2025-01-10 06:46:33,067 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:46:33,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1215 conditions, 694 events. 240/694 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3456 event pairs, 78 based on Foata normal form. 98/738 useless extension candidates. Maximal degree in co-relation 1185. Up to 464 conditions per place. [2025-01-10 06:46:33,077 INFO L140 encePairwiseOnDemand]: 54/68 looper letters, 64 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2025-01-10 06:46:33,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 90 transitions, 321 flow [2025-01-10 06:46:33,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-01-10 06:46:33,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6691176470588235 [2025-01-10 06:46:33,087 INFO L175 Difference]: Start difference. First operand has 62 places, 67 transitions, 141 flow. Second operand 4 states and 182 transitions. [2025-01-10 06:46:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 90 transitions, 321 flow [2025-01-10 06:46:33,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 90 transitions, 321 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:33,093 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 131 flow [2025-01-10 06:46:33,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=131, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2025-01-10 06:46:33,096 INFO L279 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2025-01-10 06:46:33,096 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 131 flow [2025-01-10 06:46:33,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:33,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:33,096 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:33,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:46:33,097 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:46:33,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:33,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1060684387, now seen corresponding path program 1 times [2025-01-10 06:46:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175583760] [2025-01-10 06:46:33,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:33,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:33,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:33,114 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:33,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:46:33,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:46:33,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:33,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:33,135 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:33,136 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:46:33,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:46:33,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:46:33,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:46:33,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:46:33,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:46:33,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:46:33,139 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:46:33,140 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:33,140 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:46:33,157 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:46:33,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 105 transitions, 226 flow [2025-01-10 06:46:33,170 INFO L124 PetriNetUnfolderBase]: 21/162 cut-off events. [2025-01-10 06:46:33,170 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-10 06:46:33,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 162 events. 21/162 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 589 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 103. Up to 6 conditions per place. [2025-01-10 06:46:33,171 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 105 transitions, 226 flow [2025-01-10 06:46:33,172 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 105 transitions, 226 flow [2025-01-10 06:46:33,172 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:33,173 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d258f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:33,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:46:33,174 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:33,174 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2025-01-10 06:46:33,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:33,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:33,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:33,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash 470788050, now seen corresponding path program 1 times [2025-01-10 06:46:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366237833] [2025-01-10 06:46:33,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:33,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:33,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:33,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:33,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:33,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:33,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366237833] [2025-01-10 06:46:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366237833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:33,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681107643] [2025-01-10 06:46:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:33,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:33,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:33,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:33,233 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-01-10 06:46:33,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:33,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:33,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-01-10 06:46:33,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:35,084 INFO L124 PetriNetUnfolderBase]: 9858/19622 cut-off events. [2025-01-10 06:46:35,085 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-01-10 06:46:35,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35138 conditions, 19622 events. 9858/19622 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 166365 event pairs, 4688 based on Foata normal form. 2820/20821 useless extension candidates. Maximal degree in co-relation 2012. Up to 15372 conditions per place. [2025-01-10 06:46:35,177 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 87 selfloop transitions, 3 changer transitions 0/126 dead transitions. [2025-01-10 06:46:35,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 126 transitions, 448 flow [2025-01-10 06:46:35,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-01-10 06:46:35,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-01-10 06:46:35,181 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 226 flow. Second operand 4 states and 263 transitions. [2025-01-10 06:46:35,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 126 transitions, 448 flow [2025-01-10 06:46:35,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 126 transitions, 448 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:46:35,183 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 222 flow [2025-01-10 06:46:35,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=222, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2025-01-10 06:46:35,185 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-01-10 06:46:35,185 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 222 flow [2025-01-10 06:46:35,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 4 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:35,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:35,186 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:46:35,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:46:35,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:35,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:35,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1862533248, now seen corresponding path program 1 times [2025-01-10 06:46:35,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:35,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902868134] [2025-01-10 06:46:35,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:35,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:35,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:46:35,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:46:35,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:35,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:35,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:35,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:35,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902868134] [2025-01-10 06:46:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902868134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:35,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:46:35,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187071504] [2025-01-10 06:46:35,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:46:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:35,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:46:35,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:46:35,354 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-01-10 06:46:35,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:35,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:35,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-01-10 06:46:35,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:36,888 INFO L124 PetriNetUnfolderBase]: 9314/17175 cut-off events. [2025-01-10 06:46:36,888 INFO L125 PetriNetUnfolderBase]: For 1139/1139 co-relation queries the response was YES. [2025-01-10 06:46:36,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33103 conditions, 17175 events. 9314/17175 cut-off events. For 1139/1139 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 137023 event pairs, 527 based on Foata normal form. 289/16573 useless extension candidates. Maximal degree in co-relation 1950. Up to 10580 conditions per place. [2025-01-10 06:46:36,973 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 147 selfloop transitions, 6 changer transitions 0/189 dead transitions. [2025-01-10 06:46:36,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 189 transitions, 718 flow [2025-01-10 06:46:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:46:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:46:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-01-10 06:46:36,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5873015873015873 [2025-01-10 06:46:36,976 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 222 flow. Second operand 6 states and 370 transitions. [2025-01-10 06:46:36,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 189 transitions, 718 flow [2025-01-10 06:46:36,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 189 transitions, 716 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:46:36,984 INFO L231 Difference]: Finished difference. Result has 102 places, 92 transitions, 228 flow [2025-01-10 06:46:36,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=102, PETRI_TRANSITIONS=92} [2025-01-10 06:46:36,985 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 8 predicate places. [2025-01-10 06:46:36,985 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 92 transitions, 228 flow [2025-01-10 06:46:36,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:36,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:36,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-01-10 06:46:36,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:46:36,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:36,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:36,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1903955348, now seen corresponding path program 1 times [2025-01-10 06:46:36,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:36,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350736122] [2025-01-10 06:46:36,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:36,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:36,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:46:37,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:46:37,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:37,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:37,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350736122] [2025-01-10 06:46:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350736122] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:46:37,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802804789] [2025-01-10 06:46:37,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:37,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:37,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:37,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 105 [2025-01-10 06:46:37,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 92 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:37,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:37,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 105 [2025-01-10 06:46:37,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:46:38,096 INFO L124 PetriNetUnfolderBase]: 8770/16045 cut-off events. [2025-01-10 06:46:38,097 INFO L125 PetriNetUnfolderBase]: For 2256/2256 co-relation queries the response was YES. [2025-01-10 06:46:38,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31753 conditions, 16045 events. 8770/16045 cut-off events. For 2256/2256 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 124311 event pairs, 635 based on Foata normal form. 289/15816 useless extension candidates. Maximal degree in co-relation 15354. Up to 11446 conditions per place. [2025-01-10 06:46:38,172 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 114 selfloop transitions, 6 changer transitions 0/156 dead transitions. [2025-01-10 06:46:38,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 156 transitions, 594 flow [2025-01-10 06:46:38,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:46:38,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:46:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 263 transitions. [2025-01-10 06:46:38,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6261904761904762 [2025-01-10 06:46:38,174 INFO L175 Difference]: Start difference. First operand has 102 places, 92 transitions, 228 flow. Second operand 4 states and 263 transitions. [2025-01-10 06:46:38,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 156 transitions, 594 flow [2025-01-10 06:46:38,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 156 transitions, 578 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:46:38,183 INFO L231 Difference]: Finished difference. Result has 100 places, 92 transitions, 228 flow [2025-01-10 06:46:38,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=100, PETRI_TRANSITIONS=92} [2025-01-10 06:46:38,185 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2025-01-10 06:46:38,185 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 92 transitions, 228 flow [2025-01-10 06:46:38,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.25) internal successors, (153), 4 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:38,185 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-01-10 06:46:38,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:46:38,186 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:46:38,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:38,187 INFO L85 PathProgramCache]: Analyzing trace with hash -45005227, now seen corresponding path program 1 times [2025-01-10 06:46:38,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:38,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572497647] [2025-01-10 06:46:38,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:38,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:38,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:38,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:38,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:38,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:46:38,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:46:38,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:46:38,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:46:38,229 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:46:38,232 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:46:38,232 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:46:38,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:46:38,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:46:38,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:46:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:46:38,234 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 06:46:38,234 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:46:38,234 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:46:38,271 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:46:38,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 142 transitions, 311 flow [2025-01-10 06:46:38,314 INFO L124 PetriNetUnfolderBase]: 34/256 cut-off events. [2025-01-10 06:46:38,314 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-10 06:46:38,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 256 events. 34/256 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1070 event pairs, 1 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 177. Up to 12 conditions per place. [2025-01-10 06:46:38,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 142 transitions, 311 flow [2025-01-10 06:46:38,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 142 transitions, 311 flow [2025-01-10 06:46:38,319 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:46:38,320 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5d258f8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:46:38,320 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:46:38,321 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:46:38,322 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:46:38,322 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:46:38,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:46:38,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:46:38,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:46:38,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:46:38,322 INFO L85 PathProgramCache]: Analyzing trace with hash 606332995, now seen corresponding path program 1 times [2025-01-10 06:46:38,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:46:38,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488969909] [2025-01-10 06:46:38,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:46:38,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:46:38,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:46:38,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:46:38,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:46:38,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:46:38,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:46:38,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:46:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488969909] [2025-01-10 06:46:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488969909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:46:38,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:46:38,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:46:38,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944727879] [2025-01-10 06:46:38,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:46:38,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:46:38,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:46:38,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:46:38,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:46:38,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2025-01-10 06:46:38,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 142 transitions, 311 flow. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:46:38,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:46:38,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2025-01-10 06:46:38,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:47:04,422 INFO L124 PetriNetUnfolderBase]: 260231/450654 cut-off events. [2025-01-10 06:47:04,422 INFO L125 PetriNetUnfolderBase]: For 3342/3342 co-relation queries the response was YES. [2025-01-10 06:47:05,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 809739 conditions, 450654 events. 260231/450654 cut-off events. For 3342/3342 co-relation queries the response was YES. Maximal size of possible extension queue 7473. Compared 4887775 event pairs, 170145 based on Foata normal form. 70076/486621 useless extension candidates. Maximal degree in co-relation 36545. Up to 356848 conditions per place. [2025-01-10 06:47:06,762 INFO L140 encePairwiseOnDemand]: 116/142 looper letters, 105 selfloop transitions, 3 changer transitions 0/157 dead transitions. [2025-01-10 06:47:06,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 157 transitions, 557 flow [2025-01-10 06:47:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:47:06,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:47:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2025-01-10 06:47:06,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.596830985915493 [2025-01-10 06:47:06,764 INFO L175 Difference]: Start difference. First operand has 126 places, 142 transitions, 311 flow. Second operand 4 states and 339 transitions. [2025-01-10 06:47:06,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 157 transitions, 557 flow [2025-01-10 06:47:06,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 157 transitions, 557 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:47:06,786 INFO L231 Difference]: Finished difference. Result has 131 places, 124 transitions, 295 flow [2025-01-10 06:47:06,789 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=131, PETRI_TRANSITIONS=124} [2025-01-10 06:47:06,790 INFO L279 CegarLoopForPetriNet]: 126 programPoint places, 5 predicate places. [2025-01-10 06:47:06,790 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 295 flow [2025-01-10 06:47:06,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 4 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:06,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:47:06,792 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:47:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:47:06,792 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:47:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:47:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1953996320, now seen corresponding path program 1 times [2025-01-10 06:47:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:47:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679968393] [2025-01-10 06:47:06,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:47:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:47:06,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:47:06,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:47:06,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:47:06,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:47:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:47:06,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:47:06,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679968393] [2025-01-10 06:47:06,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679968393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:47:06,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:47:06,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:47:06,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152035158] [2025-01-10 06:47:06,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:47:06,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:47:06,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:47:06,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:47:06,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:47:06,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 142 [2025-01-10 06:47:06,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 295 flow. Second operand has 6 states, 6 states have (on average 50.5) internal successors, (303), 6 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:47:06,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:47:06,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 142 [2025-01-10 06:47:06,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand