./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:34:20,322 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:34:20,359 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:34:20,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:34:20,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:34:20,379 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:34:20,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:34:20,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:34:20,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:34:20,380 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:34:20,380 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:34:20,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:34:20,381 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:34:20,381 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:34:20,381 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:34:20,382 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:20,382 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:20,382 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:34:20,382 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:34:20,383 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-01-10 06:34:20,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:34:20,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:34:20,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:34:20,642 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:34:20,642 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:34:20,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-01-10 06:34:21,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b96c632/c8ae0622eaf94fdd8574076cf53b3e89/FLAGc6397f41a [2025-01-10 06:34:22,092 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:34:22,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-01-10 06:34:22,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b96c632/c8ae0622eaf94fdd8574076cf53b3e89/FLAGc6397f41a [2025-01-10 06:34:22,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a3b96c632/c8ae0622eaf94fdd8574076cf53b3e89 [2025-01-10 06:34:22,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:34:22,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:34:22,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:22,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:34:22,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:34:22,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48dace18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22, skipping insertion in model container [2025-01-10 06:34:22,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,384 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:34:22,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:22,659 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:34:22,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:34:22,712 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:34:22,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22 WrapperNode [2025-01-10 06:34:22,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:34:22,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:22,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:34:22,714 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:34:22,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,725 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,738 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-01-10 06:34:22,739 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:34:22,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:34:22,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:34:22,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:34:22,745 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,755 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-01-10 06:34:22,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:34:22,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:34:22,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:34:22,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:34:22,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (1/1) ... [2025-01-10 06:34:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:34:22,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:34:22,790 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:34:22,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-10 06:34:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:34:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:34:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:34:22,818 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:34:22,896 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:34:22,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:34:22,993 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:34:22,994 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:34:23,072 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:34:23,072 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:34:23,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:23 BoogieIcfgContainer [2025-01-10 06:34:23,072 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:34:23,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:34:23,074 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:34:23,077 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:34:23,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:34:22" (1/3) ... [2025-01-10 06:34:23,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383bd0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:23, skipping insertion in model container [2025-01-10 06:34:23,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:34:22" (2/3) ... [2025-01-10 06:34:23,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@383bd0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:34:23, skipping insertion in model container [2025-01-10 06:34:23,078 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:34:23" (3/3) ... [2025-01-10 06:34:23,079 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-01-10 06:34:23,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:34:23,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-01-10 06:34:23,089 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:34:23,145 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:23,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 28 transitions, 60 flow [2025-01-10 06:34:23,195 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-01-10 06:34:23,197 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:23,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-01-10 06:34:23,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 28 transitions, 60 flow [2025-01-10 06:34:23,201 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 28 transitions, 60 flow [2025-01-10 06:34:23,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:23,214 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;@3ced5c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:23,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-10 06:34:23,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:23,219 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-10 06:34:23,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:23,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:23,220 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:23,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:34:23,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 249729266, now seen corresponding path program 1 times [2025-01-10 06:34:23,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:23,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636526696] [2025-01-10 06:34:23,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:23,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:23,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:23,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:23,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636526696] [2025-01-10 06:34:23,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636526696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:23,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:23,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:23,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372659404] [2025-01-10 06:34:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:23,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:23,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:23,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:23,535 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-01-10 06:34:23,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:23,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:23,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-01-10 06:34:23,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:23,612 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-01-10 06:34:23,614 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:23,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 80 events. 22/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 2 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 120. Up to 38 conditions per place. [2025-01-10 06:34:23,616 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 13 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-01-10 06:34:23,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 86 flow [2025-01-10 06:34:23,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:23,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-01-10 06:34:23,631 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-01-10 06:34:23,632 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 60 flow. Second operand 3 states and 53 transitions. [2025-01-10 06:34:23,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 86 flow [2025-01-10 06:34:23,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:23,640 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 56 flow [2025-01-10 06:34:23,642 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-01-10 06:34:23,646 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-01-10 06:34:23,646 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 56 flow [2025-01-10 06:34:23,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:23,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:23,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:34:23,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:34:23,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-01-10 06:34:23,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:23,649 INFO L85 PathProgramCache]: Analyzing trace with hash -848336354, now seen corresponding path program 1 times [2025-01-10 06:34:23,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:23,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946261679] [2025-01-10 06:34:23,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:23,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:23,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:23,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:23,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:23,670 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:23,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:23,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:23,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:23,705 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:23,705 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:23,706 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-10 06:34:23,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-01-10 06:34:23,708 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-01-10 06:34:23,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:34:23,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-01-10 06:34:23,712 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:23,712 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-10 06:34:23,744 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:23,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-01-10 06:34:23,761 INFO L124 PetriNetUnfolderBase]: 8/56 cut-off events. [2025-01-10 06:34:23,762 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:34:23,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 56 events. 8/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 168 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-01-10 06:34:23,763 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-01-10 06:34:23,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-01-10 06:34:23,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:23,766 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;@3ced5c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:23,766 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-01-10 06:34:23,768 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:23,771 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-10 06:34:23,771 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:23,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:23,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:23,771 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:23,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:23,774 INFO L85 PathProgramCache]: Analyzing trace with hash 298420667, now seen corresponding path program 1 times [2025-01-10 06:34:23,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:23,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150333911] [2025-01-10 06:34:23,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:23,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:23,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:23,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:23,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:23,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:23,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150333911] [2025-01-10 06:34:23,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150333911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:23,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:23,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:23,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013887822] [2025-01-10 06:34:23,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:23,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:23,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:23,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:23,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:23,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-01-10 06:34:23,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:23,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:23,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-01-10 06:34:23,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:24,095 INFO L124 PetriNetUnfolderBase]: 421/977 cut-off events. [2025-01-10 06:34:24,095 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 06:34:24,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 977 events. 421/977 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5994 event pairs, 54 based on Foata normal form. 108/1004 useless extension candidates. Maximal degree in co-relation 1348. Up to 517 conditions per place. [2025-01-10 06:34:24,110 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 31 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-01-10 06:34:24,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 193 flow [2025-01-10 06:34:24,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:24,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-01-10 06:34:24,113 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-01-10 06:34:24,113 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 3 states and 111 transitions. [2025-01-10 06:34:24,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 193 flow [2025-01-10 06:34:24,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:24,115 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 104 flow [2025-01-10 06:34:24,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-01-10 06:34:24,117 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-01-10 06:34:24,117 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 104 flow [2025-01-10 06:34:24,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:24,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:24,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:34:24,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:24,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash 661106433, now seen corresponding path program 1 times [2025-01-10 06:34:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-01-10 06:34:24,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:24,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:24,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:24,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:24,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:24,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849027466] [2025-01-10 06:34:24,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849027466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:24,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:24,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:24,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662980914] [2025-01-10 06:34:24,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:24,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:24,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:24,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:24,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:24,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-01-10 06:34:24,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:24,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-01-10 06:34:24,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:24,291 INFO L124 PetriNetUnfolderBase]: 372/856 cut-off events. [2025-01-10 06:34:24,294 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-01-10 06:34:24,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 856 events. 372/856 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4947 event pairs, 126 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 1292. Up to 447 conditions per place. [2025-01-10 06:34:24,299 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-01-10 06:34:24,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 193 flow [2025-01-10 06:34:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-01-10 06:34:24,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:34:24,301 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 104 flow. Second operand 3 states and 102 transitions. [2025-01-10 06:34:24,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 193 flow [2025-01-10 06:34:24,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:24,303 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 102 flow [2025-01-10 06:34:24,303 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-01-10 06:34:24,304 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-01-10 06:34:24,305 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 102 flow [2025-01-10 06:34:24,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:24,305 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:24,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:34:24,305 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:24,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:24,306 INFO L85 PathProgramCache]: Analyzing trace with hash -361760318, now seen corresponding path program 1 times [2025-01-10 06:34:24,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:24,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-01-10 06:34:24,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:24,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:24,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:24,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:24,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:24,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:24,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962821292] [2025-01-10 06:34:24,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962821292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:24,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:24,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:24,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825290465] [2025-01-10 06:34:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:24,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:24,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:24,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:24,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:24,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-01-10 06:34:24,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:24,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-01-10 06:34:24,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:24,518 INFO L124 PetriNetUnfolderBase]: 412/937 cut-off events. [2025-01-10 06:34:24,519 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-01-10 06:34:24,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 937 events. 412/937 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5624 event pairs, 72 based on Foata normal form. 24/889 useless extension candidates. Maximal degree in co-relation 1135. Up to 472 conditions per place. [2025-01-10 06:34:24,524 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-01-10 06:34:24,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 188 flow [2025-01-10 06:34:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:24,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-01-10 06:34:24,529 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:34:24,529 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 102 flow. Second operand 3 states and 102 transitions. [2025-01-10 06:34:24,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 188 flow [2025-01-10 06:34:24,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:24,531 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 100 flow [2025-01-10 06:34:24,531 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-01-10 06:34:24,532 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-01-10 06:34:24,532 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 100 flow [2025-01-10 06:34:24,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,532 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:24,532 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-01-10 06:34:24,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:34:24,532 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-01-10 06:34:24,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:24,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1670323095, now seen corresponding path program 1 times [2025-01-10 06:34:24,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:24,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924242572] [2025-01-10 06:34:24,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:24,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:24,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:24,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:24,541 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:24,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:24,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:24,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:24,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:24,549 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-01-10 06:34:24,549 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-01-10 06:34:24,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-01-10 06:34:24,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-01-10 06:34:24,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-01-10 06:34:24,550 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-01-10 06:34:24,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:34:24,550 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-10 06:34:24,550 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:24,550 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-10 06:34:24,572 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:24,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 166 flow [2025-01-10 06:34:24,580 INFO L124 PetriNetUnfolderBase]: 12/82 cut-off events. [2025-01-10 06:34:24,580 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-10 06:34:24,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 82 events. 12/82 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 267 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-01-10 06:34:24,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 74 transitions, 166 flow [2025-01-10 06:34:24,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 74 transitions, 166 flow [2025-01-10 06:34:24,582 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:24,582 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;@3ced5c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:24,582 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-01-10 06:34:24,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:24,584 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-01-10 06:34:24,584 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-10 06:34:24,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:24,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:24,584 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:24,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:24,584 INFO L85 PathProgramCache]: Analyzing trace with hash 369060379, now seen corresponding path program 1 times [2025-01-10 06:34:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:24,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014176044] [2025-01-10 06:34:24,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:24,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:24,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:24,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:24,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:24,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:24,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:24,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:24,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014176044] [2025-01-10 06:34:24,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014176044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:24,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:24,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:24,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164028426] [2025-01-10 06:34:24,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:24,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:24,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:24,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:24,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:24,624 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:24,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:24,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:24,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:24,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:25,405 INFO L124 PetriNetUnfolderBase]: 5317/9887 cut-off events. [2025-01-10 06:34:25,405 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-01-10 06:34:25,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 9887 events. 5317/9887 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 80833 event pairs, 806 based on Foata normal form. 1648/10785 useless extension candidates. Maximal degree in co-relation 6526. Up to 5693 conditions per place. [2025-01-10 06:34:25,468 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 49 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-01-10 06:34:25,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 304 flow [2025-01-10 06:34:25,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:25,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-01-10 06:34:25,471 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7612612612612613 [2025-01-10 06:34:25,471 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 166 flow. Second operand 3 states and 169 transitions. [2025-01-10 06:34:25,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 304 flow [2025-01-10 06:34:25,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 300 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:25,473 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 152 flow [2025-01-10 06:34:25,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-01-10 06:34:25,474 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2025-01-10 06:34:25,474 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 152 flow [2025-01-10 06:34:25,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:25,474 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:25,474 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:25,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:34:25,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:25,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1444029717, now seen corresponding path program 1 times [2025-01-10 06:34:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:25,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108719423] [2025-01-10 06:34:25,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:25,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:25,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:25,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:25,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:25,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:25,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:25,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:25,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108719423] [2025-01-10 06:34:25,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108719423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:25,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:25,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:25,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950756697] [2025-01-10 06:34:25,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:25,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:25,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:25,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:25,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:25,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:25,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:25,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:25,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:25,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:26,024 INFO L124 PetriNetUnfolderBase]: 4754/9105 cut-off events. [2025-01-10 06:34:26,024 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-01-10 06:34:26,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16026 conditions, 9105 events. 4754/9105 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 75247 event pairs, 806 based on Foata normal form. 219/8589 useless extension candidates. Maximal degree in co-relation 14380. Up to 4911 conditions per place. [2025-01-10 06:34:26,065 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 06:34:26,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 300 flow [2025-01-10 06:34:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 06:34:26,067 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-01-10 06:34:26,067 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 152 flow. Second operand 3 states and 156 transitions. [2025-01-10 06:34:26,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 300 flow [2025-01-10 06:34:26,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:26,070 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 150 flow [2025-01-10 06:34:26,070 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-01-10 06:34:26,072 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-01-10 06:34:26,072 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 150 flow [2025-01-10 06:34:26,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:26,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:26,072 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:26,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:34:26,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:26,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,073 INFO L85 PathProgramCache]: Analyzing trace with hash -467979134, now seen corresponding path program 1 times [2025-01-10 06:34:26,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-01-10 06:34:26,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:26,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:26,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:26,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061487854] [2025-01-10 06:34:26,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061487854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:26,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146613893] [2025-01-10 06:34:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:26,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:26,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:26,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:26,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:26,123 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:26,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:26,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:26,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:26,813 INFO L124 PetriNetUnfolderBase]: 5320/9847 cut-off events. [2025-01-10 06:34:26,813 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-01-10 06:34:26,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17622 conditions, 9847 events. 5320/9847 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79974 event pairs, 824 based on Foata normal form. 216/9359 useless extension candidates. Maximal degree in co-relation 12822. Up to 5648 conditions per place. [2025-01-10 06:34:26,867 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-01-10 06:34:26,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 295 flow [2025-01-10 06:34:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:26,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 06:34:26,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-01-10 06:34:26,869 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 150 flow. Second operand 3 states and 156 transitions. [2025-01-10 06:34:26,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 295 flow [2025-01-10 06:34:26,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:26,874 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 148 flow [2025-01-10 06:34:26,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-01-10 06:34:26,874 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2025-01-10 06:34:26,875 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 148 flow [2025-01-10 06:34:26,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:26,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:26,875 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:26,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:34:26,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:26,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1622450822, now seen corresponding path program 1 times [2025-01-10 06:34:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:26,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-01-10 06:34:26,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:26,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:26,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:26,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:26,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:26,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:26,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977235876] [2025-01-10 06:34:26,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977235876] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:26,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:26,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:26,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-01-10 06:34:26,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:26,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:26,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:26,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:26,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:26,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:26,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:26,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:26,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:26,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,319 INFO L124 PetriNetUnfolderBase]: 4718/8669 cut-off events. [2025-01-10 06:34:27,319 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-01-10 06:34:27,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 8669 events. 4718/8669 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 67346 event pairs, 1400 based on Foata normal form. 216/8157 useless extension candidates. Maximal degree in co-relation 7276. Up to 4872 conditions per place. [2025-01-10 06:34:27,358 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 47 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-01-10 06:34:27,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 287 flow [2025-01-10 06:34:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:27,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:27,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-01-10 06:34:27,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-01-10 06:34:27,359 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 148 flow. Second operand 3 states and 155 transitions. [2025-01-10 06:34:27,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 287 flow [2025-01-10 06:34:27,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:27,361 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 146 flow [2025-01-10 06:34:27,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-01-10 06:34:27,362 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-01-10 06:34:27,362 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 146 flow [2025-01-10 06:34:27,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:27,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:34:27,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -696440286, now seen corresponding path program 1 times [2025-01-10 06:34:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-01-10 06:34:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:27,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:27,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409978404] [2025-01-10 06:34:27,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409978404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:27,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:27,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:34:27,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640072838] [2025-01-10 06:34:27,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:27,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:27,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:27,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:27,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:27,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:27,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:27,877 INFO L124 PetriNetUnfolderBase]: 5212/9269 cut-off events. [2025-01-10 06:34:27,877 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2025-01-10 06:34:27,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17047 conditions, 9269 events. 5212/9269 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 71508 event pairs, 1880 based on Foata normal form. 219/8564 useless extension candidates. Maximal degree in co-relation 16694. Up to 4129 conditions per place. [2025-01-10 06:34:27,922 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 67 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-01-10 06:34:27,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 394 flow [2025-01-10 06:34:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:27,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-01-10 06:34:27,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-01-10 06:34:27,924 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 146 flow. Second operand 4 states and 212 transitions. [2025-01-10 06:34:27,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 394 flow [2025-01-10 06:34:27,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:27,929 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 148 flow [2025-01-10 06:34:27,929 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-01-10 06:34:27,930 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-01-10 06:34:27,930 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 148 flow [2025-01-10 06:34:27,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:27,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:27,930 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:27,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:34:27,930 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:27,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -114811949, now seen corresponding path program 1 times [2025-01-10 06:34:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-01-10 06:34:27,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:27,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:34:27,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:34:27,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:27,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:27,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:27,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:27,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730938619] [2025-01-10 06:34:27,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730938619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:27,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:27,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:34:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041368720] [2025-01-10 06:34:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:27,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:34:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:27,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:34:27,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:34:27,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:27,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:27,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:27,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:27,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:28,808 INFO L124 PetriNetUnfolderBase]: 8962/16346 cut-off events. [2025-01-10 06:34:28,808 INFO L125 PetriNetUnfolderBase]: For 1763/1763 co-relation queries the response was YES. [2025-01-10 06:34:28,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30244 conditions, 16346 events. 8962/16346 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 139510 event pairs, 4390 based on Foata normal form. 219/15186 useless extension candidates. Maximal degree in co-relation 14374. Up to 7261 conditions per place. [2025-01-10 06:34:28,880 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 74 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:34:28,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 424 flow [2025-01-10 06:34:28,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:34:28,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:34:28,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-01-10 06:34:28,882 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7398648648648649 [2025-01-10 06:34:28,882 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 4 states and 219 transitions. [2025-01-10 06:34:28,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 424 flow [2025-01-10 06:34:28,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 410 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:34:28,903 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 167 flow [2025-01-10 06:34:28,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-01-10 06:34:28,903 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-01-10 06:34:28,904 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 167 flow [2025-01-10 06:34:28,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:28,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:28,904 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:28,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:34:28,904 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:28,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:28,904 INFO L85 PathProgramCache]: Analyzing trace with hash -152963652, now seen corresponding path program 1 times [2025-01-10 06:34:28,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:28,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611483741] [2025-01-10 06:34:28,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:28,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:28,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:34:28,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:34:28,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:28,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611483741] [2025-01-10 06:34:28,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611483741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:28,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:28,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024703791] [2025-01-10 06:34:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:28,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:28,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:28,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:34:28,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:28,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:28,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:34:28,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:29,825 INFO L124 PetriNetUnfolderBase]: 9388/17039 cut-off events. [2025-01-10 06:34:29,825 INFO L125 PetriNetUnfolderBase]: For 3114/3258 co-relation queries the response was YES. [2025-01-10 06:34:29,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32358 conditions, 17039 events. 9388/17039 cut-off events. For 3114/3258 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 145921 event pairs, 1970 based on Foata normal form. 336/16234 useless extension candidates. Maximal degree in co-relation 18871. Up to 9128 conditions per place. [2025-01-10 06:34:29,907 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 53 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 06:34:29,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 336 flow [2025-01-10 06:34:29,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:29,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-01-10 06:34:29,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-01-10 06:34:29,909 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 167 flow. Second operand 3 states and 155 transitions. [2025-01-10 06:34:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 336 flow [2025-01-10 06:34:29,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:34:29,912 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 166 flow [2025-01-10 06:34:29,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-01-10 06:34:29,912 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-01-10 06:34:29,912 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 166 flow [2025-01-10 06:34:29,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:29,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,913 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:34:29,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-01-10 06:34:29,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,913 INFO L85 PathProgramCache]: Analyzing trace with hash -446914755, now seen corresponding path program 1 times [2025-01-10 06:34:29,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846804341] [2025-01-10 06:34:29,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:34:29,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:34:29,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:29,920 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 06:34:29,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:34:29,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:34:29,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 06:34:29,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 06:34:29,927 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-10 06:34:29,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-01-10 06:34:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-01-10 06:34:29,927 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-01-10 06:34:29,928 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-01-10 06:34:29,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:34:29,929 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:29,929 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-10 06:34:29,929 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-10 06:34:29,955 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:34:29,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 222 flow [2025-01-10 06:34:29,962 INFO L124 PetriNetUnfolderBase]: 16/108 cut-off events. [2025-01-10 06:34:29,962 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-10 06:34:29,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 108 events. 16/108 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 375 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 94. Up to 5 conditions per place. [2025-01-10 06:34:29,962 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 97 transitions, 222 flow [2025-01-10 06:34:29,963 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 97 transitions, 222 flow [2025-01-10 06:34:29,963 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:34:29,964 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;@3ced5c42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:34:29,964 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-10 06:34:29,965 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:34:29,965 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-10 06:34:29,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:34:29,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:29,965 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:34:29,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:29,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 461649810, now seen corresponding path program 1 times [2025-01-10 06:34:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004239255] [2025-01-10 06:34:29,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:29,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:34:29,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:34:29,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:29,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:29,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:29,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:29,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004239255] [2025-01-10 06:34:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004239255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:29,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:29,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:29,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218740498] [2025-01-10 06:34:29,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:29,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:29,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:29,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:29,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:34:29,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:29,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:29,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:34:29,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:34,908 INFO L124 PetriNetUnfolderBase]: 58261/94975 cut-off events. [2025-01-10 06:34:34,908 INFO L125 PetriNetUnfolderBase]: For 6419/6419 co-relation queries the response was YES. [2025-01-10 06:34:35,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170307 conditions, 94975 events. 58261/94975 cut-off events. For 6419/6419 co-relation queries the response was YES. Maximal size of possible extension queue 4003. Compared 897485 event pairs, 9510 based on Foata normal form. 19220/107997 useless extension candidates. Maximal degree in co-relation 30712. Up to 57853 conditions per place. [2025-01-10 06:34:35,494 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 67 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-01-10 06:34:35,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 419 flow [2025-01-10 06:34:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-01-10 06:34:35,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7800687285223368 [2025-01-10 06:34:35,496 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 222 flow. Second operand 3 states and 227 transitions. [2025-01-10 06:34:35,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 419 flow [2025-01-10 06:34:35,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 407 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-01-10 06:34:35,501 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 200 flow [2025-01-10 06:34:35,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-01-10 06:34:35,502 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-01-10 06:34:35,502 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 200 flow [2025-01-10 06:34:35,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:35,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:35,503 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:34:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:34:35,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1426242763, now seen corresponding path program 1 times [2025-01-10 06:34:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454093128] [2025-01-10 06:34:35,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:35,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:34:35,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:34:35,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:35,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:35,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:35,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454093128] [2025-01-10 06:34:35,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454093128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:35,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:35,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:35,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846259897] [2025-01-10 06:34:35,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:35,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:35,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:35,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:35,549 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:34:35,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:35,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:35,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:34:35,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:40,394 INFO L124 PetriNetUnfolderBase]: 52002/86961 cut-off events. [2025-01-10 06:34:40,394 INFO L125 PetriNetUnfolderBase]: For 5479/5479 co-relation queries the response was YES. [2025-01-10 06:34:40,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156347 conditions, 86961 events. 52002/86961 cut-off events. For 5479/5479 co-relation queries the response was YES. Maximal size of possible extension queue 3680. Compared 838526 event pairs, 9510 based on Foata normal form. 1755/82605 useless extension candidates. Maximal degree in co-relation 140780. Up to 49839 conditions per place. [2025-01-10 06:34:40,834 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-01-10 06:34:40,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 115 transitions, 407 flow [2025-01-10 06:34:40,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:40,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-01-10 06:34:40,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-01-10 06:34:40,836 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 200 flow. Second operand 3 states and 210 transitions. [2025-01-10 06:34:40,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 115 transitions, 407 flow [2025-01-10 06:34:40,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:40,843 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 198 flow [2025-01-10 06:34:40,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2025-01-10 06:34:40,845 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-01-10 06:34:40,845 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 198 flow [2025-01-10 06:34:40,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:40,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:40,845 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:40,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:34:40,845 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:40,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:40,846 INFO L85 PathProgramCache]: Analyzing trace with hash 473901058, now seen corresponding path program 1 times [2025-01-10 06:34:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:40,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110521844] [2025-01-10 06:34:40,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:40,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:40,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-10 06:34:40,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-10 06:34:40,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:40,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110521844] [2025-01-10 06:34:40,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110521844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:40,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:40,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:40,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981080209] [2025-01-10 06:34:40,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:40,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:40,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:40,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:40,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:40,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:34:40,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:40,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:40,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:34:40,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:45,888 INFO L124 PetriNetUnfolderBase]: 57886/92803 cut-off events. [2025-01-10 06:34:45,889 INFO L125 PetriNetUnfolderBase]: For 6269/6269 co-relation queries the response was YES. [2025-01-10 06:34:46,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170851 conditions, 92803 events. 57886/92803 cut-off events. For 6269/6269 co-relation queries the response was YES. Maximal size of possible extension queue 4059. Compared 842906 event pairs, 23016 based on Foata normal form. 1752/87314 useless extension candidates. Maximal degree in co-relation 125149. Up to 57808 conditions per place. [2025-01-10 06:34:46,498 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-01-10 06:34:46,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 402 flow [2025-01-10 06:34:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:46,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:46,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-01-10 06:34:46,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-01-10 06:34:46,501 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 198 flow. Second operand 3 states and 210 transitions. [2025-01-10 06:34:46,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 402 flow [2025-01-10 06:34:46,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 113 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:46,517 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 196 flow [2025-01-10 06:34:46,522 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-01-10 06:34:46,522 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-01-10 06:34:46,522 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 196 flow [2025-01-10 06:34:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:46,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:46,522 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:34:46,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:46,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1806031473, now seen corresponding path program 1 times [2025-01-10 06:34:46,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:46,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-01-10 06:34:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:46,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:46,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:46,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:46,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:46,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:46,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917816429] [2025-01-10 06:34:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917816429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:46,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:34:46,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703680746] [2025-01-10 06:34:46,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:34:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:46,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:34:46,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:34:46,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-01-10 06:34:46,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:46,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:46,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-01-10 06:34:46,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:34:51,094 INFO L124 PetriNetUnfolderBase]: 51414/82779 cut-off events. [2025-01-10 06:34:51,095 INFO L125 PetriNetUnfolderBase]: For 5606/5606 co-relation queries the response was YES. [2025-01-10 06:34:51,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152159 conditions, 82779 events. 51414/82779 cut-off events. For 5606/5606 co-relation queries the response was YES. Maximal size of possible extension queue 3597. Compared 743754 event pairs, 20568 based on Foata normal form. 1752/78004 useless extension candidates. Maximal degree in co-relation 72464. Up to 49800 conditions per place. [2025-01-10 06:34:51,799 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 65 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-01-10 06:34:51,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 394 flow [2025-01-10 06:34:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:34:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:34:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-01-10 06:34:51,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.718213058419244 [2025-01-10 06:34:51,801 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 196 flow. Second operand 3 states and 209 transitions. [2025-01-10 06:34:51,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 394 flow [2025-01-10 06:34:51,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:34:51,807 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 194 flow [2025-01-10 06:34:51,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-01-10 06:34:51,808 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-01-10 06:34:51,808 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 194 flow [2025-01-10 06:34:51,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:51,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:34:51,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:34:51,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:34:51,808 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-01-10 06:34:51,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:34:51,809 INFO L85 PathProgramCache]: Analyzing trace with hash -912766503, now seen corresponding path program 1 times [2025-01-10 06:34:51,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:34:51,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-01-10 06:34:51,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:34:51,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:34:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:34:51,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:34:51,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:34:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:34:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:34:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:34:51,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758736812] [2025-01-10 06:34:51,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758736812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:34:51,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:34:51,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:34:51,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312495224] [2025-01-10 06:34:51,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:34:51,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:34:51,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:34:51,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:34:51,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:34:51,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-01-10 06:34:51,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:34:51,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:34:51,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-01-10 06:34:51,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand