./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d 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_06-cond_racing1.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 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 14:04:53,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:04:53,679 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:04:53,686 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:04:53,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:04:53,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:04:53,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:04:53,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:04:53,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:04:53,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:04:53,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:04:53,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:04:53,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:04:53,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:04:53,719 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:04:53,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:04:53,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:04:53,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:04:53,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:04:53,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:04:53,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:04:53,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:04:53,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:04:53,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:04:53,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:04:53,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:04:53,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:53,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:04:53,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:04:53,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:04:53,724 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 -> 830cb16a3cbc120e059f0ed7638e33ed20360a11f425952cf536aa3d659b86fc [2025-02-08 14:04:53,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:04:54,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:04:54,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:04:54,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:04:54,015 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:04:54,017 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_06-cond_racing1.i [2025-02-08 14:04:55,284 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2923d3f/b669b0bd9a134ca5b120933d5e5cb76b/FLAG4ddca7c3d [2025-02-08 14:04:55,596 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:04:55,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_06-cond_racing1.i [2025-02-08 14:04:55,610 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2923d3f/b669b0bd9a134ca5b120933d5e5cb76b/FLAG4ddca7c3d [2025-02-08 14:04:55,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d2923d3f/b669b0bd9a134ca5b120933d5e5cb76b [2025-02-08 14:04:55,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:04:55,628 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:04:55,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:55,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:04:55,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:04:55,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:55" (1/1) ... [2025-02-08 14:04:55,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f5dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:55, skipping insertion in model container [2025-02-08 14:04:55,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:04:55" (1/1) ... [2025-02-08 14:04:55,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:04:56,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:56,023 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:04:56,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:04:56,133 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:04:56,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56 WrapperNode [2025-02-08 14:04:56,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:04:56,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:56,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:04:56,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:04:56,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,189 INFO L138 Inliner]: procedures = 271, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-02-08 14:04:56,190 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:04:56,191 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:04:56,191 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:04:56,191 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:04:56,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,224 INFO L175 MemorySlicer]: Split 19 memory accesses to 5 slices as follows [2, 5, 5, 5, 2]. 26 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5, 0]. The 1 writes are split as follows [0, 0, 0, 0, 1]. [2025-02-08 14:04:56,226 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:04:56,242 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:04:56,242 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:04:56,242 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:04:56,243 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (1/1) ... [2025-02-08 14:04:56,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:04:56,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:04:56,271 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-02-08 14:04:56,273 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-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:04:56,288 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 14:04:56,288 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 14:04:56,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:04:56,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:04:56,290 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:04:56,418 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:04:56,420 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:04:56,611 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-02-08 14:04:56,612 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-02-08 14:04:56,660 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:04:56,660 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:04:56,805 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:04:56,805 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:04:56,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:56 BoogieIcfgContainer [2025-02-08 14:04:56,806 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:04:56,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:04:56,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:04:56,813 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:04:56,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:04:55" (1/3) ... [2025-02-08 14:04:56,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e2c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:56, skipping insertion in model container [2025-02-08 14:04:56,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:04:56" (2/3) ... [2025-02-08 14:04:56,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e2c2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:04:56, skipping insertion in model container [2025-02-08 14:04:56,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:04:56" (3/3) ... [2025-02-08 14:04:56,815 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_06-cond_racing1.i [2025-02-08 14:04:56,828 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:04:56,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_06-cond_racing1.i that has 2 procedures, 58 locations, 1 initial locations, 6 loop locations, and 8 error locations. [2025-02-08 14:04:56,830 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:04:56,894 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 14:04:56,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 70 transitions, 147 flow [2025-02-08 14:04:56,974 INFO L124 PetriNetUnfolderBase]: 17/93 cut-off events. [2025-02-08 14:04:56,976 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:56,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 93 events. 17/93 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 294 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 61. Up to 6 conditions per place. [2025-02-08 14:04:56,980 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 70 transitions, 147 flow [2025-02-08 14:04:56,983 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 69 transitions, 145 flow [2025-02-08 14:04:56,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:57,002 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;@3ded07dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:57,002 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 14:04:57,008 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:57,009 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2025-02-08 14:04:57,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:57,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:57,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:57,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:57,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash 326513558, now seen corresponding path program 1 times [2025-02-08 14:04:57,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:57,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270289497] [2025-02-08 14:04:57,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:57,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:57,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:57,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:04:57,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270289497] [2025-02-08 14:04:57,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270289497] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:57,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:57,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:57,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269289177] [2025-02-08 14:04:57,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:57,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:57,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:57,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:57,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:57,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 70 [2025-02-08 14:04:57,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 69 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-02-08 14:04:57,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:57,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 70 [2025-02-08 14:04:57,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:57,610 INFO L124 PetriNetUnfolderBase]: 157/458 cut-off events. [2025-02-08 14:04:57,610 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 14:04:57,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 458 events. 157/458 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2343 event pairs, 0 based on Foata normal form. 108/497 useless extension candidates. Maximal degree in co-relation 726. Up to 256 conditions per place. [2025-02-08 14:04:57,615 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 47 selfloop transitions, 3 changer transitions 0/82 dead transitions. [2025-02-08 14:04:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 271 flow [2025-02-08 14:04:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:57,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2025-02-08 14:04:57,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7178571428571429 [2025-02-08 14:04:57,631 INFO L175 Difference]: Start difference. First operand has 61 places, 69 transitions, 145 flow. Second operand 4 states and 201 transitions. [2025-02-08 14:04:57,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 271 flow [2025-02-08 14:04:57,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 271 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:57,641 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 135 flow [2025-02-08 14:04:57,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-02-08 14:04:57,648 INFO L279 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2025-02-08 14:04:57,648 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 135 flow [2025-02-08 14:04:57,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 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-02-08 14:04:57,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:57,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:57,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:04:57,649 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-02-08 14:04:57,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -935266759, now seen corresponding path program 1 times [2025-02-08 14:04:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703617546] [2025-02-08 14:04:57,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:57,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:57,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:57,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:57,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:57,685 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:04:57,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 14:04:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 14:04:57,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:04:57,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:04:57,726 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:04:57,729 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 14:04:57,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-02-08 14:04:57,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-02-08 14:04:57,730 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-02-08 14:04:57,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-02-08 14:04:57,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-02-08 14:04:57,731 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-02-08 14:04:57,732 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-02-08 14:04:57,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 14:04:57,733 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-02-08 14:04:57,736 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:04:57,736 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 14:04:57,764 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:04:57,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 105 transitions, 226 flow [2025-02-08 14:04:57,792 INFO L124 PetriNetUnfolderBase]: 30/170 cut-off events. [2025-02-08 14:04:57,792 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-08 14:04:57,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 170 events. 30/170 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 650 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 103. Up to 9 conditions per place. [2025-02-08 14:04:57,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 105 transitions, 226 flow [2025-02-08 14:04:57,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 105 transitions, 226 flow [2025-02-08 14:04:57,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:04:57,799 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;@3ded07dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:04:57,799 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-02-08 14:04:57,803 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:04:57,803 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-02-08 14:04:57,805 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:04:57,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:57,806 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:04:57,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:57,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:57,806 INFO L85 PathProgramCache]: Analyzing trace with hash 426747296, now seen corresponding path program 1 times [2025-02-08 14:04:57,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:57,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285751699] [2025-02-08 14:04:57,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:57,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:57,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:04:57,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:04:57,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:57,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:04:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:57,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285751699] [2025-02-08 14:04:57,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285751699] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:57,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:57,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:04:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663298776] [2025-02-08 14:04:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:57,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:04:57,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:57,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:04:57,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:04:57,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-08 14:04:57,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:04:57,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:57,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-08 14:04:57,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:04:59,123 INFO L124 PetriNetUnfolderBase]: 4611/9991 cut-off events. [2025-02-08 14:04:59,124 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-02-08 14:04:59,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17064 conditions, 9991 events. 4611/9991 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 87356 event pairs, 1952 based on Foata normal form. 2596/11387 useless extension candidates. Maximal degree in co-relation 1365. Up to 6969 conditions per place. [2025-02-08 14:04:59,205 INFO L140 encePairwiseOnDemand]: 85/105 looper letters, 65 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2025-02-08 14:04:59,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 116 transitions, 384 flow [2025-02-08 14:04:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:04:59,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:04:59,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 289 transitions. [2025-02-08 14:04:59,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6880952380952381 [2025-02-08 14:04:59,210 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 226 flow. Second operand 4 states and 289 transitions. [2025-02-08 14:04:59,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 116 transitions, 384 flow [2025-02-08 14:04:59,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:04:59,214 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 222 flow [2025-02-08 14:04:59,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=91, 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=96, PETRI_TRANSITIONS=93} [2025-02-08 14:04:59,215 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-02-08 14:04:59,216 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 222 flow [2025-02-08 14:04:59,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:04:59,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:04:59,216 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:04:59,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 14:04:59,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:04:59,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:04:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash 688139494, now seen corresponding path program 1 times [2025-02-08 14:04:59,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:04:59,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034247725] [2025-02-08 14:04:59,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:04:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:04:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:04:59,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:04:59,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:04:59,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:04:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:04:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:04:59,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034247725] [2025-02-08 14:04:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034247725] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:04:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:04:59,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:04:59,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060113715] [2025-02-08 14:04:59,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:04:59,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:04:59,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:04:59,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:04:59,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:04:59,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-08 14:04:59,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-02-08 14:04:59,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:04:59,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-08 14:04:59,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:00,347 INFO L124 PetriNetUnfolderBase]: 3957/8428 cut-off events. [2025-02-08 14:05:00,348 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-02-08 14:05:00,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15019 conditions, 8428 events. 3957/8428 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 70516 event pairs, 622 based on Foata normal form. 144/7573 useless extension candidates. Maximal degree in co-relation 13598. Up to 3893 conditions per place. [2025-02-08 14:05:00,412 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 105 selfloop transitions, 6 changer transitions 0/159 dead transitions. [2025-02-08 14:05:00,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 159 transitions, 574 flow [2025-02-08 14:05:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 400 transitions. [2025-02-08 14:05:00,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2025-02-08 14:05:00,415 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 222 flow. Second operand 6 states and 400 transitions. [2025-02-08 14:05:00,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 159 transitions, 574 flow [2025-02-08 14:05:00,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 159 transitions, 572 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:00,422 INFO L231 Difference]: Finished difference. Result has 99 places, 92 transitions, 228 flow [2025-02-08 14:05:00,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=94, 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=99, PETRI_TRANSITIONS=92} [2025-02-08 14:05:00,424 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-02-08 14:05:00,424 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 92 transitions, 228 flow [2025-02-08 14:05:00,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 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-02-08 14:05:00,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:00,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:00,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:05:00,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:00,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:00,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1303557375, now seen corresponding path program 1 times [2025-02-08 14:05:00,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:00,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997182089] [2025-02-08 14:05:00,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:00,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:00,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:00,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:00,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:00,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:00,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997182089] [2025-02-08 14:05:00,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997182089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:00,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:00,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:00,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052394290] [2025-02-08 14:05:00,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:00,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:00,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:00,529 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 105 [2025-02-08 14:05:00,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 92 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-02-08 14:05:00,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:00,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 105 [2025-02-08 14:05:00,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:01,791 INFO L124 PetriNetUnfolderBase]: 6320/13169 cut-off events. [2025-02-08 14:05:01,792 INFO L125 PetriNetUnfolderBase]: For 1175/1336 co-relation queries the response was YES. [2025-02-08 14:05:01,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23638 conditions, 13169 events. 6320/13169 cut-off events. For 1175/1336 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 116378 event pairs, 1495 based on Foata normal form. 222/11955 useless extension candidates. Maximal degree in co-relation 19049. Up to 6459 conditions per place. [2025-02-08 14:05:01,870 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 122 selfloop transitions, 12 changer transitions 0/183 dead transitions. [2025-02-08 14:05:01,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 183 transitions, 732 flow [2025-02-08 14:05:01,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:05:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:05:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2025-02-08 14:05:01,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-02-08 14:05:01,873 INFO L175 Difference]: Start difference. First operand has 99 places, 92 transitions, 228 flow. Second operand 5 states and 380 transitions. [2025-02-08 14:05:01,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 183 transitions, 732 flow [2025-02-08 14:05:01,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 183 transitions, 709 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 14:05:01,881 INFO L231 Difference]: Finished difference. Result has 103 places, 103 transitions, 310 flow [2025-02-08 14:05:01,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2025-02-08 14:05:01,883 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 12 predicate places. [2025-02-08 14:05:01,884 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 310 flow [2025-02-08 14:05:01,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.75) internal successors, (203), 4 states have internal predecessors, (203), 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-02-08 14:05:01,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:01,884 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:01,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:05:01,884 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:01,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:01,885 INFO L85 PathProgramCache]: Analyzing trace with hash -142511810, now seen corresponding path program 1 times [2025-02-08 14:05:01,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:01,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264643811] [2025-02-08 14:05:01,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:01,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:01,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:01,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:01,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:01,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:01,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:01,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264643811] [2025-02-08 14:05:01,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264643811] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:01,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:01,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:01,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858555157] [2025-02-08 14:05:01,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:01,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:01,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:01,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:01,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:01,953 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 105 [2025-02-08 14:05:01,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 310 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-02-08 14:05:01,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:01,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 105 [2025-02-08 14:05:01,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:02,899 INFO L124 PetriNetUnfolderBase]: 5316/11544 cut-off events. [2025-02-08 14:05:02,899 INFO L125 PetriNetUnfolderBase]: For 3671/3676 co-relation queries the response was YES. [2025-02-08 14:05:02,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22816 conditions, 11544 events. 5316/11544 cut-off events. For 3671/3676 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 102901 event pairs, 607 based on Foata normal form. 160/10505 useless extension candidates. Maximal degree in co-relation 19549. Up to 7025 conditions per place. [2025-02-08 14:05:02,953 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 103 selfloop transitions, 6 changer transitions 0/157 dead transitions. [2025-02-08 14:05:02,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 157 transitions, 698 flow [2025-02-08 14:05:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2025-02-08 14:05:02,955 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-02-08 14:05:02,955 INFO L175 Difference]: Start difference. First operand has 103 places, 103 transitions, 310 flow. Second operand 4 states and 279 transitions. [2025-02-08 14:05:02,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 157 transitions, 698 flow [2025-02-08 14:05:02,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 157 transitions, 694 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:02,967 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 322 flow [2025-02-08 14:05:02,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=105, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=322, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2025-02-08 14:05:02,970 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 14 predicate places. [2025-02-08 14:05:02,970 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 322 flow [2025-02-08 14:05:02,971 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-02-08 14:05:02,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:02,971 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-02-08 14:05:02,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:05:02,971 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-02-08 14:05:02,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:02,971 INFO L85 PathProgramCache]: Analyzing trace with hash 485118547, now seen corresponding path program 1 times [2025-02-08 14:05:02,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:02,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392319114] [2025-02-08 14:05:02,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:02,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:02,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:02,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:02,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:02,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 14:05:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:05:03,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:05:03,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:03,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 14:05:03,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 14:05:03,012 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 14:05:03,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-02-08 14:05:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-02-08 14:05:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-02-08 14:05:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-02-08 14:05:03,012 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-02-08 14:05:03,013 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-02-08 14:05:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-02-08 14:05:03,014 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-02-08 14:05:03,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:05:03,014 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-08 14:05:03,015 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 14:05:03,015 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 14:05:03,043 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 14:05:03,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 140 transitions, 307 flow [2025-02-08 14:05:03,068 INFO L124 PetriNetUnfolderBase]: 46/266 cut-off events. [2025-02-08 14:05:03,068 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-02-08 14:05:03,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 266 events. 46/266 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1135 event pairs, 1 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 185. Up to 12 conditions per place. [2025-02-08 14:05:03,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 140 transitions, 307 flow [2025-02-08 14:05:03,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 121 places, 140 transitions, 307 flow [2025-02-08 14:05:03,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:05:03,074 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;@3ded07dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:05:03,075 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-02-08 14:05:03,076 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:05:03,076 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-02-08 14:05:03,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:05:03,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:03,078 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 14:05:03,078 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:03,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 560381709, now seen corresponding path program 1 times [2025-02-08 14:05:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-02-08 14:05:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:03,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 14:05:03,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 14:05:03,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:03,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305266305] [2025-02-08 14:05:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305266305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383852547] [2025-02-08 14:05:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:03,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:03,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:03,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:03,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:03,127 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-02-08 14:05:03,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 140 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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-02-08 14:05:03,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:03,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-02-08 14:05:03,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:12,375 INFO L124 PetriNetUnfolderBase]: 87167/155337 cut-off events. [2025-02-08 14:05:12,375 INFO L125 PetriNetUnfolderBase]: For 1625/1625 co-relation queries the response was YES. [2025-02-08 14:05:12,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275119 conditions, 155337 events. 87167/155337 cut-off events. For 1625/1625 co-relation queries the response was YES. Maximal size of possible extension queue 3612. Compared 1634775 event pairs, 78515 based on Foata normal form. 46989/186601 useless extension candidates. Maximal degree in co-relation 140403. Up to 118620 conditions per place. [2025-02-08 14:05:13,155 INFO L140 encePairwiseOnDemand]: 114/140 looper letters, 78 selfloop transitions, 3 changer transitions 0/145 dead transitions. [2025-02-08 14:05:13,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 145 transitions, 479 flow [2025-02-08 14:05:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:13,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:13,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2025-02-08 14:05:13,157 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2025-02-08 14:05:13,157 INFO L175 Difference]: Start difference. First operand has 121 places, 140 transitions, 307 flow. Second operand 4 states and 372 transitions. [2025-02-08 14:05:13,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 145 transitions, 479 flow [2025-02-08 14:05:13,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 145 transitions, 479 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:05:13,163 INFO L231 Difference]: Finished difference. Result has 126 places, 122 transitions, 291 flow [2025-02-08 14:05:13,163 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=291, PETRI_PLACES=126, PETRI_TRANSITIONS=122} [2025-02-08 14:05:13,164 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 5 predicate places. [2025-02-08 14:05:13,164 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 122 transitions, 291 flow [2025-02-08 14:05:13,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 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-02-08 14:05:13,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:13,164 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:13,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:05:13,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:13,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:13,165 INFO L85 PathProgramCache]: Analyzing trace with hash -292812538, now seen corresponding path program 1 times [2025-02-08 14:05:13,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:13,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-02-08 14:05:13,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:13,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:13,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:05:13,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:05:13,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:13,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:13,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:13,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:13,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700157820] [2025-02-08 14:05:13,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700157820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:13,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:13,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:05:13,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153169656] [2025-02-08 14:05:13,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:13,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:05:13,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:13,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:05:13,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:05:13,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-02-08 14:05:13,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 122 transitions, 291 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-02-08 14:05:13,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:13,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-02-08 14:05:13,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:20,641 INFO L124 PetriNetUnfolderBase]: 71934/125091 cut-off events. [2025-02-08 14:05:20,641 INFO L125 PetriNetUnfolderBase]: For 7109/7109 co-relation queries the response was YES. [2025-02-08 14:05:20,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229709 conditions, 125091 events. 71934/125091 cut-off events. For 7109/7109 co-relation queries the response was YES. Maximal size of possible extension queue 2867. Compared 1268237 event pairs, 12886 based on Foata normal form. 1872/114412 useless extension candidates. Maximal degree in co-relation 210406. Up to 63134 conditions per place. [2025-02-08 14:05:21,347 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 140 selfloop transitions, 6 changer transitions 0/210 dead transitions. [2025-02-08 14:05:21,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 210 transitions, 757 flow [2025-02-08 14:05:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:05:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:05:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 531 transitions. [2025-02-08 14:05:21,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6321428571428571 [2025-02-08 14:05:21,349 INFO L175 Difference]: Start difference. First operand has 126 places, 122 transitions, 291 flow. Second operand 6 states and 531 transitions. [2025-02-08 14:05:21,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 210 transitions, 757 flow [2025-02-08 14:05:21,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 210 transitions, 755 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:05:21,358 INFO L231 Difference]: Finished difference. Result has 129 places, 121 transitions, 297 flow [2025-02-08 14:05:21,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=297, PETRI_PLACES=129, PETRI_TRANSITIONS=121} [2025-02-08 14:05:21,359 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 8 predicate places. [2025-02-08 14:05:21,359 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 121 transitions, 297 flow [2025-02-08 14:05:21,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-02-08 14:05:21,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:21,359 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 14:05:21,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 14:05:21,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:21,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:21,360 INFO L85 PathProgramCache]: Analyzing trace with hash -487253590, now seen corresponding path program 1 times [2025-02-08 14:05:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784192011] [2025-02-08 14:05:21,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:21,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:21,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:21,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:21,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:21,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784192011] [2025-02-08 14:05:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784192011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:05:21,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093577098] [2025-02-08 14:05:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:21,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:21,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:21,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:21,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:21,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 140 [2025-02-08 14:05:21,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 121 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-02-08 14:05:21,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:21,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 140 [2025-02-08 14:05:21,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:05:28,437 INFO L124 PetriNetUnfolderBase]: 66918/116729 cut-off events. [2025-02-08 14:05:28,437 INFO L125 PetriNetUnfolderBase]: For 14612/14612 co-relation queries the response was YES. [2025-02-08 14:05:28,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218228 conditions, 116729 events. 66918/116729 cut-off events. For 14612/14612 co-relation queries the response was YES. Maximal size of possible extension queue 2655. Compared 1170061 event pairs, 6324 based on Foata normal form. 1872/108554 useless extension candidates. Maximal degree in co-relation 112006. Up to 70045 conditions per place. [2025-02-08 14:05:29,027 INFO L140 encePairwiseOnDemand]: 135/140 looper letters, 117 selfloop transitions, 6 changer transitions 0/187 dead transitions. [2025-02-08 14:05:29,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 187 transitions, 673 flow [2025-02-08 14:05:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:05:29,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:05:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2025-02-08 14:05:29,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-08 14:05:29,028 INFO L175 Difference]: Start difference. First operand has 129 places, 121 transitions, 297 flow. Second operand 4 states and 378 transitions. [2025-02-08 14:05:29,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 187 transitions, 673 flow [2025-02-08 14:05:29,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 187 transitions, 657 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-02-08 14:05:29,070 INFO L231 Difference]: Finished difference. Result has 127 places, 121 transitions, 297 flow [2025-02-08 14:05:29,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=127, PETRI_TRANSITIONS=121} [2025-02-08 14:05:29,071 INFO L279 CegarLoopForPetriNet]: 121 programPoint places, 6 predicate places. [2025-02-08 14:05:29,071 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 121 transitions, 297 flow [2025-02-08 14:05:29,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 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-02-08 14:05:29,071 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:05:29,071 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:05:29,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 14:05:29,071 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-02-08 14:05:29,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:05:29,072 INFO L85 PathProgramCache]: Analyzing trace with hash 417406508, now seen corresponding path program 1 times [2025-02-08 14:05:29,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:05:29,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-02-08 14:05:29,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:05:29,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:05:29,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:05:29,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:05:29,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:05:29,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:05:29,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:05:29,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:05:29,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137533605] [2025-02-08 14:05:29,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137533605] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:05:29,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:05:29,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:05:29,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709442084] [2025-02-08 14:05:29,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:05:29,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:05:29,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:05:29,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:05:29,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:05:29,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 140 [2025-02-08 14:05:29,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 121 transitions, 297 flow. Second operand has 4 states, 4 states have (on average 66.75) internal successors, (267), 4 states have internal predecessors, (267), 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-02-08 14:05:29,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:05:29,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 140 [2025-02-08 14:05:29,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand