./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:00,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:00,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:00,452 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:00,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:00,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:00,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:00,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:00,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:00,476 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:00,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:00,477 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:00,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:00,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:00,478 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:00,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:00,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:00,479 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:00,480 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:00,480 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:00,480 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:00,481 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ce97f399f5ab540e05119d9433f4e1bfecfe892f8e87faddc6435387a55a4d6 [2025-03-04 15:22:00,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:00,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:00,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:00,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:00,703 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:00,704 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-03-04 15:22:01,847 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967286dd5/2bd55957cf1b4aa5a09b85e38f4eec52/FLAG72f542ebc [2025-03-04 15:22:02,131 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:02,132 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_22-deref_read_racefree.i [2025-03-04 15:22:02,142 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967286dd5/2bd55957cf1b4aa5a09b85e38f4eec52/FLAG72f542ebc [2025-03-04 15:22:02,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/967286dd5/2bd55957cf1b4aa5a09b85e38f4eec52 [2025-03-04 15:22:02,421 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:02,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:02,424 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:02,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:02,428 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:02,429 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,430 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27adf4f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02, skipping insertion in model container [2025-03-04 15:22:02,430 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:02,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:02,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:02,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:02,744 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:02,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02 WrapperNode [2025-03-04 15:22:02,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:02,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:02,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:02,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:02,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,759 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,769 INFO L138 Inliner]: procedures = 170, calls = 38, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 68 [2025-03-04 15:22:02,770 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:02,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:02,771 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:02,771 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:02,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,776 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,778 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,787 INFO L175 MemorySlicer]: Split 18 memory accesses to 4 slices as follows [2, 5, 6, 5]. 33 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 1, 5]. The 2 writes are split as follows [0, 0, 2, 0]. [2025-03-04 15:22:02,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,788 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,792 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,793 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:02,797 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:02,797 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:02,797 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:02,798 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (1/1) ... [2025-03-04 15:22:02,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:02,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:02,824 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:02,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:02,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:02,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:02,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:02,845 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:02,954 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:02,957 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:22:03,153 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:22:03,153 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:22:03,261 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:22:03,262 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:22:03,262 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:03 BoogieIcfgContainer [2025-03-04 15:22:03,262 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:22:03,265 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:22:03,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:22:03,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:22:03,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:02" (1/3) ... [2025-03-04 15:22:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11897275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:03, skipping insertion in model container [2025-03-04 15:22:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:02" (2/3) ... [2025-03-04 15:22:03,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11897275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:22:03, skipping insertion in model container [2025-03-04 15:22:03,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:22:03" (3/3) ... [2025-03-04 15:22:03,271 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_22-deref_read_racefree.i [2025-03-04 15:22:03,282 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:22:03,283 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_22-deref_read_racefree.i that has 2 procedures, 43 locations, 1 initial locations, 4 loop locations, and 6 error locations. [2025-03-04 15:22:03,283 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:22:03,321 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:03,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 51 transitions, 106 flow [2025-03-04 15:22:03,374 INFO L124 PetriNetUnfolderBase]: 10/64 cut-off events. [2025-03-04 15:22:03,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 64 events. 10/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 191 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2025-03-04 15:22:03,383 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 51 transitions, 106 flow [2025-03-04 15:22:03,385 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 51 transitions, 106 flow [2025-03-04 15:22:03,390 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:03,398 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;@1f72ee42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:03,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 15:22:03,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:03,404 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:03,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:03,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:03,404 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:03,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:22:03,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:03,412 INFO L85 PathProgramCache]: Analyzing trace with hash 269581651, now seen corresponding path program 1 times [2025-03-04 15:22:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:03,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318935912] [2025-03-04 15:22:03,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:03,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:03,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:03,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:03,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:03,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:03,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:03,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318935912] [2025-03-04 15:22:03,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318935912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:03,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:03,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:03,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227260443] [2025-03-04 15:22:03,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:03,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:03,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:03,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:03,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:03,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 51 [2025-03-04 15:22:03,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 51 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-04 15:22:03,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:03,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 51 [2025-03-04 15:22:03,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:03,840 INFO L124 PetriNetUnfolderBase]: 110/317 cut-off events. [2025-03-04 15:22:03,840 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:03,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 317 events. 110/317 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1517 event pairs, 0 based on Foata normal form. 57/360 useless extension candidates. Maximal degree in co-relation 543. Up to 208 conditions per place. [2025-03-04 15:22:03,846 INFO L140 encePairwiseOnDemand]: 37/51 looper letters, 43 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2025-03-04 15:22:03,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 64 transitions, 224 flow [2025-03-04 15:22:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2025-03-04 15:22:03,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6911764705882353 [2025-03-04 15:22:03,858 INFO L175 Difference]: Start difference. First operand has 46 places, 51 transitions, 106 flow. Second operand 4 states and 141 transitions. [2025-03-04 15:22:03,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 64 transitions, 224 flow [2025-03-04 15:22:03,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:03,864 INFO L231 Difference]: Finished difference. Result has 48 places, 41 transitions, 96 flow [2025-03-04 15:22:03,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=48, PETRI_TRANSITIONS=41} [2025-03-04 15:22:03,868 INFO L279 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2025-03-04 15:22:03,868 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 41 transitions, 96 flow [2025-03-04 15:22:03,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-03-04 15:22:03,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:03,868 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:03,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:22:03,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-04 15:22:03,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:03,869 INFO L85 PathProgramCache]: Analyzing trace with hash -481665337, now seen corresponding path program 1 times [2025-03-04 15:22:03,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:03,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921257299] [2025-03-04 15:22:03,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:03,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:03,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:03,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:03,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:03,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:03,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:22:03,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:22:03,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:03,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:03,920 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:03,921 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 15:22:03,922 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-04 15:22:03,923 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-04 15:22:03,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-04 15:22:03,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-04 15:22:03,924 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-04 15:22:03,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:22:03,925 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:22:03,927 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:03,927 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:22:03,947 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:03,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 82 transitions, 174 flow [2025-03-04 15:22:03,967 INFO L124 PetriNetUnfolderBase]: 18/113 cut-off events. [2025-03-04 15:22:03,968 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:22:03,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 113 events. 18/113 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 412 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 78. Up to 6 conditions per place. [2025-03-04 15:22:03,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 82 transitions, 174 flow [2025-03-04 15:22:03,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 82 transitions, 174 flow [2025-03-04 15:22:03,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:03,973 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;@1f72ee42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:03,974 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 15:22:03,976 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:03,976 INFO L124 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-03-04 15:22:03,976 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:03,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:03,976 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:03,976 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:03,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:03,976 INFO L85 PathProgramCache]: Analyzing trace with hash 347863491, now seen corresponding path program 1 times [2025-03-04 15:22:03,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:03,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220984477] [2025-03-04 15:22:03,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:03,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:03,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:03,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:03,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:04,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:04,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220984477] [2025-03-04 15:22:04,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220984477] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:04,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:04,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:04,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052108981] [2025-03-04 15:22:04,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:04,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:04,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:04,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:04,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:04,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 82 [2025-03-04 15:22:04,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 82 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-03-04 15:22:04,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:04,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 82 [2025-03-04 15:22:04,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:04,803 INFO L124 PetriNetUnfolderBase]: 3410/7337 cut-off events. [2025-03-04 15:22:04,804 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-03-04 15:22:04,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12795 conditions, 7337 events. 3410/7337 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 60694 event pairs, 1584 based on Foata normal form. 1113/7812 useless extension candidates. Maximal degree in co-relation 1041. Up to 5380 conditions per place. [2025-03-04 15:22:04,848 INFO L140 encePairwiseOnDemand]: 62/82 looper letters, 59 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2025-03-04 15:22:04,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 93 transitions, 320 flow [2025-03-04 15:22:04,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-03-04 15:22:04,851 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6554878048780488 [2025-03-04 15:22:04,852 INFO L175 Difference]: Start difference. First operand has 73 places, 82 transitions, 174 flow. Second operand 4 states and 215 transitions. [2025-03-04 15:22:04,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 93 transitions, 320 flow [2025-03-04 15:22:04,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 93 transitions, 320 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:04,854 INFO L231 Difference]: Finished difference. Result has 78 places, 70 transitions, 170 flow [2025-03-04 15:22:04,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=78, PETRI_TRANSITIONS=70} [2025-03-04 15:22:04,855 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2025-03-04 15:22:04,855 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 70 transitions, 170 flow [2025-03-04 15:22:04,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-03-04 15:22:04,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:04,856 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:04,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:22:04,856 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:04,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:04,856 INFO L85 PathProgramCache]: Analyzing trace with hash 64249467, now seen corresponding path program 1 times [2025-03-04 15:22:04,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:04,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059037369] [2025-03-04 15:22:04,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:04,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:04,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:04,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:04,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:04,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:04,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:04,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:04,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059037369] [2025-03-04 15:22:04,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059037369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:04,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:04,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:04,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286855999] [2025-03-04 15:22:04,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:04,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:04,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:04,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:04,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:04,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 82 [2025-03-04 15:22:04,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 70 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-03-04 15:22:04,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:04,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 82 [2025-03-04 15:22:04,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:05,554 INFO L124 PetriNetUnfolderBase]: 3033/6498 cut-off events. [2025-03-04 15:22:05,555 INFO L125 PetriNetUnfolderBase]: For 394/726 co-relation queries the response was YES. [2025-03-04 15:22:05,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11762 conditions, 6498 events. 3033/6498 cut-off events. For 394/726 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 52181 event pairs, 949 based on Foata normal form. 140/6286 useless extension candidates. Maximal degree in co-relation 11662. Up to 4227 conditions per place. [2025-03-04 15:22:05,593 INFO L140 encePairwiseOnDemand]: 76/82 looper letters, 82 selfloop transitions, 6 changer transitions 0/121 dead transitions. [2025-03-04 15:22:05,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 121 transitions, 476 flow [2025-03-04 15:22:05,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:05,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:05,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-03-04 15:22:05,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6073170731707317 [2025-03-04 15:22:05,596 INFO L175 Difference]: Start difference. First operand has 78 places, 70 transitions, 170 flow. Second operand 5 states and 249 transitions. [2025-03-04 15:22:05,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 121 transitions, 476 flow [2025-03-04 15:22:05,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 121 transitions, 472 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:05,600 INFO L231 Difference]: Finished difference. Result has 84 places, 75 transitions, 212 flow [2025-03-04 15:22:05,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=84, PETRI_TRANSITIONS=75} [2025-03-04 15:22:05,601 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 11 predicate places. [2025-03-04 15:22:05,602 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 75 transitions, 212 flow [2025-03-04 15:22:05,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-03-04 15:22:05,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:05,602 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:05,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:22:05,602 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:05,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash -327534501, now seen corresponding path program 1 times [2025-03-04 15:22:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616348512] [2025-03-04 15:22:05,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:05,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:05,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:05,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:05,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:05,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616348512] [2025-03-04 15:22:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616348512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:05,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:05,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576927137] [2025-03-04 15:22:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:05,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:05,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:05,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:05,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:05,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 82 [2025-03-04 15:22:05,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 75 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-03-04 15:22:05,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:05,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 82 [2025-03-04 15:22:05,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:06,320 INFO L124 PetriNetUnfolderBase]: 3318/6609 cut-off events. [2025-03-04 15:22:06,321 INFO L125 PetriNetUnfolderBase]: For 1338/1338 co-relation queries the response was YES. [2025-03-04 15:22:06,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13463 conditions, 6609 events. 3318/6609 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 52178 event pairs, 303 based on Foata normal form. 152/6450 useless extension candidates. Maximal degree in co-relation 12491. Up to 3179 conditions per place. [2025-03-04 15:22:06,361 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 114 selfloop transitions, 6 changer transitions 0/151 dead transitions. [2025-03-04 15:22:06,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 151 transitions, 662 flow [2025-03-04 15:22:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2025-03-04 15:22:06,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5934959349593496 [2025-03-04 15:22:06,363 INFO L175 Difference]: Start difference. First operand has 84 places, 75 transitions, 212 flow. Second operand 6 states and 292 transitions. [2025-03-04 15:22:06,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 151 transitions, 662 flow [2025-03-04 15:22:06,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 151 transitions, 662 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:06,373 INFO L231 Difference]: Finished difference. Result has 88 places, 74 transitions, 220 flow [2025-03-04 15:22:06,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=88, PETRI_TRANSITIONS=74} [2025-03-04 15:22:06,375 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 15 predicate places. [2025-03-04 15:22:06,376 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 74 transitions, 220 flow [2025-03-04 15:22:06,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 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-03-04 15:22:06,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:06,376 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:06,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:22:06,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:06,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:06,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1563634644, now seen corresponding path program 1 times [2025-03-04 15:22:06,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:06,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713148217] [2025-03-04 15:22:06,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:06,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:06,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:06,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:06,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:06,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:06,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:06,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713148217] [2025-03-04 15:22:06,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713148217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:06,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:06,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:06,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060020279] [2025-03-04 15:22:06,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:06,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:06,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:06,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:06,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:06,422 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 82 [2025-03-04 15:22:06,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 74 transitions, 220 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-03-04 15:22:06,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:06,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 82 [2025-03-04 15:22:06,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:06,888 INFO L124 PetriNetUnfolderBase]: 3039/6348 cut-off events. [2025-03-04 15:22:06,888 INFO L125 PetriNetUnfolderBase]: For 2092/2092 co-relation queries the response was YES. [2025-03-04 15:22:06,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13025 conditions, 6348 events. 3039/6348 cut-off events. For 2092/2092 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 49710 event pairs, 842 based on Foata normal form. 152/6287 useless extension candidates. Maximal degree in co-relation 12121. Up to 3633 conditions per place. [2025-03-04 15:22:06,918 INFO L140 encePairwiseOnDemand]: 77/82 looper letters, 91 selfloop transitions, 6 changer transitions 0/128 dead transitions. [2025-03-04 15:22:06,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 128 transitions, 566 flow [2025-03-04 15:22:06,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:06,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2025-03-04 15:22:06,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 15:22:06,919 INFO L175 Difference]: Start difference. First operand has 88 places, 74 transitions, 220 flow. Second operand 4 states and 205 transitions. [2025-03-04 15:22:06,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 128 transitions, 566 flow [2025-03-04 15:22:06,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 128 transitions, 550 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:06,927 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 220 flow [2025-03-04 15:22:06,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=82, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2025-03-04 15:22:06,928 INFO L279 CegarLoopForPetriNet]: 73 programPoint places, 13 predicate places. [2025-03-04 15:22:06,929 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 220 flow [2025-03-04 15:22:06,929 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-03-04 15:22:06,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:06,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 15:22:06,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:22:06,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 12 more)] === [2025-03-04 15:22:06,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:06,930 INFO L85 PathProgramCache]: Analyzing trace with hash 585671919, now seen corresponding path program 1 times [2025-03-04 15:22:06,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:06,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069413460] [2025-03-04 15:22:06,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:06,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:06,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:06,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:06,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:06,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:06,941 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:22:06,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:22:06,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:22:06,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:06,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:22:06,951 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:22:06,951 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:22:06,951 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-04 15:22:06,952 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-04 15:22:06,953 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-04 15:22:06,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:22:06,953 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-04 15:22:06,954 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:22:06,954 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:22:06,972 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:22:06,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 113 transitions, 244 flow [2025-03-04 15:22:06,983 INFO L124 PetriNetUnfolderBase]: 26/162 cut-off events. [2025-03-04 15:22:06,984 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:22:06,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 162 events. 26/162 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 625 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 124. Up to 8 conditions per place. [2025-03-04 15:22:06,984 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 113 transitions, 244 flow [2025-03-04 15:22:06,986 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 113 transitions, 244 flow [2025-03-04 15:22:06,986 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:22:06,987 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;@1f72ee42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:22:06,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:22:06,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:22:06,988 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:22:06,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:22:06,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:06,988 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:22:06,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:06,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:06,989 INFO L85 PathProgramCache]: Analyzing trace with hash 455728786, now seen corresponding path program 1 times [2025-03-04 15:22:06,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:06,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904047818] [2025-03-04 15:22:06,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:06,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:06,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:22:06,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:22:06,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:06,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:07,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:07,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904047818] [2025-03-04 15:22:07,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904047818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:07,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:07,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:07,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178597863] [2025-03-04 15:22:07,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:07,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:07,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:07,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:07,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 113 [2025-03-04 15:22:07,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 113 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 15:22:07,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:07,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 113 [2025-03-04 15:22:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:13,512 INFO L124 PetriNetUnfolderBase]: 63602/113942 cut-off events. [2025-03-04 15:22:13,512 INFO L125 PetriNetUnfolderBase]: For 1012/1012 co-relation queries the response was YES. [2025-03-04 15:22:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202633 conditions, 113942 events. 63602/113942 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 2690. Compared 1156109 event pairs, 53400 based on Foata normal form. 18903/123753 useless extension candidates. Maximal degree in co-relation 76338. Up to 88036 conditions per place. [2025-03-04 15:22:14,092 INFO L140 encePairwiseOnDemand]: 87/113 looper letters, 71 selfloop transitions, 3 changer transitions 0/118 dead transitions. [2025-03-04 15:22:14,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 118 transitions, 402 flow [2025-03-04 15:22:14,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:14,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2025-03-04 15:22:14,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6305309734513275 [2025-03-04 15:22:14,095 INFO L175 Difference]: Start difference. First operand has 100 places, 113 transitions, 244 flow. Second operand 4 states and 285 transitions. [2025-03-04 15:22:14,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 118 transitions, 402 flow [2025-03-04 15:22:14,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 118 transitions, 400 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:14,098 INFO L231 Difference]: Finished difference. Result has 105 places, 95 transitions, 226 flow [2025-03-04 15:22:14,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=105, PETRI_TRANSITIONS=95} [2025-03-04 15:22:14,098 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 5 predicate places. [2025-03-04 15:22:14,098 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 95 transitions, 226 flow [2025-03-04 15:22:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 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-03-04 15:22:14,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:14,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:22:14,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 236375690, now seen corresponding path program 1 times [2025-03-04 15:22:14,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709867040] [2025-03-04 15:22:14,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:14,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:22:14,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:22:14,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:14,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:14,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:14,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:14,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709867040] [2025-03-04 15:22:14,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709867040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:14,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:14,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:14,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838154366] [2025-03-04 15:22:14,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:14,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:14,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:14,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:14,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:14,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 113 [2025-03-04 15:22:14,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 95 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-03-04 15:22:14,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:14,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 113 [2025-03-04 15:22:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:19,926 INFO L124 PetriNetUnfolderBase]: 59409/103476 cut-off events. [2025-03-04 15:22:19,926 INFO L125 PetriNetUnfolderBase]: For 5131/9646 co-relation queries the response was YES. [2025-03-04 15:22:20,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190992 conditions, 103476 events. 59409/103476 cut-off events. For 5131/9646 co-relation queries the response was YES. Maximal size of possible extension queue 2596. Compared 1010295 event pairs, 23553 based on Foata normal form. 1580/99978 useless extension candidates. Maximal degree in co-relation 190891. Up to 76131 conditions per place. [2025-03-04 15:22:20,574 INFO L140 encePairwiseOnDemand]: 106/113 looper letters, 118 selfloop transitions, 8 changer transitions 0/172 dead transitions. [2025-03-04 15:22:20,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 172 transitions, 675 flow [2025-03-04 15:22:20,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:22:20,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:22:20,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 352 transitions. [2025-03-04 15:22:20,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6230088495575221 [2025-03-04 15:22:20,575 INFO L175 Difference]: Start difference. First operand has 105 places, 95 transitions, 226 flow. Second operand 5 states and 352 transitions. [2025-03-04 15:22:20,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 172 transitions, 675 flow [2025-03-04 15:22:20,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 172 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:22:20,583 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 285 flow [2025-03-04 15:22:20,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2025-03-04 15:22:20,584 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 11 predicate places. [2025-03-04 15:22:20,584 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 285 flow [2025-03-04 15:22:20,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 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-03-04 15:22:20,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:20,585 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:20,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:22:20,585 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:20,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:20,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1522786747, now seen corresponding path program 1 times [2025-03-04 15:22:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:20,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057014590] [2025-03-04 15:22:20,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:20,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:20,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:22:20,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:22:20,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:20,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:20,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:20,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057014590] [2025-03-04 15:22:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057014590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:20,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:22:20,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549911330] [2025-03-04 15:22:20,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:22:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:20,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:22:20,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:22:20,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 113 [2025-03-04 15:22:20,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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-03-04 15:22:20,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:20,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 113 [2025-03-04 15:22:20,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:27,740 INFO L124 PetriNetUnfolderBase]: 65866/106701 cut-off events. [2025-03-04 15:22:27,740 INFO L125 PetriNetUnfolderBase]: For 24795/24795 co-relation queries the response was YES. [2025-03-04 15:22:28,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223550 conditions, 106701 events. 65866/106701 cut-off events. For 24795/24795 co-relation queries the response was YES. Maximal size of possible extension queue 2590. Compared 987544 event pairs, 10581 based on Foata normal form. 2136/104290 useless extension candidates. Maximal degree in co-relation 194523. Up to 54637 conditions per place. [2025-03-04 15:22:28,604 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 154 selfloop transitions, 6 changer transitions 0/204 dead transitions. [2025-03-04 15:22:28,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 204 transitions, 893 flow [2025-03-04 15:22:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:22:28,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:22:28,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2025-03-04 15:22:28,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5958702064896755 [2025-03-04 15:22:28,606 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 285 flow. Second operand 6 states and 404 transitions. [2025-03-04 15:22:28,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 204 transitions, 893 flow [2025-03-04 15:22:28,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 204 transitions, 893 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:22:28,619 INFO L231 Difference]: Finished difference. Result has 115 places, 101 transitions, 293 flow [2025-03-04 15:22:28,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=115, PETRI_TRANSITIONS=101} [2025-03-04 15:22:28,620 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 15 predicate places. [2025-03-04 15:22:28,620 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 101 transitions, 293 flow [2025-03-04 15:22:28,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 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-03-04 15:22:28,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:28,620 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:22:28,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:22:28,621 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:28,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -38250691, now seen corresponding path program 1 times [2025-03-04 15:22:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:28,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933620068] [2025-03-04 15:22:28,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:28,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:28,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:22:28,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:22:28,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:28,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:28,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933620068] [2025-03-04 15:22:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933620068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:22:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212492156] [2025-03-04 15:22:28,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:28,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:28,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:28,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:28,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:28,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 113 [2025-03-04 15:22:28,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 101 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 15:22:28,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:28,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 113 [2025-03-04 15:22:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:22:35,090 INFO L124 PetriNetUnfolderBase]: 60233/95702 cut-off events. [2025-03-04 15:22:35,090 INFO L125 PetriNetUnfolderBase]: For 34448/34448 co-relation queries the response was YES. [2025-03-04 15:22:35,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207688 conditions, 95702 events. 60233/95702 cut-off events. For 34448/34448 co-relation queries the response was YES. Maximal size of possible extension queue 2372. Compared 844010 event pairs, 12807 based on Foata normal form. 2136/96442 useless extension candidates. Maximal degree in co-relation 180893. Up to 62449 conditions per place. [2025-03-04 15:22:35,650 INFO L140 encePairwiseOnDemand]: 108/113 looper letters, 131 selfloop transitions, 6 changer transitions 0/181 dead transitions. [2025-03-04 15:22:35,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 181 transitions, 797 flow [2025-03-04 15:22:35,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:22:35,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:22:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 291 transitions. [2025-03-04 15:22:35,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6438053097345132 [2025-03-04 15:22:35,651 INFO L175 Difference]: Start difference. First operand has 115 places, 101 transitions, 293 flow. Second operand 4 states and 291 transitions. [2025-03-04 15:22:35,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 181 transitions, 797 flow [2025-03-04 15:22:35,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 181 transitions, 781 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:22:35,741 INFO L231 Difference]: Finished difference. Result has 113 places, 101 transitions, 293 flow [2025-03-04 15:22:35,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=113, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=293, PETRI_PLACES=113, PETRI_TRANSITIONS=101} [2025-03-04 15:22:35,741 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, 13 predicate places. [2025-03-04 15:22:35,741 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 101 transitions, 293 flow [2025-03-04 15:22:35,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 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-03-04 15:22:35,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:22:35,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:22:35,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:22:35,742 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-04 15:22:35,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:22:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1284727117, now seen corresponding path program 1 times [2025-03-04 15:22:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:22:35,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653010249] [2025-03-04 15:22:35,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:22:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:22:35,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 15:22:35,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 15:22:35,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:22:35,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:22:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:22:35,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:22:35,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653010249] [2025-03-04 15:22:35,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653010249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:22:35,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:22:35,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:22:35,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162535370] [2025-03-04 15:22:35,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:22:35,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:22:35,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:22:35,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:22:35,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:22:35,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 113 [2025-03-04 15:22:35,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 101 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 4 states have internal predecessors, (189), 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-03-04 15:22:35,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:22:35,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 113 [2025-03-04 15:22:35,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand