./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.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 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:48:22,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:48:22,818 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:48:22,824 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:48:22,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:48:22,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:48:22,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:48:22,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:48:22,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:48:22,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:48:22,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:48:22,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:48:22,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:48:22,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:48:22,863 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:48:22,864 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:48:22,864 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:22,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:48:22,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:22,865 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:48:22,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:48:22,865 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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2025-01-10 06:48:23,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:48:23,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:48:23,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:48:23,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:48:23,087 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:48:23,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-01-10 06:48:24,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/688e228e2/fc1461b0893d4c6f9c10751995787fc7/FLAG28fcbfe36 [2025-01-10 06:48:24,441 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:48:24,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-01-10 06:48:24,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/688e228e2/fc1461b0893d4c6f9c10751995787fc7/FLAG28fcbfe36 [2025-01-10 06:48:24,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/688e228e2/fc1461b0893d4c6f9c10751995787fc7 [2025-01-10 06:48:24,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:48:24,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:48:24,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:24,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:48:24,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:48:24,748 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:24" (1/1) ... [2025-01-10 06:48:24,748 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae5c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:24, skipping insertion in model container [2025-01-10 06:48:24,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:48:24" (1/1) ... [2025-01-10 06:48:24,796 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:48:25,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:25,290 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:48:25,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:48:25,362 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:48:25,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25 WrapperNode [2025-01-10 06:48:25,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:48:25,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:25,364 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:48:25,364 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:48:25,369 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:48:25" (1/1) ... [2025-01-10 06:48:25,377 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:48:25" (1/1) ... [2025-01-10 06:48:25,401 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 196 [2025-01-10 06:48:25,401 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:48:25,402 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:48:25,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:48:25,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:48:25,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,410 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,421 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-10 06:48:25,421 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,427 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,433 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:48:25,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:48:25,439 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:48:25,439 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:48:25,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (1/1) ... [2025-01-10 06:48:25,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:48:25,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:48:25,467 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:48:25,473 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:48:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-10 06:48:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-10 06:48:25,489 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-10 06:48:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:48:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:48:25,491 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:48:25,602 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:48:25,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:48:25,845 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:48:25,845 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:48:25,963 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:48:25,964 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:48:25,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:25 BoogieIcfgContainer [2025-01-10 06:48:25,964 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:48:25,966 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:48:25,966 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:48:25,969 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:48:25,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:48:24" (1/3) ... [2025-01-10 06:48:25,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb8aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:25, skipping insertion in model container [2025-01-10 06:48:25,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:48:25" (2/3) ... [2025-01-10 06:48:25,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ccb8aea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:48:25, skipping insertion in model container [2025-01-10 06:48:25,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:25" (3/3) ... [2025-01-10 06:48:25,970 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-01-10 06:48:25,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:48:25,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 70 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-10 06:48:25,981 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:48:26,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-10 06:48:26,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 75 transitions, 154 flow [2025-01-10 06:48:26,098 INFO L124 PetriNetUnfolderBase]: 5/75 cut-off events. [2025-01-10 06:48:26,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 75 events. 5/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 0 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2025-01-10 06:48:26,102 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 75 transitions, 154 flow [2025-01-10 06:48:26,104 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 73 transitions, 149 flow [2025-01-10 06:48:26,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:48:26,115 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;@51e21116, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:48:26,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-01-10 06:48:26,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:48:26,120 INFO L124 PetriNetUnfolderBase]: 0/20 cut-off events. [2025-01-10 06:48:26,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:26,121 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:26,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:26,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1001970716, now seen corresponding path program 1 times [2025-01-10 06:48:26,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:26,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392014502] [2025-01-10 06:48:26,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:26,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:26,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:48:26,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:48:26,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:26,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:26,307 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:48:26,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:26,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392014502] [2025-01-10 06:48:26,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392014502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:26,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:26,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213417870] [2025-01-10 06:48:26,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:26,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:26,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:26,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 06:48:26,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 73 transitions, 149 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:48:26,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:26,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 06:48:26,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:26,603 INFO L124 PetriNetUnfolderBase]: 354/958 cut-off events. [2025-01-10 06:48:26,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:48:26,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1633 conditions, 958 events. 354/958 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5530 event pairs, 220 based on Foata normal form. 51/912 useless extension candidates. Maximal degree in co-relation 1622. Up to 508 conditions per place. [2025-01-10 06:48:26,610 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-01-10 06:48:26,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 283 flow [2025-01-10 06:48:26,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2025-01-10 06:48:26,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7066666666666667 [2025-01-10 06:48:26,619 INFO L175 Difference]: Start difference. First operand has 72 places, 73 transitions, 149 flow. Second operand 3 states and 159 transitions. [2025-01-10 06:48:26,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 283 flow [2025-01-10 06:48:26,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 86 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:26,630 INFO L231 Difference]: Finished difference. Result has 71 places, 70 transitions, 146 flow [2025-01-10 06:48:26,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=71, PETRI_TRANSITIONS=70} [2025-01-10 06:48:26,634 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -1 predicate places. [2025-01-10 06:48:26,634 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 70 transitions, 146 flow [2025-01-10 06:48:26,634 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:48:26,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:26,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:48:26,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:26,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash -996320534, now seen corresponding path program 1 times [2025-01-10 06:48:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:26,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419787612] [2025-01-10 06:48:26,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:26,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:48:26,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:48:26,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:26,748 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:48:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:26,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419787612] [2025-01-10 06:48:26,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419787612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:26,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:26,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:26,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742944874] [2025-01-10 06:48:26,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:26,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:26,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:26,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:26,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:26,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 75 [2025-01-10 06:48:26,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 70 transitions, 146 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:48:26,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:26,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 75 [2025-01-10 06:48:26,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:26,930 INFO L124 PetriNetUnfolderBase]: 335/922 cut-off events. [2025-01-10 06:48:26,930 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 06:48:26,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 922 events. 335/922 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5309 event pairs, 218 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 1582. Up to 508 conditions per place. [2025-01-10 06:48:26,934 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 51 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-01-10 06:48:26,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 282 flow [2025-01-10 06:48:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-01-10 06:48:26,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6933333333333334 [2025-01-10 06:48:26,935 INFO L175 Difference]: Start difference. First operand has 71 places, 70 transitions, 146 flow. Second operand 3 states and 156 transitions. [2025-01-10 06:48:26,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 282 flow [2025-01-10 06:48:26,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:26,937 INFO L231 Difference]: Finished difference. Result has 70 places, 69 transitions, 144 flow [2025-01-10 06:48:26,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=70, PETRI_TRANSITIONS=69} [2025-01-10 06:48:26,938 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 06:48:26,938 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 69 transitions, 144 flow [2025-01-10 06:48:26,938 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:48:26,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:26,938 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:48:26,938 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:26,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash 314009172, now seen corresponding path program 1 times [2025-01-10 06:48:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263829732] [2025-01-10 06:48:26,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:26,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:48:26,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:48:26,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:26,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,044 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:48:27,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263829732] [2025-01-10 06:48:27,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263829732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:27,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656324274] [2025-01-10 06:48:27,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:27,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:27,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:27,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-01-10 06:48:27,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:48:27,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-01-10 06:48:27,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,217 INFO L124 PetriNetUnfolderBase]: 348/932 cut-off events. [2025-01-10 06:48:27,217 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 06:48:27,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1640 conditions, 932 events. 348/932 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5266 event pairs, 258 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1629. Up to 604 conditions per place. [2025-01-10 06:48:27,221 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 52 selfloop transitions, 2 changer transitions 0/84 dead transitions. [2025-01-10 06:48:27,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 84 transitions, 282 flow [2025-01-10 06:48:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2025-01-10 06:48:27,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2025-01-10 06:48:27,223 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 144 flow. Second operand 3 states and 160 transitions. [2025-01-10 06:48:27,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 84 transitions, 282 flow [2025-01-10 06:48:27,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 84 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:27,225 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 142 flow [2025-01-10 06:48:27,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2025-01-10 06:48:27,226 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2025-01-10 06:48:27,226 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 142 flow [2025-01-10 06:48:27,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 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:48:27,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:48:27,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash 491706580, now seen corresponding path program 1 times [2025-01-10 06:48:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012405455] [2025-01-10 06:48:27,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:27,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:27,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,318 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:48:27,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012405455] [2025-01-10 06:48:27,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012405455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:27,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32154650] [2025-01-10 06:48:27,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:27,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:27,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:27,322 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-01-10 06:48:27,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:27,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-01-10 06:48:27,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,433 INFO L124 PetriNetUnfolderBase]: 317/849 cut-off events. [2025-01-10 06:48:27,433 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-10 06:48:27,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 849 events. 317/849 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4617 event pairs, 243 based on Foata normal form. 0/794 useless extension candidates. Maximal degree in co-relation 1507. Up to 559 conditions per place. [2025-01-10 06:48:27,436 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 53 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2025-01-10 06:48:27,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 282 flow [2025-01-10 06:48:27,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:27,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2025-01-10 06:48:27,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7155555555555555 [2025-01-10 06:48:27,438 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 3 states and 161 transitions. [2025-01-10 06:48:27,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 282 flow [2025-01-10 06:48:27,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 274 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:27,440 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 132 flow [2025-01-10 06:48:27,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=128, 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=132, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-01-10 06:48:27,441 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-01-10 06:48:27,441 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 132 flow [2025-01-10 06:48:27,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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:48:27,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:48:27,442 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:27,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,443 INFO L85 PathProgramCache]: Analyzing trace with hash 812186711, now seen corresponding path program 1 times [2025-01-10 06:48:27,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433892443] [2025-01-10 06:48:27,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:27,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:27,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:48:27,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433892443] [2025-01-10 06:48:27,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433892443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:27,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154879185] [2025-01-10 06:48:27,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:27,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:27,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:27,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-01-10 06:48:27,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:48:27,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-01-10 06:48:27,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:27,680 INFO L124 PetriNetUnfolderBase]: 354/894 cut-off events. [2025-01-10 06:48:27,681 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 06:48:27,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1645 conditions, 894 events. 354/894 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4854 event pairs, 207 based on Foata normal form. 0/838 useless extension candidates. Maximal degree in co-relation 1634. Up to 473 conditions per place. [2025-01-10 06:48:27,684 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 66 selfloop transitions, 3 changer transitions 0/92 dead transitions. [2025-01-10 06:48:27,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 336 flow [2025-01-10 06:48:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:27,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:27,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2025-01-10 06:48:27,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66 [2025-01-10 06:48:27,685 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 132 flow. Second operand 4 states and 198 transitions. [2025-01-10 06:48:27,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 336 flow [2025-01-10 06:48:27,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 92 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:48:27,703 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 132 flow [2025-01-10 06:48:27,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-01-10 06:48:27,705 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2025-01-10 06:48:27,705 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 132 flow [2025-01-10 06:48:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 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:48:27,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:27,705 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:27,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:48:27,705 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash 812187764, now seen corresponding path program 1 times [2025-01-10 06:48:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787401296] [2025-01-10 06:48:27,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:27,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:27,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:48:27,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:48:27,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:27,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:27,803 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:48:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787401296] [2025-01-10 06:48:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787401296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:48:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385908615] [2025-01-10 06:48:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:27,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:27,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:27,840 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 75 [2025-01-10 06:48:27,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:48:27,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:27,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 75 [2025-01-10 06:48:27,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,066 INFO L124 PetriNetUnfolderBase]: 337/829 cut-off events. [2025-01-10 06:48:28,066 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-10 06:48:28,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1550 conditions, 829 events. 337/829 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4299 event pairs, 208 based on Foata normal form. 0/805 useless extension candidates. Maximal degree in co-relation 1539. Up to 473 conditions per place. [2025-01-10 06:48:28,069 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 64 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-01-10 06:48:28,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 89 transitions, 322 flow [2025-01-10 06:48:28,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 185 transitions. [2025-01-10 06:48:28,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2025-01-10 06:48:28,071 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 132 flow. Second operand 4 states and 185 transitions. [2025-01-10 06:48:28,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 89 transitions, 322 flow [2025-01-10 06:48:28,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 89 transitions, 316 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:48:28,072 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 128 flow [2025-01-10 06:48:28,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=128, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2025-01-10 06:48:28,073 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2025-01-10 06:48:28,073 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 128 flow [2025-01-10 06:48:28,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 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:48:28,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,074 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:48:28,074 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:28,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,074 INFO L85 PathProgramCache]: Analyzing trace with hash -592015152, now seen corresponding path program 1 times [2025-01-10 06:48:28,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131649178] [2025-01-10 06:48:28,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:48:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:48:28,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,222 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:48:28,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131649178] [2025-01-10 06:48:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131649178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:28,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097647431] [2025-01-10 06:48:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:48:28,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:48:28,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:48:28,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 75 [2025-01-10 06:48:28,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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:48:28,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 75 [2025-01-10 06:48:28,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,412 INFO L124 PetriNetUnfolderBase]: 320/796 cut-off events. [2025-01-10 06:48:28,412 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 06:48:28,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1500 conditions, 796 events. 320/796 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4056 event pairs, 194 based on Foata normal form. 16/788 useless extension candidates. Maximal degree in co-relation 1489. Up to 439 conditions per place. [2025-01-10 06:48:28,415 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 51 selfloop transitions, 4 changer transitions 15/88 dead transitions. [2025-01-10 06:48:28,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 320 flow [2025-01-10 06:48:28,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:28,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2025-01-10 06:48:28,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-01-10 06:48:28,416 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 128 flow. Second operand 4 states and 196 transitions. [2025-01-10 06:48:28,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 320 flow [2025-01-10 06:48:28,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:48:28,418 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 112 flow [2025-01-10 06:48:28,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2025-01-10 06:48:28,418 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-01-10 06:48:28,419 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 112 flow [2025-01-10 06:48:28,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 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:48:28,419 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,419 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:48:28,419 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:28,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 83610136, now seen corresponding path program 1 times [2025-01-10 06:48:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005563020] [2025-01-10 06:48:28,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:48:28,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:48:28,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,455 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:48:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005563020] [2025-01-10 06:48:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005563020] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:48:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027099439] [2025-01-10 06:48:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:48:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:48:28,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:48:28,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 06:48:28,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 112 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:48:28,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 06:48:28,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:28,563 INFO L124 PetriNetUnfolderBase]: 217/634 cut-off events. [2025-01-10 06:48:28,563 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-10 06:48:28,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 634 events. 217/634 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3110 event pairs, 126 based on Foata normal form. 19/592 useless extension candidates. Maximal degree in co-relation 1111. Up to 281 conditions per place. [2025-01-10 06:48:28,566 INFO L140 encePairwiseOnDemand]: 73/75 looper letters, 50 selfloop transitions, 1 changer transitions 0/68 dead transitions. [2025-01-10 06:48:28,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 254 flow [2025-01-10 06:48:28,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:48:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:48:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2025-01-10 06:48:28,568 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6711111111111111 [2025-01-10 06:48:28,568 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 112 flow. Second operand 3 states and 151 transitions. [2025-01-10 06:48:28,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 254 flow [2025-01-10 06:48:28,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 68 transitions, 240 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:48:28,570 INFO L231 Difference]: Finished difference. Result has 54 places, 50 transitions, 104 flow [2025-01-10 06:48:28,570 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=54, PETRI_TRANSITIONS=50} [2025-01-10 06:48:28,570 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2025-01-10 06:48:28,571 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 50 transitions, 104 flow [2025-01-10 06:48:28,571 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:48:28,571 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:28,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:28,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:48:28,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:28,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:28,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1703053439, now seen corresponding path program 1 times [2025-01-10 06:48:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:28,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764752339] [2025-01-10 06:48:28,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:28,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:48:28,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:48:28,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:28,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:28,674 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:48:28,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:28,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764752339] [2025-01-10 06:48:28,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764752339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:28,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:28,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:48:28,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233292913] [2025-01-10 06:48:28,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:28,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:48:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:28,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:48:28,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:48:28,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 06:48:28,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 50 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:28,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:28,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 06:48:28,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:29,003 INFO L124 PetriNetUnfolderBase]: 378/953 cut-off events. [2025-01-10 06:48:29,004 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-01-10 06:48:29,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1773 conditions, 953 events. 378/953 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5210 event pairs, 170 based on Foata normal form. 19/939 useless extension candidates. Maximal degree in co-relation 1762. Up to 426 conditions per place. [2025-01-10 06:48:29,011 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 84 selfloop transitions, 7 changer transitions 0/106 dead transitions. [2025-01-10 06:48:29,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 106 transitions, 402 flow [2025-01-10 06:48:29,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 06:48:29,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-01-10 06:48:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2025-01-10 06:48:29,017 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5942857142857143 [2025-01-10 06:48:29,017 INFO L175 Difference]: Start difference. First operand has 54 places, 50 transitions, 104 flow. Second operand 7 states and 312 transitions. [2025-01-10 06:48:29,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 106 transitions, 402 flow [2025-01-10 06:48:29,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 106 transitions, 399 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:48:29,023 INFO L231 Difference]: Finished difference. Result has 62 places, 55 transitions, 148 flow [2025-01-10 06:48:29,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=55} [2025-01-10 06:48:29,024 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2025-01-10 06:48:29,024 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 55 transitions, 148 flow [2025-01-10 06:48:29,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:48:29,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:29,024 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:29,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:48:29,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:29,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1255048389, now seen corresponding path program 1 times [2025-01-10 06:48:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215624725] [2025-01-10 06:48:29,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:29,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:48:29,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:48:29,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:29,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:29,069 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:48:29,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:29,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215624725] [2025-01-10 06:48:29,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215624725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:29,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:29,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:48:29,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261940912] [2025-01-10 06:48:29,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:29,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:29,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:29,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:29,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:29,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 75 [2025-01-10 06:48:29,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 55 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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:48:29,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:29,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 75 [2025-01-10 06:48:29,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:29,278 INFO L124 PetriNetUnfolderBase]: 327/939 cut-off events. [2025-01-10 06:48:29,278 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2025-01-10 06:48:29,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 939 events. 327/939 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5346 event pairs, 169 based on Foata normal form. 15/949 useless extension candidates. Maximal degree in co-relation 1787. Up to 382 conditions per place. [2025-01-10 06:48:29,282 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 68 selfloop transitions, 5 changer transitions 0/88 dead transitions. [2025-01-10 06:48:29,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 88 transitions, 360 flow [2025-01-10 06:48:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-01-10 06:48:29,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65 [2025-01-10 06:48:29,283 INFO L175 Difference]: Start difference. First operand has 62 places, 55 transitions, 148 flow. Second operand 4 states and 195 transitions. [2025-01-10 06:48:29,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 88 transitions, 360 flow [2025-01-10 06:48:29,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 360 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:48:29,287 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 150 flow [2025-01-10 06:48:29,288 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2025-01-10 06:48:29,288 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2025-01-10 06:48:29,289 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 150 flow [2025-01-10 06:48:29,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 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:48:29,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:29,289 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:48:29,289 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:29,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:29,290 INFO L85 PathProgramCache]: Analyzing trace with hash 814857686, now seen corresponding path program 1 times [2025-01-10 06:48:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246188235] [2025-01-10 06:48:29,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:29,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:48:29,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:48:29,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:29,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:29,357 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:48:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:29,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246188235] [2025-01-10 06:48:29,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246188235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:29,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:29,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:48:29,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999997787] [2025-01-10 06:48:29,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:29,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:48:29,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:29,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:48:29,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:48:29,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 75 [2025-01-10 06:48:29,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 150 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 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:48:29,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:29,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 75 [2025-01-10 06:48:29,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:29,530 INFO L124 PetriNetUnfolderBase]: 341/911 cut-off events. [2025-01-10 06:48:29,530 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2025-01-10 06:48:29,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 911 events. 341/911 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5027 event pairs, 216 based on Foata normal form. 34/940 useless extension candidates. Maximal degree in co-relation 1890. Up to 514 conditions per place. [2025-01-10 06:48:29,533 INFO L140 encePairwiseOnDemand]: 72/75 looper letters, 60 selfloop transitions, 2 changer transitions 13/88 dead transitions. [2025-01-10 06:48:29,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 378 flow [2025-01-10 06:48:29,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:48:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:48:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2025-01-10 06:48:29,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6766666666666666 [2025-01-10 06:48:29,535 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 150 flow. Second operand 4 states and 203 transitions. [2025-01-10 06:48:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 378 flow [2025-01-10 06:48:29,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 88 transitions, 368 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:48:29,537 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 115 flow [2025-01-10 06:48:29,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-01-10 06:48:29,537 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2025-01-10 06:48:29,537 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 115 flow [2025-01-10 06:48:29,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 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:48:29,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:29,538 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:29,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:48:29,538 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:29,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:29,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1162788242, now seen corresponding path program 1 times [2025-01-10 06:48:29,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:29,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199664346] [2025-01-10 06:48:29,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:29,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:29,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:48:29,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:48:29,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:29,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:29,647 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:48:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:29,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199664346] [2025-01-10 06:48:29,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199664346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:29,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:29,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:48:29,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453679112] [2025-01-10 06:48:29,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:29,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:48:29,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:29,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:48:29,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:48:29,693 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 75 [2025-01-10 06:48:29,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 115 flow. Second operand has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:48:29,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:29,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 75 [2025-01-10 06:48:29,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:29,926 INFO L124 PetriNetUnfolderBase]: 269/692 cut-off events. [2025-01-10 06:48:29,926 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2025-01-10 06:48:29,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1443 conditions, 692 events. 269/692 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3451 event pairs, 111 based on Foata normal form. 15/703 useless extension candidates. Maximal degree in co-relation 1427. Up to 267 conditions per place. [2025-01-10 06:48:29,928 INFO L140 encePairwiseOnDemand]: 68/75 looper letters, 43 selfloop transitions, 4 changer transitions 45/105 dead transitions. [2025-01-10 06:48:29,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 105 transitions, 431 flow [2025-01-10 06:48:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:48:29,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:48:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 318 transitions. [2025-01-10 06:48:29,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-01-10 06:48:29,930 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 115 flow. Second operand 8 states and 318 transitions. [2025-01-10 06:48:29,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 105 transitions, 431 flow [2025-01-10 06:48:29,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 105 transitions, 408 flow, removed 5 selfloop flow, removed 6 redundant places. [2025-01-10 06:48:29,932 INFO L231 Difference]: Finished difference. Result has 65 places, 47 transitions, 122 flow [2025-01-10 06:48:29,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=65, PETRI_TRANSITIONS=47} [2025-01-10 06:48:29,932 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2025-01-10 06:48:29,932 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 47 transitions, 122 flow [2025-01-10 06:48:29,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.5) internal successors, (244), 8 states have internal predecessors, (244), 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:48:29,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:29,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:29,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:48:29,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:29,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:29,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1658371059, now seen corresponding path program 1 times [2025-01-10 06:48:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075960011] [2025-01-10 06:48:29,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:29,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:29,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-10 06:48:29,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-10 06:48:29,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:29,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:30,040 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:48:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:30,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075960011] [2025-01-10 06:48:30,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075960011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:30,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:30,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 06:48:30,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510853605] [2025-01-10 06:48:30,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:30,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:48:30,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:30,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:48:30,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-10 06:48:30,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 75 [2025-01-10 06:48:30,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 47 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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:48:30,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:30,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 75 [2025-01-10 06:48:30,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:30,276 INFO L124 PetriNetUnfolderBase]: 125/367 cut-off events. [2025-01-10 06:48:30,276 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 06:48:30,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 367 events. 125/367 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1393 event pairs, 89 based on Foata normal form. 11/376 useless extension candidates. Maximal degree in co-relation 752. Up to 204 conditions per place. [2025-01-10 06:48:30,277 INFO L140 encePairwiseOnDemand]: 70/75 looper letters, 36 selfloop transitions, 3 changer transitions 13/66 dead transitions. [2025-01-10 06:48:30,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 268 flow [2025-01-10 06:48:30,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:48:30,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:48:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2025-01-10 06:48:30,281 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2025-01-10 06:48:30,281 INFO L175 Difference]: Start difference. First operand has 65 places, 47 transitions, 122 flow. Second operand 6 states and 264 transitions. [2025-01-10 06:48:30,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 268 flow [2025-01-10 06:48:30,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 66 transitions, 246 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-01-10 06:48:30,283 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 116 flow [2025-01-10 06:48:30,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2025-01-10 06:48:30,283 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2025-01-10 06:48:30,283 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 116 flow [2025-01-10 06:48:30,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.833333333333336) internal successors, (233), 6 states have internal predecessors, (233), 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:48:30,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:48:30,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:30,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:48:30,284 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-01-10 06:48:30,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:48:30,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1567672138, now seen corresponding path program 1 times [2025-01-10 06:48:30,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:48:30,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525126540] [2025-01-10 06:48:30,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:48:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:48:30,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-10 06:48:30,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-10 06:48:30,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:48:30,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:48:30,434 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:48:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:48:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525126540] [2025-01-10 06:48:30,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525126540] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:48:30,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:48:30,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-10 06:48:30,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787247381] [2025-01-10 06:48:30,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:48:30,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-10 06:48:30,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:48:30,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-10 06:48:30,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:48:30,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 75 [2025-01-10 06:48:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 47 transitions, 116 flow. Second operand has 8 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 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:48:30,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:48:30,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 75 [2025-01-10 06:48:30,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:48:30,678 INFO L124 PetriNetUnfolderBase]: 117/322 cut-off events. [2025-01-10 06:48:30,678 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-10 06:48:30,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 322 events. 117/322 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1115 event pairs, 51 based on Foata normal form. 8/328 useless extension candidates. Maximal degree in co-relation 651. Up to 124 conditions per place. [2025-01-10 06:48:30,679 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 0 selfloop transitions, 0 changer transitions 72/72 dead transitions. [2025-01-10 06:48:30,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 72 transitions, 294 flow [2025-01-10 06:48:30,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-10 06:48:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-01-10 06:48:30,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 277 transitions. [2025-01-10 06:48:30,683 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46166666666666667 [2025-01-10 06:48:30,683 INFO L175 Difference]: Start difference. First operand has 61 places, 47 transitions, 116 flow. Second operand 8 states and 277 transitions. [2025-01-10 06:48:30,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 72 transitions, 294 flow [2025-01-10 06:48:30,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 280 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-10 06:48:30,684 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-01-10 06:48:30,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-01-10 06:48:30,684 INFO L279 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2025-01-10 06:48:30,684 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-01-10 06:48:30,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.375) internal successors, (243), 8 states have internal predecessors, (243), 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:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-01-10 06:48:30,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-01-10 06:48:30,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-01-10 06:48:30,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:48:30,689 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:48:30,692 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:48:30,692 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:48:30,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:48:30 BasicIcfg [2025-01-10 06:48:30,696 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:48:30,696 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:48:30,696 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:48:30,696 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:48:30,697 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:48:25" (3/4) ... [2025-01-10 06:48:30,698 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:48:30,700 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-10 06:48:30,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2025-01-10 06:48:30,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-01-10 06:48:30,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-10 06:48:30,702 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-10 06:48:30,750 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:48:30,751 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:48:30,751 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:48:30,751 INFO L158 Benchmark]: Toolchain (without parser) took 6016.93ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.9MB in the beginning and 127.3MB in the end (delta: -5.4MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2025-01-10 06:48:30,752 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:30,752 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.83ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 101.3MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:48:30,752 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.49ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:48:30,752 INFO L158 Benchmark]: Boogie Preprocessor took 32.27ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:30,752 INFO L158 Benchmark]: RCFGBuilder took 525.85ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 43.1MB in the end (delta: 54.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 06:48:30,753 INFO L158 Benchmark]: TraceAbstraction took 4730.03ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 42.7MB in the beginning and 133.6MB in the end (delta: -90.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:48:30,753 INFO L158 Benchmark]: Witness Printer took 54.81ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:48:30,754 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.83ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 101.3MB in the end (delta: 20.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.49ms. Allocated memory is still 167.8MB. Free memory was 101.3MB in the beginning and 99.2MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.27ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 97.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 525.85ms. Allocated memory is still 167.8MB. Free memory was 97.1MB in the beginning and 43.1MB in the end (delta: 54.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4730.03ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 42.7MB in the beginning and 133.6MB in the end (delta: -90.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 54.81ms. Allocated memory is still 201.3MB. Free memory was 133.6MB in the beginning and 127.3MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 103 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1054 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 213 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2501 IncrementalHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 67 mSDtfsCounter, 2501 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=150occurred in iteration=10, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 251 ConstructedInterpolants, 0 QuantifiedInterpolants, 712 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:48:30,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE