./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i --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/06-symbeq_08-tricky_address3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:18:50,508 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:18:50,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:18:50,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:18:50,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:18:50,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:18:50,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:18:50,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:18:50,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:18:50,598 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:18:50,598 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:18:50,598 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:18:50,599 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:18:50,599 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:18:50,599 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:18:50,599 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:18:50,600 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:18:50,601 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:50,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:50,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:18:50,601 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:18:50,601 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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-04-30 10:18:50,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:18:50,825 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:18:50,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:18:50,829 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:18:50,830 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:18:50,831 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2025-04-30 10:18:52,040 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63d31f2d/a50148138e1c4154a223a81ba61652ac/FLAG6b8e4064c [2025-04-30 10:18:52,284 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:18:52,285 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.i [2025-04-30 10:18:52,295 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63d31f2d/a50148138e1c4154a223a81ba61652ac/FLAG6b8e4064c [2025-04-30 10:18:53,241 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f63d31f2d/a50148138e1c4154a223a81ba61652ac [2025-04-30 10:18:53,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:18:53,245 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:18:53,246 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:53,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:18:53,249 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:18:53,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30e3d992 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53, skipping insertion in model container [2025-04-30 10:18:53,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,280 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:18:53,538 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:53,565 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:18:53,607 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:18:53,659 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:18:53,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53 WrapperNode [2025-04-30 10:18:53,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:18:53,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:53,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:18:53,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:18:53,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,689 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,707 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 135 [2025-04-30 10:18:53,707 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:18:53,709 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:18:53,709 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:18:53,709 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:18:53,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,720 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,735 INFO L175 MemorySlicer]: Split 64 memory accesses to 1 slices as follows [64]. 100 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [60]. The 2 writes are split as follows [2]. [2025-04-30 10:18:53,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,744 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:18:53,753 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:18:53,753 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:18:53,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:18:53,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (1/1) ... [2025-04-30 10:18:53,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:18:53,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:53,776 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-30 10:18:53,779 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-30 10:18:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:18:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-30 10:18:53,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-30 10:18:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:18:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:18:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:18:53,796 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:18:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:18:53,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:18:53,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:18:53,797 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:18:53,902 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:18:53,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:18:54,144 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:18:54,145 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:18:54,453 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:18:54,456 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:18:54,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:54 BoogieIcfgContainer [2025-04-30 10:18:54,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:18:54,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:18:54,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:18:54,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:18:54,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:18:53" (1/3) ... [2025-04-30 10:18:54,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1333c3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:54, skipping insertion in model container [2025-04-30 10:18:54,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:18:53" (2/3) ... [2025-04-30 10:18:54,464 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1333c3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:18:54, skipping insertion in model container [2025-04-30 10:18:54,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:18:54" (3/3) ... [2025-04-30 10:18:54,465 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-04-30 10:18:54,474 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:18:54,475 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 31 locations, 30 edges, 1 initial locations, 1 loop locations, and 8 error locations. [2025-04-30 10:18:54,476 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:18:54,512 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:18:54,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 66 flow [2025-04-30 10:18:54,552 INFO L116 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-04-30 10:18:54,554 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-04-30 10:18:54,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 66 flow [2025-04-30 10:18:54,557 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 30 transitions, 63 flow [2025-04-30 10:18:54,562 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:18:54,572 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;@1051d11f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:18:54,573 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-30 10:18:54,576 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:18:54,576 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-30 10:18:54,576 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,577 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,577 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-30 10:18:54,577 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:54,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,581 INFO L85 PathProgramCache]: Analyzing trace with hash 348226, now seen corresponding path program 1 times [2025-04-30 10:18:54,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296818108] [2025-04-30 10:18:54,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:54,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-30 10:18:54,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-30 10:18:54,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:54,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:54,782 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-30 10:18:54,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:54,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296818108] [2025-04-30 10:18:54,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296818108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:54,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:54,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:54,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440621728] [2025-04-30 10:18:54,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:54,789 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:54,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:54,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:54,846 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:54,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-30 10:18:54,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:54,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:54,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:54,956 INFO L116 PetriNetUnfolderBase]: 43/147 cut-off events. [2025-04-30 10:18:54,959 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:18:54,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 147 events. 43/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 552 event pairs, 42 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 233. Up to 105 conditions per place. [2025-04-30 10:18:54,961 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 19 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-30 10:18:54,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 111 flow [2025-04-30 10:18:54,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:54,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-30 10:18:54,972 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-04-30 10:18:54,973 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 63 flow. Second operand 4 states and 69 transitions. [2025-04-30 10:18:54,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 111 flow [2025-04-30 10:18:54,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:54,980 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-04-30 10:18:54,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-30 10:18:54,985 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-04-30 10:18:54,985 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-04-30 10:18:54,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-30 10:18:54,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:54,986 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-30 10:18:54,986 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:18:54,986 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:54,987 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:54,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1784403829, now seen corresponding path program 1 times [2025-04-30 10:18:54,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:54,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040824086] [2025-04-30 10:18:54,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:54,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:55,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:55,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,172 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-30 10:18:55,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:55,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040824086] [2025-04-30 10:18:55,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040824086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:55,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164769134] [2025-04-30 10:18:55,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:55,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:55,175 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-30 10:18:55,177 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-30 10:18:55,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:18:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:18:55,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:18:55,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:55,289 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-30 10:18:55,290 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-30 10:18:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164769134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:55,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-30 10:18:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-30 10:18:55,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133399013] [2025-04-30 10:18:55,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:18:55,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:18:55,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:18:55,299 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:55,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 86 flow. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-30 10:18:55,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:55,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,414 INFO L116 PetriNetUnfolderBase]: 43/146 cut-off events. [2025-04-30 10:18:55,414 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:18:55,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 146 events. 43/146 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 547 event pairs, 42 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 250. Up to 100 conditions per place. [2025-04-30 10:18:55,417 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 15 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-04-30 10:18:55,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 124 flow [2025-04-30 10:18:55,418 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-30 10:18:55,418 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-04-30 10:18:55,418 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-04-30 10:18:55,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 124 flow [2025-04-30 10:18:55,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:18:55,419 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 92 flow [2025-04-30 10:18:55,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=92, PETRI_PLACES=40, PETRI_TRANSITIONS=31} [2025-04-30 10:18:55,420 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-04-30 10:18:55,420 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 92 flow [2025-04-30 10:18:55,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 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-30 10:18:55,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,420 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-30 10:18:55,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:18:55,621 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-30 10:18:55,621 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:55,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:55,621 INFO L85 PathProgramCache]: Analyzing trace with hash -518055809, now seen corresponding path program 1 times [2025-04-30 10:18:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:55,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553257699] [2025-04-30 10:18:55,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:18:55,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:18:55,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,665 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-30 10:18:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:55,665 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553257699] [2025-04-30 10:18:55,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553257699] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:18:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958902881] [2025-04-30 10:18:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:18:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:18:55,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:18:55,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:55,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:55,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:55,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:55,732 INFO L116 PetriNetUnfolderBase]: 43/145 cut-off events. [2025-04-30 10:18:55,732 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-30 10:18:55,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 145 events. 43/145 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 545 event pairs, 42 based on Foata normal form. 1/130 useless extension candidates. Maximal degree in co-relation 246. Up to 103 conditions per place. [2025-04-30 10:18:55,734 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-04-30 10:18:55,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 128 flow [2025-04-30 10:18:55,734 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:18:55,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:18:55,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-04-30 10:18:55,736 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-04-30 10:18:55,736 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 92 flow. Second operand 3 states and 52 transitions. [2025-04-30 10:18:55,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 128 flow [2025-04-30 10:18:55,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 106 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-30 10:18:55,738 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 74 flow [2025-04-30 10:18:55,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-04-30 10:18:55,739 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-04-30 10:18:55,740 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 74 flow [2025-04-30 10:18:55,740 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:18:55,740 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:55,740 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:55,740 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:18:55,740 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:55,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1526150787, now seen corresponding path program 1 times [2025-04-30 10:18:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:55,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871997205] [2025-04-30 10:18:55,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:55,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:55,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,834 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-30 10:18:55,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:55,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871997205] [2025-04-30 10:18:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871997205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:55,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575869509] [2025-04-30 10:18:55,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:55,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:55,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:55,836 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-30 10:18:55,838 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-30 10:18:55,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:18:55,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:18:55,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:55,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:55,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:18:55,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:55,938 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-30 10:18:55,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:55,962 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-30 10:18:55,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575869509] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:55,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:55,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-30 10:18:55,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257400520] [2025-04-30 10:18:55,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:55,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:18:55,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:55,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:18:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:18:55,975 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:55,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 74 flow. Second operand has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-30 10:18:55,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:55,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:55,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:56,059 INFO L116 PetriNetUnfolderBase]: 43/149 cut-off events. [2025-04-30 10:18:56,059 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-30 10:18:56,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 149 events. 43/149 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 540 event pairs, 42 based on Foata normal form. 2/136 useless extension candidates. Maximal degree in co-relation 239. Up to 101 conditions per place. [2025-04-30 10:18:56,060 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 16 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2025-04-30 10:18:56,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 135 flow [2025-04-30 10:18:56,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:18:56,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:18:56,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-04-30 10:18:56,061 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2025-04-30 10:18:56,061 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 74 flow. Second operand 7 states and 102 transitions. [2025-04-30 10:18:56,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 135 flow [2025-04-30 10:18:56,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:56,062 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 100 flow [2025-04-30 10:18:56,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=100, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2025-04-30 10:18:56,063 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-04-30 10:18:56,063 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 100 flow [2025-04-30 10:18:56,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.5) internal successors, (125), 10 states have internal predecessors, (125), 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-30 10:18:56,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:56,063 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:56,069 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-30 10:18:56,263 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-30 10:18:56,264 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:56,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1188972963, now seen corresponding path program 2 times [2025-04-30 10:18:56,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:56,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525666863] [2025-04-30 10:18:56,267 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:56,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:56,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-30 10:18:56,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-04-30 10:18:56,303 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:56,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:56,995 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-30 10:18:56,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:56,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525666863] [2025-04-30 10:18:56,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525666863] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:56,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:56,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171553974] [2025-04-30 10:18:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:56,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:56,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:56,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:56,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:57,007 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:57,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-30 10:18:57,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:57,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,201 INFO L116 PetriNetUnfolderBase]: 49/151 cut-off events. [2025-04-30 10:18:57,201 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:18:57,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 151 events. 49/151 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 499 event pairs, 20 based on Foata normal form. 8/150 useless extension candidates. Maximal degree in co-relation 258. Up to 79 conditions per place. [2025-04-30 10:18:57,202 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 5 changer transitions 6/50 dead transitions. [2025-04-30 10:18:57,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 218 flow [2025-04-30 10:18:57,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-04-30 10:18:57,204 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-04-30 10:18:57,204 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 100 flow. Second operand 6 states and 107 transitions. [2025-04-30 10:18:57,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 218 flow [2025-04-30 10:18:57,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:57,205 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 123 flow [2025-04-30 10:18:57,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2025-04-30 10:18:57,206 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2025-04-30 10:18:57,206 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 123 flow [2025-04-30 10:18:57,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-30 10:18:57,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,206 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:18:57,206 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:57,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1188644459, now seen corresponding path program 1 times [2025-04-30 10:18:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652393200] [2025-04-30 10:18:57,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-30 10:18:57,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-30 10:18:57,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,260 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-30 10:18:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,260 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652393200] [2025-04-30 10:18:57,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652393200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:57,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:57,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:57,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028704470] [2025-04-30 10:18:57,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:57,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:57,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:57,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:57,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-30 10:18:57,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:57,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,340 INFO L116 PetriNetUnfolderBase]: 39/142 cut-off events. [2025-04-30 10:18:57,340 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-30 10:18:57,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 142 events. 39/142 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 531 event pairs, 2 based on Foata normal form. 7/135 useless extension candidates. Maximal degree in co-relation 288. Up to 59 conditions per place. [2025-04-30 10:18:57,342 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 34 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-04-30 10:18:57,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 233 flow [2025-04-30 10:18:57,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:57,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-30 10:18:57,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-04-30 10:18:57,344 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 123 flow. Second operand 4 states and 76 transitions. [2025-04-30 10:18:57,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 233 flow [2025-04-30 10:18:57,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 222 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-30 10:18:57,345 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 118 flow [2025-04-30 10:18:57,346 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2025-04-30 10:18:57,346 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2025-04-30 10:18:57,346 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 118 flow [2025-04-30 10:18:57,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-30 10:18:57,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,346 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:18:57,346 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:57,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1806727801, now seen corresponding path program 1 times [2025-04-30 10:18:57,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,347 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829585870] [2025-04-30 10:18:57,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:18:57,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:18:57,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,405 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-30 10:18:57,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829585870] [2025-04-30 10:18:57,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829585870] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:57,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:57,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:57,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740231246] [2025-04-30 10:18:57,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:18:57,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:18:57,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:18:57,410 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:57,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-30 10:18:57,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:57,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,464 INFO L116 PetriNetUnfolderBase]: 33/118 cut-off events. [2025-04-30 10:18:57,465 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-30 10:18:57,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 118 events. 33/118 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 357 event pairs, 14 based on Foata normal form. 7/121 useless extension candidates. Maximal degree in co-relation 240. Up to 50 conditions per place. [2025-04-30 10:18:57,466 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-04-30 10:18:57,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 224 flow [2025-04-30 10:18:57,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:18:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-30 10:18:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-30 10:18:57,467 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2025-04-30 10:18:57,467 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 118 flow. Second operand 4 states and 75 transitions. [2025-04-30 10:18:57,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 224 flow [2025-04-30 10:18:57,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:18:57,468 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 116 flow [2025-04-30 10:18:57,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-04-30 10:18:57,469 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-04-30 10:18:57,469 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 116 flow [2025-04-30 10:18:57,469 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-30 10:18:57,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,469 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,469 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:18:57,469 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:57,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:57,470 INFO L85 PathProgramCache]: Analyzing trace with hash 173987351, now seen corresponding path program 1 times [2025-04-30 10:18:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:57,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19469450] [2025-04-30 10:18:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:57,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:18:57,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:18:57,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,564 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-30 10:18:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:57,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19469450] [2025-04-30 10:18:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19469450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:57,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54674996] [2025-04-30 10:18:57,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:57,567 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-30 10:18:57,569 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-30 10:18:57,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-30 10:18:57,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-30 10:18:57,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:57,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:57,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-30 10:18:57,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:57,658 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-30 10:18:57,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:57,729 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-30 10:18:57,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54674996] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:57,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:57,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-30 10:18:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904835526] [2025-04-30 10:18:57,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:57,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-30 10:18:57,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:57,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-30 10:18:57,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-30 10:18:57,749 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:57,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 116 flow. Second operand has 18 states, 18 states have (on average 12.333333333333334) internal successors, (222), 18 states have internal predecessors, (222), 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-30 10:18:57,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:57,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:57,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:57,883 INFO L116 PetriNetUnfolderBase]: 33/135 cut-off events. [2025-04-30 10:18:57,883 INFO L117 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-04-30 10:18:57,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 135 events. 33/135 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 394 event pairs, 32 based on Foata normal form. 4/133 useless extension candidates. Maximal degree in co-relation 245. Up to 82 conditions per place. [2025-04-30 10:18:57,884 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 17 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-04-30 10:18:57,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 228 flow [2025-04-30 10:18:57,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-30 10:18:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-30 10:18:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2025-04-30 10:18:57,896 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-04-30 10:18:57,896 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 116 flow. Second operand 15 states and 200 transitions. [2025-04-30 10:18:57,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 228 flow [2025-04-30 10:18:57,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 40 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:18:57,898 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 207 flow [2025-04-30 10:18:57,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=207, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2025-04-30 10:18:57,899 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2025-04-30 10:18:57,899 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 207 flow [2025-04-30 10:18:57,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 12.333333333333334) internal successors, (222), 18 states have internal predecessors, (222), 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-30 10:18:57,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:57,899 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:57,906 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-30 10:18:58,100 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-30 10:18:58,100 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:58,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1219872727, now seen corresponding path program 2 times [2025-04-30 10:18:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:58,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632443224] [2025-04-30 10:18:58,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:58,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-30 10:18:58,136 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 30 statements. [2025-04-30 10:18:58,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:58,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,446 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-30 10:18:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:58,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632443224] [2025-04-30 10:18:58,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632443224] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:18:58,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:18:58,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:18:58,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794655549] [2025-04-30 10:18:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:18:58,447 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:18:58,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:58,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:18:58,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:18:58,453 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:58,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-30 10:18:58,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:58,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:58,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:58,577 INFO L116 PetriNetUnfolderBase]: 36/136 cut-off events. [2025-04-30 10:18:58,577 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-30 10:18:58,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 136 events. 36/136 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 383 event pairs, 8 based on Foata normal form. 14/150 useless extension candidates. Maximal degree in co-relation 241. Up to 57 conditions per place. [2025-04-30 10:18:58,578 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 4/56 dead transitions. [2025-04-30 10:18:58,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 351 flow [2025-04-30 10:18:58,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:18:58,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:18:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-04-30 10:18:58,579 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-04-30 10:18:58,579 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 207 flow. Second operand 6 states and 107 transitions. [2025-04-30 10:18:58,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 351 flow [2025-04-30 10:18:58,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 341 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-30 10:18:58,581 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 237 flow [2025-04-30 10:18:58,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=237, PETRI_PLACES=64, PETRI_TRANSITIONS=43} [2025-04-30 10:18:58,582 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2025-04-30 10:18:58,582 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 237 flow [2025-04-30 10:18:58,582 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 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-30 10:18:58,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:58,582 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:58,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:18:58,582 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:58,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:58,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1908998265, now seen corresponding path program 1 times [2025-04-30 10:18:58,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:58,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418061196] [2025-04-30 10:18:58,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:58,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:58,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:18:58,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:18:58,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:58,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,798 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-30 10:18:58,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:18:58,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418061196] [2025-04-30 10:18:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418061196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:18:58,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134315325] [2025-04-30 10:18:58,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:18:58,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:18:58,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:18:58,801 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-30 10:18:58,802 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-30 10:18:58,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-30 10:18:58,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-30 10:18:58,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:18:58,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:18:58,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-30 10:18:58,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:18:58,912 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-30 10:18:58,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:18:59,056 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-30 10:18:59,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134315325] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:18:59,057 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:18:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-30 10:18:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193968852] [2025-04-30 10:18:59,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:18:59,057 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-30 10:18:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:18:59,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-30 10:18:59,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-30 10:18:59,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:18:59,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 43 transitions, 237 flow. Second operand has 23 states, 23 states have (on average 12.478260869565217) internal successors, (287), 23 states have internal predecessors, (287), 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-30 10:18:59,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:18:59,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:18:59,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:18:59,222 INFO L116 PetriNetUnfolderBase]: 32/135 cut-off events. [2025-04-30 10:18:59,222 INFO L117 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-04-30 10:18:59,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 135 events. 32/135 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 331 event pairs, 28 based on Foata normal form. 3/137 useless extension candidates. Maximal degree in co-relation 370. Up to 81 conditions per place. [2025-04-30 10:18:59,223 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 20 selfloop transitions, 21 changer transitions 0/49 dead transitions. [2025-04-30 10:18:59,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 49 transitions, 373 flow [2025-04-30 10:18:59,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-30 10:18:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-30 10:18:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2025-04-30 10:18:59,224 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4162826420890937 [2025-04-30 10:18:59,224 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 237 flow. Second operand 21 states and 271 transitions. [2025-04-30 10:18:59,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 49 transitions, 373 flow [2025-04-30 10:18:59,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 49 transitions, 365 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-30 10:18:59,226 INFO L231 Difference]: Finished difference. Result has 84 places, 49 transitions, 340 flow [2025-04-30 10:18:59,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=340, PETRI_PLACES=84, PETRI_TRANSITIONS=49} [2025-04-30 10:18:59,227 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-04-30 10:18:59,227 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 49 transitions, 340 flow [2025-04-30 10:18:59,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 12.478260869565217) internal successors, (287), 23 states have internal predecessors, (287), 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-30 10:18:59,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:18:59,227 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:18:59,233 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-30 10:18:59,427 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-30 10:18:59,428 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:18:59,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:18:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash -221561762, now seen corresponding path program 2 times [2025-04-30 10:18:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:18:59,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397809160] [2025-04-30 10:18:59,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:18:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:18:59,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:18:59,476 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-30 10:18:59,477 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:18:59,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:03,864 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-30 10:19:03,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:03,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397809160] [2025-04-30 10:19:03,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397809160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:03,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:03,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:03,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534289227] [2025-04-30 10:19:03,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:03,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:03,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:03,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:03,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:03,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:03,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 49 transitions, 340 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:03,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:03,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:03,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:05,119 INFO L116 PetriNetUnfolderBase]: 70/209 cut-off events. [2025-04-30 10:19:05,119 INFO L117 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-04-30 10:19:05,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 209 events. 70/209 cut-off events. For 239/239 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 675 event pairs, 12 based on Foata normal form. 3/212 useless extension candidates. Maximal degree in co-relation 457. Up to 44 conditions per place. [2025-04-30 10:19:05,122 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 65 selfloop transitions, 17 changer transitions 3/87 dead transitions. [2025-04-30 10:19:05,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 626 flow [2025-04-30 10:19:05,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:19:05,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:19:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2025-04-30 10:19:05,123 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2025-04-30 10:19:05,123 INFO L175 Difference]: Start difference. First operand has 84 places, 49 transitions, 340 flow. Second operand 11 states and 144 transitions. [2025-04-30 10:19:05,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 626 flow [2025-04-30 10:19:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 583 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-30 10:19:05,127 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 410 flow [2025-04-30 10:19:05,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=410, PETRI_PLACES=87, PETRI_TRANSITIONS=60} [2025-04-30 10:19:05,128 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2025-04-30 10:19:05,129 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 410 flow [2025-04-30 10:19:05,129 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:05,129 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:05,129 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:05,129 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:19:05,129 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:05,130 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:05,130 INFO L85 PathProgramCache]: Analyzing trace with hash 652531852, now seen corresponding path program 3 times [2025-04-30 10:19:05,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:05,130 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326572999] [2025-04-30 10:19:05,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:05,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-04-30 10:19:05,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-30 10:19:05,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:05,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:07,728 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-30 10:19:07,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:07,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326572999] [2025-04-30 10:19:07,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326572999] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:07,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:07,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:19:07,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292772198] [2025-04-30 10:19:07,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:07,731 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:19:07,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:07,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:19:07,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:19:07,765 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:07,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 60 transitions, 410 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:07,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:07,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:07,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:08,832 INFO L116 PetriNetUnfolderBase]: 80/247 cut-off events. [2025-04-30 10:19:08,832 INFO L117 PetriNetUnfolderBase]: For 409/411 co-relation queries the response was YES. [2025-04-30 10:19:08,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 247 events. 80/247 cut-off events. For 409/411 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 905 event pairs, 22 based on Foata normal form. 5/252 useless extension candidates. Maximal degree in co-relation 743. Up to 65 conditions per place. [2025-04-30 10:19:08,833 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 27 changer transitions 7/102 dead transitions. [2025-04-30 10:19:08,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 816 flow [2025-04-30 10:19:08,834 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:19:08,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:19:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 190 transitions. [2025-04-30 10:19:08,835 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3605313092979127 [2025-04-30 10:19:08,835 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 410 flow. Second operand 17 states and 190 transitions. [2025-04-30 10:19:08,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 816 flow [2025-04-30 10:19:08,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 102 transitions, 786 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:08,838 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 563 flow [2025-04-30 10:19:08,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=563, PETRI_PLACES=104, PETRI_TRANSITIONS=73} [2025-04-30 10:19:08,838 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-04-30 10:19:08,838 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 563 flow [2025-04-30 10:19:08,838 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:08,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:08,838 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:08,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-30 10:19:08,839 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:08,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:08,839 INFO L85 PathProgramCache]: Analyzing trace with hash 220982179, now seen corresponding path program 1 times [2025-04-30 10:19:08,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:08,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432643656] [2025-04-30 10:19:08,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:08,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:08,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:19:08,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:08,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:08,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:10,847 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-30 10:19:10,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:10,847 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432643656] [2025-04-30 10:19:10,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432643656] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:10,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:10,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:10,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345328228] [2025-04-30 10:19:10,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:10,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:10,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:10,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:10,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:10,861 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:10,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 563 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:10,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:10,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:10,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:11,589 INFO L116 PetriNetUnfolderBase]: 83/261 cut-off events. [2025-04-30 10:19:11,589 INFO L117 PetriNetUnfolderBase]: For 526/530 co-relation queries the response was YES. [2025-04-30 10:19:11,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 261 events. 83/261 cut-off events. For 526/530 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1016 event pairs, 30 based on Foata normal form. 7/268 useless extension candidates. Maximal degree in co-relation 847. Up to 125 conditions per place. [2025-04-30 10:19:11,590 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 66 selfloop transitions, 32 changer transitions 5/105 dead transitions. [2025-04-30 10:19:11,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 105 transitions, 918 flow [2025-04-30 10:19:11,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-30 10:19:11,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-30 10:19:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 184 transitions. [2025-04-30 10:19:11,591 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3709677419354839 [2025-04-30 10:19:11,591 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 563 flow. Second operand 16 states and 184 transitions. [2025-04-30 10:19:11,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 105 transitions, 918 flow [2025-04-30 10:19:11,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 105 transitions, 844 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-04-30 10:19:11,595 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 669 flow [2025-04-30 10:19:11,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=505, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=669, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-04-30 10:19:11,596 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 83 predicate places. [2025-04-30 10:19:11,596 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 669 flow [2025-04-30 10:19:11,596 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:11,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:11,596 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:11,596 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-30 10:19:11,596 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:11,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:11,596 INFO L85 PathProgramCache]: Analyzing trace with hash 389309547, now seen corresponding path program 2 times [2025-04-30 10:19:11,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:11,596 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21931296] [2025-04-30 10:19:11,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:11,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:11,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:19:11,621 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-30 10:19:11,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:11,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:16,004 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-30 10:19:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:16,004 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21931296] [2025-04-30 10:19:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21931296] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:16,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:19:16,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230748614] [2025-04-30 10:19:16,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:16,005 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:19:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:16,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:19:16,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:19:16,067 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:16,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 669 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:16,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:16,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:16,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:17,627 INFO L116 PetriNetUnfolderBase]: 87/279 cut-off events. [2025-04-30 10:19:17,627 INFO L117 PetriNetUnfolderBase]: For 611/615 co-relation queries the response was YES. [2025-04-30 10:19:17,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 279 events. 87/279 cut-off events. For 611/615 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1153 event pairs, 35 based on Foata normal form. 4/283 useless extension candidates. Maximal degree in co-relation 939. Up to 133 conditions per place. [2025-04-30 10:19:17,629 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 66 selfloop transitions, 37 changer transitions 7/112 dead transitions. [2025-04-30 10:19:17,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 112 transitions, 1028 flow [2025-04-30 10:19:17,629 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-30 10:19:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-30 10:19:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 203 transitions. [2025-04-30 10:19:17,630 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34465195246179964 [2025-04-30 10:19:17,630 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 669 flow. Second operand 19 states and 203 transitions. [2025-04-30 10:19:17,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 112 transitions, 1028 flow [2025-04-30 10:19:17,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 112 transitions, 994 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:17,635 INFO L231 Difference]: Finished difference. Result has 135 places, 90 transitions, 794 flow [2025-04-30 10:19:17,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=794, PETRI_PLACES=135, PETRI_TRANSITIONS=90} [2025-04-30 10:19:17,637 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 102 predicate places. [2025-04-30 10:19:17,637 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 90 transitions, 794 flow [2025-04-30 10:19:17,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:17,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:17,638 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:17,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-30 10:19:17,638 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:17,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:17,639 INFO L85 PathProgramCache]: Analyzing trace with hash 390462747, now seen corresponding path program 3 times [2025-04-30 10:19:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:17,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129569000] [2025-04-30 10:19:17,639 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:17,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-04-30 10:19:17,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-30 10:19:17,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:17,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:21,687 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-30 10:19:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:21,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129569000] [2025-04-30 10:19:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129569000] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:19:21,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407662544] [2025-04-30 10:19:21,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:21,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:19:21,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:21,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:19:21,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:19:21,710 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:21,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 90 transitions, 794 flow. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:21,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:21,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:21,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:22,809 INFO L116 PetriNetUnfolderBase]: 89/289 cut-off events. [2025-04-30 10:19:22,809 INFO L117 PetriNetUnfolderBase]: For 845/850 co-relation queries the response was YES. [2025-04-30 10:19:22,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1142 conditions, 289 events. 89/289 cut-off events. For 845/850 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1230 event pairs, 30 based on Foata normal form. 5/294 useless extension candidates. Maximal degree in co-relation 1069. Up to 129 conditions per place. [2025-04-30 10:19:22,811 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 71 selfloop transitions, 44 changer transitions 0/117 dead transitions. [2025-04-30 10:19:22,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 117 transitions, 1148 flow [2025-04-30 10:19:22,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:19:22,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:19:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-04-30 10:19:22,813 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-04-30 10:19:22,813 INFO L175 Difference]: Start difference. First operand has 135 places, 90 transitions, 794 flow. Second operand 17 states and 189 transitions. [2025-04-30 10:19:22,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 117 transitions, 1148 flow [2025-04-30 10:19:22,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 117 transitions, 1104 flow, removed 7 selfloop flow, removed 7 redundant places. [2025-04-30 10:19:22,818 INFO L231 Difference]: Finished difference. Result has 145 places, 98 transitions, 925 flow [2025-04-30 10:19:22,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=925, PETRI_PLACES=145, PETRI_TRANSITIONS=98} [2025-04-30 10:19:22,819 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 112 predicate places. [2025-04-30 10:19:22,819 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 98 transitions, 925 flow [2025-04-30 10:19:22,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 11 states have internal predecessors, (92), 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-30 10:19:22,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:22,819 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:22,819 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-30 10:19:22,819 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:22,820 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:22,820 INFO L85 PathProgramCache]: Analyzing trace with hash 221410881, now seen corresponding path program 4 times [2025-04-30 10:19:22,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:22,820 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472358073] [2025-04-30 10:19:22,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:22,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:19:22,856 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:22,856 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:22,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:26,570 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-30 10:19:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:26,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472358073] [2025-04-30 10:19:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472358073] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:26,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:26,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:26,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997212176] [2025-04-30 10:19:26,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:26,571 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:26,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:26,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:26,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:26,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 98 transitions, 925 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:26,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:26,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:26,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:27,484 INFO L116 PetriNetUnfolderBase]: 90/297 cut-off events. [2025-04-30 10:19:27,485 INFO L117 PetriNetUnfolderBase]: For 1002/1006 co-relation queries the response was YES. [2025-04-30 10:19:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1265 conditions, 297 events. 90/297 cut-off events. For 1002/1006 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1295 event pairs, 40 based on Foata normal form. 7/304 useless extension candidates. Maximal degree in co-relation 1170. Up to 142 conditions per place. [2025-04-30 10:19:27,486 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 79 selfloop transitions, 39 changer transitions 0/120 dead transitions. [2025-04-30 10:19:27,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 120 transitions, 1281 flow [2025-04-30 10:19:27,487 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:19:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:19:27,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 163 transitions. [2025-04-30 10:19:27,487 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37557603686635943 [2025-04-30 10:19:27,487 INFO L175 Difference]: Start difference. First operand has 145 places, 98 transitions, 925 flow. Second operand 14 states and 163 transitions. [2025-04-30 10:19:27,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 120 transitions, 1281 flow [2025-04-30 10:19:27,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 120 transitions, 1203 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-04-30 10:19:27,496 INFO L231 Difference]: Finished difference. Result has 153 places, 104 transitions, 1028 flow [2025-04-30 10:19:27,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1028, PETRI_PLACES=153, PETRI_TRANSITIONS=104} [2025-04-30 10:19:27,498 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2025-04-30 10:19:27,498 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 104 transitions, 1028 flow [2025-04-30 10:19:27,498 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:27,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:27,498 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:27,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-30 10:19:27,499 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:27,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1294311172, now seen corresponding path program 4 times [2025-04-30 10:19:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:27,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149339020] [2025-04-30 10:19:27,499 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:27,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:27,505 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-30 10:19:27,546 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:19:27,546 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:27,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:28,523 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-30 10:19:28,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:28,523 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149339020] [2025-04-30 10:19:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149339020] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:28,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677014462] [2025-04-30 10:19:28,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:28,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:28,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:28,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:28,534 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:28,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 104 transitions, 1028 flow. Second operand has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:28,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:28,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:28,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:29,044 INFO L116 PetriNetUnfolderBase]: 92/309 cut-off events. [2025-04-30 10:19:29,045 INFO L117 PetriNetUnfolderBase]: For 1159/1163 co-relation queries the response was YES. [2025-04-30 10:19:29,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1342 conditions, 309 events. 92/309 cut-off events. For 1159/1163 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1404 event pairs, 28 based on Foata normal form. 7/316 useless extension candidates. Maximal degree in co-relation 1216. Up to 119 conditions per place. [2025-04-30 10:19:29,048 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 90 selfloop transitions, 42 changer transitions 1/135 dead transitions. [2025-04-30 10:19:29,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 135 transitions, 1436 flow [2025-04-30 10:19:29,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-30 10:19:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-30 10:19:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-04-30 10:19:29,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-04-30 10:19:29,049 INFO L175 Difference]: Start difference. First operand has 153 places, 104 transitions, 1028 flow. Second operand 17 states and 189 transitions. [2025-04-30 10:19:29,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 135 transitions, 1436 flow [2025-04-30 10:19:29,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 135 transitions, 1408 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-30 10:19:29,059 INFO L231 Difference]: Finished difference. Result has 171 places, 114 transitions, 1166 flow [2025-04-30 10:19:29,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1001, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1166, PETRI_PLACES=171, PETRI_TRANSITIONS=114} [2025-04-30 10:19:29,060 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 138 predicate places. [2025-04-30 10:19:29,060 INFO L485 AbstractCegarLoop]: Abstraction has has 171 places, 114 transitions, 1166 flow [2025-04-30 10:19:29,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.5) internal successors, (85), 10 states have internal predecessors, (85), 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-30 10:19:29,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:29,060 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:29,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-30 10:19:29,060 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:29,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash -805159514, now seen corresponding path program 1 times [2025-04-30 10:19:29,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:29,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991042755] [2025-04-30 10:19:29,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:29,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:29,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:19:29,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:19:29,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:29,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:31,157 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-30 10:19:31,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:31,158 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991042755] [2025-04-30 10:19:31,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991042755] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:31,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:31,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-30 10:19:31,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918162335] [2025-04-30 10:19:31,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:31,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:19:31,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:31,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:19:31,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:19:31,197 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-30 10:19:31,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 114 transitions, 1166 flow. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-30 10:19:31,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:31,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-30 10:19:31,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:32,507 INFO L116 PetriNetUnfolderBase]: 80/315 cut-off events. [2025-04-30 10:19:32,507 INFO L117 PetriNetUnfolderBase]: For 1591/1595 co-relation queries the response was YES. [2025-04-30 10:19:32,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 315 events. 80/315 cut-off events. For 1591/1595 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1583 event pairs, 31 based on Foata normal form. 7/322 useless extension candidates. Maximal degree in co-relation 1326. Up to 144 conditions per place. [2025-04-30 10:19:32,509 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 69 selfloop transitions, 19 changer transitions 25/132 dead transitions. [2025-04-30 10:19:32,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 132 transitions, 1503 flow [2025-04-30 10:19:32,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:19:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:19:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 138 transitions. [2025-04-30 10:19:32,510 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44516129032258067 [2025-04-30 10:19:32,510 INFO L175 Difference]: Start difference. First operand has 171 places, 114 transitions, 1166 flow. Second operand 10 states and 138 transitions. [2025-04-30 10:19:32,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 132 transitions, 1503 flow [2025-04-30 10:19:32,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 132 transitions, 1413 flow, removed 6 selfloop flow, removed 10 redundant places. [2025-04-30 10:19:32,518 INFO L231 Difference]: Finished difference. Result has 172 places, 102 transitions, 984 flow [2025-04-30 10:19:32,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1084, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=984, PETRI_PLACES=172, PETRI_TRANSITIONS=102} [2025-04-30 10:19:32,519 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 139 predicate places. [2025-04-30 10:19:32,519 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 102 transitions, 984 flow [2025-04-30 10:19:32,519 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 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-30 10:19:32,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:32,519 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:32,519 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-30 10:19:32,520 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:32,520 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:32,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1739486690, now seen corresponding path program 1 times [2025-04-30 10:19:32,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:32,520 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146106721] [2025-04-30 10:19:32,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:32,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:32,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:19:32,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:19:32,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:34,797 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-30 10:19:34,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:34,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146106721] [2025-04-30 10:19:34,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146106721] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:34,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:34,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:19:34,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649892196] [2025-04-30 10:19:34,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:34,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:19:34,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:34,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:19:34,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:19:34,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-30 10:19:34,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 102 transitions, 984 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-30 10:19:34,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:34,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-30 10:19:34,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:35,656 INFO L116 PetriNetUnfolderBase]: 62/263 cut-off events. [2025-04-30 10:19:35,656 INFO L117 PetriNetUnfolderBase]: For 1234/1240 co-relation queries the response was YES. [2025-04-30 10:19:35,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 263 events. 62/263 cut-off events. For 1234/1240 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1213 event pairs, 28 based on Foata normal form. 9/272 useless extension candidates. Maximal degree in co-relation 1135. Up to 146 conditions per place. [2025-04-30 10:19:35,658 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 61 selfloop transitions, 22 changer transitions 13/114 dead transitions. [2025-04-30 10:19:35,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 114 transitions, 1211 flow [2025-04-30 10:19:35,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:35,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2025-04-30 10:19:35,659 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4119106699751861 [2025-04-30 10:19:35,659 INFO L175 Difference]: Start difference. First operand has 172 places, 102 transitions, 984 flow. Second operand 13 states and 166 transitions. [2025-04-30 10:19:35,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 114 transitions, 1211 flow [2025-04-30 10:19:35,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 114 transitions, 1142 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-04-30 10:19:35,667 INFO L231 Difference]: Finished difference. Result has 168 places, 96 transitions, 901 flow [2025-04-30 10:19:35,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=901, PETRI_PLACES=168, PETRI_TRANSITIONS=96} [2025-04-30 10:19:35,668 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 135 predicate places. [2025-04-30 10:19:35,668 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 96 transitions, 901 flow [2025-04-30 10:19:35,668 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-30 10:19:35,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:35,668 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:35,668 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-30 10:19:35,668 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:35,669 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:35,669 INFO L85 PathProgramCache]: Analyzing trace with hash -779341660, now seen corresponding path program 1 times [2025-04-30 10:19:35,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:35,669 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342197131] [2025-04-30 10:19:35,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:19:35,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:35,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-30 10:19:35,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:19:35,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:19:35,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:38,017 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-30 10:19:38,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:38,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342197131] [2025-04-30 10:19:38,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342197131] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:38,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:38,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295062395] [2025-04-30 10:19:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:38,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:38,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:38,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:38,050 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-30 10:19:38,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 96 transitions, 901 flow. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-30 10:19:38,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:38,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-30 10:19:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:38,456 INFO L116 PetriNetUnfolderBase]: 70/256 cut-off events. [2025-04-30 10:19:38,457 INFO L117 PetriNetUnfolderBase]: For 832/832 co-relation queries the response was YES. [2025-04-30 10:19:38,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 256 events. 70/256 cut-off events. For 832/832 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1100 event pairs, 4 based on Foata normal form. 2/258 useless extension candidates. Maximal degree in co-relation 1095. Up to 69 conditions per place. [2025-04-30 10:19:38,458 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 87 selfloop transitions, 25 changer transitions 0/114 dead transitions. [2025-04-30 10:19:38,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 114 transitions, 1211 flow [2025-04-30 10:19:38,459 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:19:38,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:19:38,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2025-04-30 10:19:38,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375366568914956 [2025-04-30 10:19:38,459 INFO L175 Difference]: Start difference. First operand has 168 places, 96 transitions, 901 flow. Second operand 11 states and 128 transitions. [2025-04-30 10:19:38,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 114 transitions, 1211 flow [2025-04-30 10:19:38,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 114 transitions, 1145 flow, removed 3 selfloop flow, removed 18 redundant places. [2025-04-30 10:19:38,464 INFO L231 Difference]: Finished difference. Result has 155 places, 95 transitions, 873 flow [2025-04-30 10:19:38,464 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=873, PETRI_PLACES=155, PETRI_TRANSITIONS=95} [2025-04-30 10:19:38,464 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 122 predicate places. [2025-04-30 10:19:38,464 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 95 transitions, 873 flow [2025-04-30 10:19:38,464 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 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-30 10:19:38,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:38,464 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:38,464 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-30 10:19:38,465 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:38,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:38,465 INFO L85 PathProgramCache]: Analyzing trace with hash -780556378, now seen corresponding path program 2 times [2025-04-30 10:19:38,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:38,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187281089] [2025-04-30 10:19:38,465 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:38,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:38,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:19:38,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-04-30 10:19:38,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:38,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:41,202 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-30 10:19:41,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:41,202 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187281089] [2025-04-30 10:19:41,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187281089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:41,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:41,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:19:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126678566] [2025-04-30 10:19:41,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:41,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:19:41,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:41,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:19:41,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:19:41,245 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-30 10:19:41,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 95 transitions, 873 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:41,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:41,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-30 10:19:41,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:42,238 INFO L116 PetriNetUnfolderBase]: 54/233 cut-off events. [2025-04-30 10:19:42,238 INFO L117 PetriNetUnfolderBase]: For 763/763 co-relation queries the response was YES. [2025-04-30 10:19:42,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 233 events. 54/233 cut-off events. For 763/763 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1025 event pairs, 17 based on Foata normal form. 3/233 useless extension candidates. Maximal degree in co-relation 987. Up to 118 conditions per place. [2025-04-30 10:19:42,240 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 59 selfloop transitions, 26 changer transitions 7/109 dead transitions. [2025-04-30 10:19:42,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 109 transitions, 1104 flow [2025-04-30 10:19:42,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-30 10:19:42,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-30 10:19:42,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 174 transitions. [2025-04-30 10:19:42,241 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4009216589861751 [2025-04-30 10:19:42,241 INFO L175 Difference]: Start difference. First operand has 155 places, 95 transitions, 873 flow. Second operand 14 states and 174 transitions. [2025-04-30 10:19:42,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 109 transitions, 1104 flow [2025-04-30 10:19:42,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 109 transitions, 1060 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-04-30 10:19:42,245 INFO L231 Difference]: Finished difference. Result has 160 places, 91 transitions, 851 flow [2025-04-30 10:19:42,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=829, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=851, PETRI_PLACES=160, PETRI_TRANSITIONS=91} [2025-04-30 10:19:42,246 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 127 predicate places. [2025-04-30 10:19:42,246 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 91 transitions, 851 flow [2025-04-30 10:19:42,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:42,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:42,246 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:42,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-30 10:19:42,246 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:42,246 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:42,246 INFO L85 PathProgramCache]: Analyzing trace with hash -816305578, now seen corresponding path program 3 times [2025-04-30 10:19:42,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:42,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505045689] [2025-04-30 10:19:42,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:19:42,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:42,252 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-30 10:19:42,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-04-30 10:19:42,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:19:42,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:45,182 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-30 10:19:45,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:45,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505045689] [2025-04-30 10:19:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505045689] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-30 10:19:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840807611] [2025-04-30 10:19:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:45,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:19:45,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:45,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:19:45,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:19:45,250 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-30 10:19:45,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 91 transitions, 851 flow. Second operand has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:45,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:45,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-30 10:19:45,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:46,312 INFO L116 PetriNetUnfolderBase]: 48/215 cut-off events. [2025-04-30 10:19:46,312 INFO L117 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2025-04-30 10:19:46,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 215 events. 48/215 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 873 event pairs, 17 based on Foata normal form. 6/221 useless extension candidates. Maximal degree in co-relation 930. Up to 102 conditions per place. [2025-04-30 10:19:46,313 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 54 selfloop transitions, 20 changer transitions 16/102 dead transitions. [2025-04-30 10:19:46,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 102 transitions, 1058 flow [2025-04-30 10:19:46,314 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-30 10:19:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-30 10:19:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 161 transitions. [2025-04-30 10:19:46,314 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39950372208436724 [2025-04-30 10:19:46,314 INFO L175 Difference]: Start difference. First operand has 160 places, 91 transitions, 851 flow. Second operand 13 states and 161 transitions. [2025-04-30 10:19:46,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 102 transitions, 1058 flow [2025-04-30 10:19:46,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 102 transitions, 978 flow, removed 2 selfloop flow, removed 15 redundant places. [2025-04-30 10:19:46,319 INFO L231 Difference]: Finished difference. Result has 154 places, 80 transitions, 697 flow [2025-04-30 10:19:46,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=697, PETRI_PLACES=154, PETRI_TRANSITIONS=80} [2025-04-30 10:19:46,320 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 121 predicate places. [2025-04-30 10:19:46,320 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 80 transitions, 697 flow [2025-04-30 10:19:46,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.272727272727273) internal successors, (113), 11 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:46,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:46,320 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:46,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-30 10:19:46,320 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:46,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:46,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1726196928, now seen corresponding path program 4 times [2025-04-30 10:19:46,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:46,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319942805] [2025-04-30 10:19:46,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:19:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:46,329 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:19:46,348 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-30 10:19:46,349 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:19:46,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:19:48,739 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-30 10:19:48,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:19:48,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319942805] [2025-04-30 10:19:48,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319942805] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:19:48,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:19:48,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:19:48,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834733545] [2025-04-30 10:19:48,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:19:48,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-30 10:19:48,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:19:48,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-30 10:19:48,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-04-30 10:19:48,750 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-30 10:19:48,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 80 transitions, 697 flow. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:48,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:19:48,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-30 10:19:48,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:19:49,272 INFO L116 PetriNetUnfolderBase]: 34/177 cut-off events. [2025-04-30 10:19:49,272 INFO L117 PetriNetUnfolderBase]: For 609/611 co-relation queries the response was YES. [2025-04-30 10:19:49,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 177 events. 34/177 cut-off events. For 609/611 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 644 event pairs, 14 based on Foata normal form. 5/182 useless extension candidates. Maximal degree in co-relation 716. Up to 72 conditions per place. [2025-04-30 10:19:49,273 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 49 selfloop transitions, 14 changer transitions 14/88 dead transitions. [2025-04-30 10:19:49,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 88 transitions, 865 flow [2025-04-30 10:19:49,274 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:19:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:19:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 174 transitions. [2025-04-30 10:19:49,274 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-04-30 10:19:49,274 INFO L175 Difference]: Start difference. First operand has 154 places, 80 transitions, 697 flow. Second operand 12 states and 174 transitions. [2025-04-30 10:19:49,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 88 transitions, 865 flow [2025-04-30 10:19:49,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 88 transitions, 771 flow, removed 3 selfloop flow, removed 17 redundant places. [2025-04-30 10:19:49,278 INFO L231 Difference]: Finished difference. Result has 139 places, 71 transitions, 561 flow [2025-04-30 10:19:49,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=561, PETRI_PLACES=139, PETRI_TRANSITIONS=71} [2025-04-30 10:19:49,278 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2025-04-30 10:19:49,278 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 71 transitions, 561 flow [2025-04-30 10:19:49,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:19:49,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:19:49,278 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:19:49,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-30 10:19:49,278 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-30 10:19:49,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:19:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -645528060, now seen corresponding path program 2 times [2025-04-30 10:19:49,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:19:49,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193005191] [2025-04-30 10:19:49,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:19:49,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:19:49,285 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-30 10:19:49,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-04-30 10:19:49,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:19:49,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15