./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1cec523a42b4b57f00a275aac533a078598556d1b326a0e2a8cd33df08e90008 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:52,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:52,521 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:52,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:52,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:52,549 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:52,549 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:52,550 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:52,550 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:52,550 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:52,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:52,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:52,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:52,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:52,551 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:52,552 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:52,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:52,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:52,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:52,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:52,553 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1cec523a42b4b57f00a275aac533a078598556d1b326a0e2a8cd33df08e90008 [2025-04-29 11:00:52,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:52,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:52,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:52,779 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:52,779 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:52,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.c [2025-04-29 11:00:54,153 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599cb1242/d1a3282c45904f90a1c39dbed7061d17/FLAG4b3b44bae [2025-04-29 11:00:54,327 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:54,328 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_02-idx_nr.c [2025-04-29 11:00:54,329 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:54,340 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599cb1242/d1a3282c45904f90a1c39dbed7061d17/FLAG4b3b44bae [2025-04-29 11:00:55,303 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/599cb1242/d1a3282c45904f90a1c39dbed7061d17 [2025-04-29 11:00:55,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:55,306 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:55,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:55,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:55,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:55,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67f45f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55, skipping insertion in model container [2025-04-29 11:00:55,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:55,480 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:55,488 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:55,507 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:55,521 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:55,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55 WrapperNode [2025-04-29 11:00:55,522 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:55,523 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:55,523 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:55,523 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:55,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,533 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,548 INFO L138 Inliner]: procedures = 11, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2025-04-29 11:00:55,550 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:55,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:55,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:55,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:55,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,568 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [10]. The 0 writes are split as follows [0]. [2025-04-29 11:00:55,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,575 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,576 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,580 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:55,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:55,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:55,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:55,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (1/1) ... [2025-04-29 11:00:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:55,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:55,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:00:55,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:00:55,640 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:00:55,640 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:00:55,641 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:00:55,703 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:55,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:55,852 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:00:55,852 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:55,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:55,949 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:55,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55 BoogieIcfgContainer [2025-04-29 11:00:55,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:55,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:55,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:55,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:55,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:55" (1/3) ... [2025-04-29 11:00:55,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfdab2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:55, skipping insertion in model container [2025-04-29 11:00:55,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:55" (2/3) ... [2025-04-29 11:00:55,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfdab2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:55, skipping insertion in model container [2025-04-29 11:00:55,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55" (3/3) ... [2025-04-29 11:00:55,963 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_02-idx_nr.c [2025-04-29 11:00:55,974 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:55,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_02-idx_nr.c that has 2 procedures, 27 locations, 26 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-29 11:00:55,976 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:00:56,012 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:00:56,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-04-29 11:00:56,063 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-29 11:00:56,067 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:56,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-04-29 11:00:56,069 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-04-29 11:00:56,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-04-29 11:00:56,081 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:56,092 INFO L340 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;@76510090, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:56,092 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:00:56,099 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:00:56,099 INFO L116 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-04-29 11:00:56,099 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:56,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:00:56,100 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:56,108 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,108 INFO L85 PathProgramCache]: Analyzing trace with hash 173611, now seen corresponding path program 1 times [2025-04-29 11:00:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,114 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851037245] [2025-04-29 11:00:56,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:00:56,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:00:56,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851037245] [2025-04-29 11:00:56,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851037245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:56,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214932394] [2025-04-29 11:00:56,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,297 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:56,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:56,340 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:56,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04-29 11:00:56,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:56,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,424 INFO L116 PetriNetUnfolderBase]: 31/104 cut-off events. [2025-04-29 11:00:56,425 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 104 events. 31/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 343 event pairs, 30 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 164. Up to 79 conditions per place. [2025-04-29 11:00:56,426 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 17 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-29 11:00:56,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 99 flow [2025-04-29 11:00:56,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:00:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-29 11:00:56,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5462962962962963 [2025-04-29 11:00:56,436 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 55 flow. Second operand 4 states and 59 transitions. [2025-04-29 11:00:56,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 99 flow [2025-04-29 11:00:56,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 98 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:56,445 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-04-29 11:00:56,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-04-29 11:00:56,450 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-04-29 11:00:56,451 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-04-29 11:00:56,451 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04-29 11:00:56,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,451 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-29 11:00:56,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:56,452 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:56,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,453 INFO L85 PathProgramCache]: Analyzing trace with hash 877253538, now seen corresponding path program 1 times [2025-04-29 11:00:56,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831034671] [2025-04-29 11:00:56,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:56,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:56,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831034671] [2025-04-29 11:00:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831034671] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:56,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831127375] [2025-04-29 11:00:56,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:56,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:56,579 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:56,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:00:56,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:56,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:56,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:00:56,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:56,647 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:00:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831127375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:00:56,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 11:00:56,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697970123] [2025-04-29 11:00:56,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,648 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:56,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:56,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:00:56,658 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:56,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-04-29 11:00:56,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:56,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:56,739 INFO L116 PetriNetUnfolderBase]: 31/103 cut-off events. [2025-04-29 11:00:56,739 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:00:56,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 103 events. 31/103 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 338 event pairs, 30 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 181. Up to 74 conditions per place. [2025-04-29 11:00:56,740 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 13 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-04-29 11:00:56,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 112 flow [2025-04-29 11:00:56,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:00:56,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2025-04-29 11:00:56,741 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-04-29 11:00:56,741 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 78 flow. Second operand 6 states and 74 transitions. [2025-04-29 11:00:56,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 112 flow [2025-04-29 11:00:56,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:56,742 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-04-29 11:00:56,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-04-29 11:00:56,743 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-04-29 11:00:56,743 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-04-29 11:00:56,743 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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-04-29 11:00:56,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:56,743 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-29 11:00:56,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:00:56,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:56,944 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:56,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1425056079, now seen corresponding path program 1 times [2025-04-29 11:00:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:56,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788310243] [2025-04-29 11:00:56,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:56,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:56,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:56,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:56,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:00:56,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:56,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788310243] [2025-04-29 11:00:56,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788310243] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:56,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:56,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:56,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582828383] [2025-04-29 11:00:56,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:56,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:56,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:56,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:56,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:56,978 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:56,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04-29 11:00:56,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:56,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:56,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,025 INFO L116 PetriNetUnfolderBase]: 31/102 cut-off events. [2025-04-29 11:00:57,025 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-29 11:00:57,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 102 events. 31/102 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 339 event pairs, 30 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 177. Up to 77 conditions per place. [2025-04-29 11:00:57,026 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 14 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-04-29 11:00:57,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 116 flow [2025-04-29 11:00:57,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:00:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-04-29 11:00:57,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5432098765432098 [2025-04-29 11:00:57,027 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 3 states and 44 transitions. [2025-04-29 11:00:57,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 116 flow [2025-04-29 11:00:57,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 94 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-29 11:00:57,028 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-04-29 11:00:57,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-04-29 11:00:57,029 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-29 11:00:57,029 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-04-29 11:00:57,029 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-04-29 11:00:57,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:57,029 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:57,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1910358368, now seen corresponding path program 1 times [2025-04-29 11:00:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396940452] [2025-04-29 11:00:57,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:57,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:57,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396940452] [2025-04-29 11:00:57,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396940452] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:57,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17548090] [2025-04-29 11:00:57,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:57,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:57,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:57,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:00:57,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:00:57,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:00:57,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:00:57,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:57,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17548090] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:57,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:57,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:00:57,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150313605] [2025-04-29 11:00:57,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:00:57,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:00:57,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:00:57,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:57,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-04-29 11:00:57,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:57,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,322 INFO L116 PetriNetUnfolderBase]: 31/106 cut-off events. [2025-04-29 11:00:57,323 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-29 11:00:57,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 106 events. 31/106 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 336 event pairs, 30 based on Foata normal form. 2/100 useless extension candidates. Maximal degree in co-relation 170. Up to 75 conditions per place. [2025-04-29 11:00:57,326 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 14 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-04-29 11:00:57,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 123 flow [2025-04-29 11:00:57,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:57,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 86 transitions. [2025-04-29 11:00:57,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.455026455026455 [2025-04-29 11:00:57,327 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 7 states and 86 transitions. [2025-04-29 11:00:57,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 123 flow [2025-04-29 11:00:57,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:57,328 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-04-29 11:00:57,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-04-29 11:00:57,329 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-04-29 11:00:57,329 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-04-29 11:00:57,329 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 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-04-29 11:00:57,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,329 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:00:57,535 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:00:57,535 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:57,536 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1540116992, now seen corresponding path program 2 times [2025-04-29 11:00:57,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491327598] [2025-04-29 11:00:57,536 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:57,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-29 11:00:57,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-04-29 11:00:57,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:57,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:00:57,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491327598] [2025-04-29 11:00:57,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491327598] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150528600] [2025-04-29 11:00:57,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:57,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:57,584 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:57,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04-29 11:00:57,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:57,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,650 INFO L116 PetriNetUnfolderBase]: 37/113 cut-off events. [2025-04-29 11:00:57,650 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:00:57,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 113 events. 37/113 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 334 event pairs, 15 based on Foata normal form. 7/115 useless extension candidates. Maximal degree in co-relation 194. Up to 67 conditions per place. [2025-04-29 11:00:57,650 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 27 selfloop transitions, 4 changer transitions 6/43 dead transitions. [2025-04-29 11:00:57,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 43 transitions, 194 flow [2025-04-29 11:00:57,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2025-04-29 11:00:57,651 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-04-29 11:00:57,651 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 92 flow. Second operand 5 states and 81 transitions. [2025-04-29 11:00:57,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 43 transitions, 194 flow [2025-04-29 11:00:57,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 43 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:57,653 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 113 flow [2025-04-29 11:00:57,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2025-04-29 11:00:57,653 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2025-04-29 11:00:57,653 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 113 flow [2025-04-29 11:00:57,653 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-04-29 11:00:57,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,654 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:57,654 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:57,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1539836715, now seen corresponding path program 1 times [2025-04-29 11:00:57,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422662450] [2025-04-29 11:00:57,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:00:57,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:00:57,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:00:57,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,714 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422662450] [2025-04-29 11:00:57,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422662450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935044152] [2025-04-29 11:00:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,714 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:57,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:57,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:57,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04-29 11:00:57,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:57,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,783 INFO L116 PetriNetUnfolderBase]: 24/96 cut-off events. [2025-04-29 11:00:57,783 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-29 11:00:57,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 96 events. 24/96 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 291 event pairs, 12 based on Foata normal form. 12/108 useless extension candidates. Maximal degree in co-relation 204. Up to 45 conditions per place. [2025-04-29 11:00:57,784 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 25 selfloop transitions, 4 changer transitions 4/39 dead transitions. [2025-04-29 11:00:57,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 39 transitions, 204 flow [2025-04-29 11:00:57,786 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2025-04-29 11:00:57,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5703703703703704 [2025-04-29 11:00:57,788 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 113 flow. Second operand 5 states and 77 transitions. [2025-04-29 11:00:57,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 39 transitions, 204 flow [2025-04-29 11:00:57,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 196 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:57,790 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 131 flow [2025-04-29 11:00:57,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2025-04-29 11:00:57,790 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 17 predicate places. [2025-04-29 11:00:57,790 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 131 flow [2025-04-29 11:00:57,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-04-29 11:00:57,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,792 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:57,792 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:57,792 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1139672850, now seen corresponding path program 1 times [2025-04-29 11:00:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780160763] [2025-04-29 11:00:57,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:00:57,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:00:57,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:00:57,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:57,888 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780160763] [2025-04-29 11:00:57,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780160763] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:57,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:57,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:57,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874355837] [2025-04-29 11:00:57,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:57,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:00:57,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:57,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:00:57,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:00:57,889 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 27 [2025-04-29 11:00:57,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-04-29 11:00:57,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:57,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 27 [2025-04-29 11:00:57,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:57,923 INFO L116 PetriNetUnfolderBase]: 10/62 cut-off events. [2025-04-29 11:00:57,924 INFO L117 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-04-29 11:00:57,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 62 events. 10/62 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 130 event pairs, 2 based on Foata normal form. 6/68 useless extension candidates. Maximal degree in co-relation 142. Up to 24 conditions per place. [2025-04-29 11:00:57,924 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 22 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-29 11:00:57,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 189 flow [2025-04-29 11:00:57,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:00:57,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:00:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2025-04-29 11:00:57,925 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-04-29 11:00:57,926 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 131 flow. Second operand 3 states and 54 transitions. [2025-04-29 11:00:57,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 189 flow [2025-04-29 11:00:57,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 182 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:57,927 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 132 flow [2025-04-29 11:00:57,928 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2025-04-29 11:00:57,928 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2025-04-29 11:00:57,928 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 132 flow [2025-04-29 11:00:57,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-04-29 11:00:57,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:57,929 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:57,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:00:57,929 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:57,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:57,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1565424559, now seen corresponding path program 1 times [2025-04-29 11:00:57,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:57,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576722269] [2025-04-29 11:00:57,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:57,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:57,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:00:57,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:00:57,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:57,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:58,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:58,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576722269] [2025-04-29 11:00:58,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576722269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:58,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471652648] [2025-04-29 11:00:58,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:58,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:58,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:58,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:00:58,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:00:58,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:00:58,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:58,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:58,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:00:58,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:58,113 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471652648] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:58,189 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-29 11:00:58,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417158751] [2025-04-29 11:00:58,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:58,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:00:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:58,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:00:58,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:00:58,205 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:58,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 132 flow. Second operand has 18 states, 18 states have (on average 10.5) internal successors, (189), 18 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:58,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:58,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:58,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:58,347 INFO L116 PetriNetUnfolderBase]: 10/74 cut-off events. [2025-04-29 11:00:58,347 INFO L117 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-04-29 11:00:58,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 74 events. 10/74 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 128 event pairs, 9 based on Foata normal form. 4/78 useless extension candidates. Maximal degree in co-relation 145. Up to 37 conditions per place. [2025-04-29 11:00:58,350 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/39 dead transitions. [2025-04-29 11:00:58,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 39 transitions, 242 flow [2025-04-29 11:00:58,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:00:58,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:00:58,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 168 transitions. [2025-04-29 11:00:58,360 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4148148148148148 [2025-04-29 11:00:58,360 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 132 flow. Second operand 15 states and 168 transitions. [2025-04-29 11:00:58,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 39 transitions, 242 flow [2025-04-29 11:00:58,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 39 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:58,362 INFO L231 Difference]: Finished difference. Result has 62 places, 39 transitions, 225 flow [2025-04-29 11:00:58,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=225, PETRI_PLACES=62, PETRI_TRANSITIONS=39} [2025-04-29 11:00:58,364 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-04-29 11:00:58,364 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 39 transitions, 225 flow [2025-04-29 11:00:58,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 10.5) internal successors, (189), 18 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:00:58,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:58,364 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:58,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:00:58,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:58,565 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:58,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:58,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2130482057, now seen corresponding path program 2 times [2025-04-29 11:00:58,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:58,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217772850] [2025-04-29 11:00:58,566 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:58,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:58,575 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-04-29 11:00:58,580 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 34 statements. [2025-04-29 11:00:58,580 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:58,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:00:58,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:58,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217772850] [2025-04-29 11:00:58,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217772850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:58,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:58,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333911715] [2025-04-29 11:00:58,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:58,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:58,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:58,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:58,648 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-29 11:00:58,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 39 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:58,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:58,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-29 11:00:58,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:58,707 INFO L116 PetriNetUnfolderBase]: 13/75 cut-off events. [2025-04-29 11:00:58,707 INFO L117 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-04-29 11:00:58,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 75 events. 13/75 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 6 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 164. Up to 24 conditions per place. [2025-04-29 11:00:58,708 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 34 selfloop transitions, 5 changer transitions 0/43 dead transitions. [2025-04-29 11:00:58,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 43 transitions, 311 flow [2025-04-29 11:00:58,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:58,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:00:58,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-29 11:00:58,708 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-29 11:00:58,708 INFO L175 Difference]: Start difference. First operand has 62 places, 39 transitions, 225 flow. Second operand 6 states and 69 transitions. [2025-04-29 11:00:58,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 43 transitions, 311 flow [2025-04-29 11:00:58,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 43 transitions, 301 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:00:58,712 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 221 flow [2025-04-29 11:00:58,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=221, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2025-04-29 11:00:58,714 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-04-29 11:00:58,715 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 221 flow [2025-04-29 11:00:58,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:58,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:58,716 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:58,716 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:00:58,716 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:58,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:58,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1243540222, now seen corresponding path program 1 times [2025-04-29 11:00:58,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:58,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249960840] [2025-04-29 11:00:58,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:58,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:58,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:00:58,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:00:58,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:58,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:58,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249960840] [2025-04-29 11:00:58,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249960840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:00:58,943 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163815790] [2025-04-29 11:00:58,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:58,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:58,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:58,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:00:58,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:00:58,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:00:59,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:00:59,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:59,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:59,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:00:59,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:00:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:59,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:00:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163815790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:00:59,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:00:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-29 11:00:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867237902] [2025-04-29 11:00:59,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:00:59,248 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:00:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:59,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:00:59,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:00:59,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 27 [2025-04-29 11:00:59,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 221 flow. Second operand has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 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-04-29 11:00:59,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:59,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 27 [2025-04-29 11:00:59,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:59,398 INFO L116 PetriNetUnfolderBase]: 10/81 cut-off events. [2025-04-29 11:00:59,398 INFO L117 PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES. [2025-04-29 11:00:59,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 81 events. 10/81 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 114 event pairs, 9 based on Foata normal form. 3/84 useless extension candidates. Maximal degree in co-relation 202. Up to 37 conditions per place. [2025-04-29 11:00:59,399 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 21 changer transitions 0/44 dead transitions. [2025-04-29 11:00:59,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 44 transitions, 349 flow [2025-04-29 11:00:59,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:00:59,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:00:59,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 227 transitions. [2025-04-29 11:00:59,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.400352733686067 [2025-04-29 11:00:59,400 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 221 flow. Second operand 21 states and 227 transitions. [2025-04-29 11:00:59,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 44 transitions, 349 flow [2025-04-29 11:00:59,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 44 transitions, 337 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:00:59,402 INFO L231 Difference]: Finished difference. Result has 81 places, 44 transitions, 320 flow [2025-04-29 11:00:59,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=320, PETRI_PLACES=81, PETRI_TRANSITIONS=44} [2025-04-29 11:00:59,404 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 52 predicate places. [2025-04-29 11:00:59,404 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 44 transitions, 320 flow [2025-04-29 11:00:59,404 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.434782608695652) internal successors, (240), 23 states have internal predecessors, (240), 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-04-29 11:00:59,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:59,405 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:59,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:00:59,605 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:00:59,605 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:59,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:59,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1294761995, now seen corresponding path program 2 times [2025-04-29 11:00:59,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:59,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883698955] [2025-04-29 11:00:59,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:00:59,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:59,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-29 11:00:59,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 43 statements. [2025-04-29 11:00:59,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:00:59,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:59,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883698955] [2025-04-29 11:00:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883698955] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:59,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:59,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021031451] [2025-04-29 11:00:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:59,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:59,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:59,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-29 11:00:59,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 44 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:59,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:59,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-29 11:00:59,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:59,725 INFO L116 PetriNetUnfolderBase]: 12/81 cut-off events. [2025-04-29 11:00:59,726 INFO L117 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2025-04-29 11:00:59,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 81 events. 12/81 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 101 event pairs, 6 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 223. Up to 32 conditions per place. [2025-04-29 11:00:59,728 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 38 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2025-04-29 11:00:59,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 47 transitions, 412 flow [2025-04-29 11:00:59,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:00:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:00:59,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2025-04-29 11:00:59,730 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.41358024691358025 [2025-04-29 11:00:59,730 INFO L175 Difference]: Start difference. First operand has 81 places, 44 transitions, 320 flow. Second operand 6 states and 67 transitions. [2025-04-29 11:00:59,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 47 transitions, 412 flow [2025-04-29 11:00:59,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 47 transitions, 369 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-29 11:00:59,732 INFO L231 Difference]: Finished difference. Result has 72 places, 43 transitions, 283 flow [2025-04-29 11:00:59,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=72, PETRI_TRANSITIONS=43} [2025-04-29 11:00:59,734 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2025-04-29 11:00:59,734 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 43 transitions, 283 flow [2025-04-29 11:00:59,735 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:59,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:59,735 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:59,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:00:59,735 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:59,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:59,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1698254068, now seen corresponding path program 1 times [2025-04-29 11:00:59,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:59,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339535989] [2025-04-29 11:00:59,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:59,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:59,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:00:59,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:00:59,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:59,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:59,846 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:00:59,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:59,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339535989] [2025-04-29 11:00:59,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339535989] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:59,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:59,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:00:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85543012] [2025-04-29 11:00:59,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:59,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:00:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:00:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:00:59,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-29 11:00:59,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 43 transitions, 283 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:59,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:59,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-29 11:00:59,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:59,939 INFO L116 PetriNetUnfolderBase]: 11/78 cut-off events. [2025-04-29 11:00:59,940 INFO L117 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-04-29 11:00:59,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 78 events. 11/78 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 5 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 205. Up to 29 conditions per place. [2025-04-29 11:00:59,940 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 30 selfloop transitions, 3 changer transitions 10/47 dead transitions. [2025-04-29 11:00:59,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 47 transitions, 377 flow [2025-04-29 11:00:59,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:00:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:00:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2025-04-29 11:00:59,941 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3915343915343915 [2025-04-29 11:00:59,941 INFO L175 Difference]: Start difference. First operand has 72 places, 43 transitions, 283 flow. Second operand 7 states and 74 transitions. [2025-04-29 11:00:59,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 47 transitions, 377 flow [2025-04-29 11:00:59,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 47 transitions, 363 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-04-29 11:00:59,943 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 251 flow [2025-04-29 11:00:59,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=251, PETRI_PLACES=72, PETRI_TRANSITIONS=37} [2025-04-29 11:00:59,944 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2025-04-29 11:00:59,944 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 251 flow [2025-04-29 11:00:59,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:00:59,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:59,944 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:59,945 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:00:59,945 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:59,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 871320149, now seen corresponding path program 1 times [2025-04-29 11:00:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:59,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751655225] [2025-04-29 11:00:59,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:59,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:00:59,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:00:59,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:59,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:00,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:00,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751655225] [2025-04-29 11:01:00,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751655225] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:00,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:00,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:01:00,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520206985] [2025-04-29 11:01:00,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:00,049 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:01:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:00,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:01:00,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:01:00,060 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 27 [2025-04-29 11:01:00,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 37 transitions, 251 flow. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:01:00,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:00,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 27 [2025-04-29 11:01:00,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:00,099 INFO L116 PetriNetUnfolderBase]: 4/53 cut-off events. [2025-04-29 11:01:00,099 INFO L117 PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES. [2025-04-29 11:01:00,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 53 events. 4/53 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 2 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 181. Up to 29 conditions per place. [2025-04-29 11:01:00,100 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 0 selfloop transitions, 0 changer transitions 38/38 dead transitions. [2025-04-29 11:01:00,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 38 transitions, 320 flow [2025-04-29 11:01:00,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-04-29 11:01:00,100 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35802469135802467 [2025-04-29 11:01:00,100 INFO L175 Difference]: Start difference. First operand has 72 places, 37 transitions, 251 flow. Second operand 6 states and 58 transitions. [2025-04-29 11:01:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 38 transitions, 320 flow [2025-04-29 11:01:00,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 38 transitions, 308 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:00,102 INFO L231 Difference]: Finished difference. Result has 61 places, 0 transitions, 0 flow [2025-04-29 11:01:00,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=61, PETRI_TRANSITIONS=0} [2025-04-29 11:01:00,102 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2025-04-29 11:01:00,102 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 0 transitions, 0 flow [2025-04-29 11:01:00,102 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-04-29 11:01:00,104 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 9 remaining) [2025-04-29 11:01:00,104 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-04-29 11:01:00,104 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-04-29 11:01:00,105 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-04-29 11:01:00,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:01:00,105 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:00,108 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:01:00,108 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:01:00,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:01:00 BasicIcfg [2025-04-29 11:01:00,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:01:00,113 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:01:00,113 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:01:00,113 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:01:00,113 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:55" (3/4) ... [2025-04-29 11:01:00,114 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:01:00,116 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:01:00,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2025-04-29 11:01:00,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-29 11:01:00,119 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:01:00,175 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:01:00,176 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:01:00,176 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:01:00,176 INFO L158 Benchmark]: Toolchain (without parser) took 4870.09ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 68.5MB in the end (delta: 42.7MB). Peak memory consumption was 45.2MB. Max. memory is 16.1GB. [2025-04-29 11:01:00,176 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.50ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.66ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: RCFGBuilder took 365.72ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 74.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: TraceAbstraction took 4157.82ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 74.1MB in the end (delta: -808.8kB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. [2025-04-29 11:01:00,177 INFO L158 Benchmark]: Witness Printer took 63.23ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:01:00,179 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.17ms. Allocated memory is still 201.3MB. Free memory is still 131.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.50ms. Allocated memory is still 142.6MB. Free memory was 111.2MB in the beginning and 97.1MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.66ms. Allocated memory is still 142.6MB. Free memory was 97.1MB in the beginning and 96.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.27ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 94.0MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.72ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 74.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4157.82ms. Allocated memory is still 142.6MB. Free memory was 73.3MB in the beginning and 74.1MB in the end (delta: -808.8kB). Peak memory consumption was 3.2MB. Max. memory is 16.1GB. * Witness Printer took 63.23ms. Allocated memory is still 142.6MB. Free memory was 72.7MB in the beginning and 68.5MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 21]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 15]: 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, 38 locations, 37 edges, 9 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.1s, OverallIterations: 13, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 205 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1024 IncrementalHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 22 mSDtfsCounter, 1024 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=320occurred in iteration=10, InterpolantAutomatonStates: 94, 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.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 372 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 1060 SizeOfPredicates, 13 NumberOfNonLiveVariables, 420 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 20 InterpolantComputations, 10 PerfectInterpolantSequences, 546/797 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 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:01:00,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE