./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 28b3bab484555e9055546754c9232dcacfc14ffc38dad13c847fa435ed7ff870 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:58,610 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:58,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:58,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:58,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:58,695 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:58,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:58,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:58,697 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:58,698 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:58,698 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:58,698 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:58,699 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:58,699 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:58,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:58,700 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:58,701 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:58,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:58,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:58,702 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:58,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:58,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:58,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:58,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:58,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:58,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:58,703 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 -> 28b3bab484555e9055546754c9232dcacfc14ffc38dad13c847fa435ed7ff870 [2025-04-29 11:00:58,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:58,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:58,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:58,941 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:58,941 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:58,942 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.c [2025-04-29 11:01:00,195 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428860dd0/50d31a38be294bb3a3fa6aaf8fc2410f/FLAG3aaa7dc59 [2025-04-29 11:01:00,410 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:01:00,410 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_08-tricky_address3.c [2025-04-29 11:01:00,412 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:00,412 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:01:00,419 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428860dd0/50d31a38be294bb3a3fa6aaf8fc2410f/FLAG3aaa7dc59 [2025-04-29 11:01:01,246 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/428860dd0/50d31a38be294bb3a3fa6aaf8fc2410f [2025-04-29 11:01:01,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:01:01,249 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:01:01,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:01,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:01:01,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:01:01,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ea33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01, skipping insertion in model container [2025-04-29 11:01:01,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:01:01,414 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:01,427 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:01:01,453 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:01:01,470 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:01:01,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01 WrapperNode [2025-04-29 11:01:01,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:01:01,471 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:01,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:01:01,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:01:01,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,488 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,507 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2025-04-29 11:01:01,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:01:01,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:01:01,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:01:01,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:01:01,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,526 INFO L175 MemorySlicer]: Split 24 memory accesses to 1 slices as follows [24]. 100 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [20]. The 2 writes are split as follows [2]. [2025-04-29 11:01:01,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,530 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,532 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,532 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,533 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:01:01,536 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:01:01,537 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:01:01,537 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:01:01,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (1/1) ... [2025-04-29 11:01:01,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:01:01,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:01,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:01:01,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:01:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:01:01,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:01:01,604 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:01:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:01:01,604 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:01:01,660 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:01:01,661 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:01:01,807 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:01:01,807 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:01:01,926 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:01:01,926 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:01:01,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:01 BoogieIcfgContainer [2025-04-29 11:01:01,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:01:01,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:01:01,928 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:01:01,935 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:01:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:01:01" (1/3) ... [2025-04-29 11:01:01,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64527d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:01, skipping insertion in model container [2025-04-29 11:01:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:01:01" (2/3) ... [2025-04-29 11:01:01,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64527d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:01:01, skipping insertion in model container [2025-04-29 11:01:01,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:01:01" (3/3) ... [2025-04-29 11:01:01,936 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.c [2025-04-29 11:01:01,947 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:01:01,948 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.c that has 2 procedures, 31 locations, 30 edges, 1 initial locations, 1 loop locations, and 8 error locations. [2025-04-29 11:01:01,948 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:01:01,981 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:01:02,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 31 transitions, 66 flow [2025-04-29 11:01:02,027 INFO L116 PetriNetUnfolderBase]: 1/30 cut-off events. [2025-04-29 11:01:02,029 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:02,030 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 49 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-29 11:01:02,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 31 transitions, 66 flow [2025-04-29 11:01:02,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 30 transitions, 63 flow [2025-04-29 11:01:02,039 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:01:02,048 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;@75d6e802, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:01:02,048 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:01:02,050 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:01:02,051 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-29 11:01:02,051 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:02,051 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:02,051 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:01:02,051 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-29 11:01:02,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:02,058 INFO L85 PathProgramCache]: Analyzing trace with hash 274580, now seen corresponding path program 1 times [2025-04-29 11:01:02,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:02,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034549167] [2025-04-29 11:01:02,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:02,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:01:02,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:01:02,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:02,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:02,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034549167] [2025-04-29 11:01:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034549167] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:02,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477336367] [2025-04-29 11:01:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:02,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:02,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:02,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:02,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:02,285 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:02,287 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-29 11:01:02,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:02,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:02,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:02,389 INFO L116 PetriNetUnfolderBase]: 43/147 cut-off events. [2025-04-29 11:01:02,391 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:02,392 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 555 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-29 11:01:02,394 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 19 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2025-04-29 11:01:02,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 111 flow [2025-04-29 11:01:02,396 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2025-04-29 11:01:02,404 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5564516129032258 [2025-04-29 11:01:02,405 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 63 flow. Second operand 4 states and 69 transitions. [2025-04-29 11:01:02,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 111 flow [2025-04-29 11:01:02,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 110 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:02,411 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 86 flow [2025-04-29 11:01:02,413 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-29 11:01:02,417 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2025-04-29 11:01:02,418 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 86 flow [2025-04-29 11:01:02,418 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-29 11:01:02,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:02,418 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-29 11:01:02,419 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:01:02,419 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-29 11:01:02,420 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash -409672218, now seen corresponding path program 1 times [2025-04-29 11:01:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:02,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111010927] [2025-04-29 11:01:02,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:02,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:02,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:02,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:02,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:02,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111010927] [2025-04-29 11:01:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111010927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:02,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851049312] [2025-04-29 11:01:02,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:02,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:02,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:02,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:01:02,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:02,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:02,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:01:02,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:02,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:02,590 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:01:02,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851049312] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:02,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:01:02,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 11:01:02,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373657589] [2025-04-29 11:01:02,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:02,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:01:02,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:02,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:01:02,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:02,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:02,600 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-29 11:01:02,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:02,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:02,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:02,714 INFO L116 PetriNetUnfolderBase]: 43/146 cut-off events. [2025-04-29 11:01:02,714 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:01:02,716 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 551 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-29 11:01:02,717 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 15 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2025-04-29 11:01:02,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 124 flow [2025-04-29 11:01:02,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2025-04-29 11:01:02,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4731182795698925 [2025-04-29 11:01:02,720 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 86 flow. Second operand 6 states and 88 transitions. [2025-04-29 11:01:02,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 124 flow [2025-04-29 11:01:02,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:02,722 INFO L231 Difference]: Finished difference. Result has 40 places, 31 transitions, 92 flow [2025-04-29 11:01:02,723 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-29 11:01:02,724 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places. [2025-04-29 11:01:02,724 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 31 transitions, 92 flow [2025-04-29 11:01:02,724 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-29 11:01:02,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:02,724 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-29 11:01:02,733 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-29 11:01:02,929 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:02,929 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-29 11:01:02,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:02,930 INFO L85 PathProgramCache]: Analyzing trace with hash 185063381, now seen corresponding path program 1 times [2025-04-29 11:01:02,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:02,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382599949] [2025-04-29 11:01:02,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:02,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:01:02,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:01:02,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:01:02,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:02,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382599949] [2025-04-29 11:01:02,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382599949] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:02,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:02,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:02,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757483626] [2025-04-29 11:01:02,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:02,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:02,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:02,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:02,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:02,972 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:02,972 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-29 11:01:02,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:02,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:02,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:03,023 INFO L116 PetriNetUnfolderBase]: 43/145 cut-off events. [2025-04-29 11:01:03,024 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-29 11:01:03,024 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 549 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-29 11:01:03,024 INFO L140 encePairwiseOnDemand]: 28/31 looper letters, 16 selfloop transitions, 4 changer transitions 0/30 dead transitions. [2025-04-29 11:01:03,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 128 flow [2025-04-29 11:01:03,025 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:03,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:03,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-04-29 11:01:03,025 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2025-04-29 11:01:03,026 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 92 flow. Second operand 3 states and 52 transitions. [2025-04-29 11:01:03,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 128 flow [2025-04-29 11:01:03,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 106 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:03,027 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 74 flow [2025-04-29 11:01:03,027 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-29 11:01:03,027 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-04-29 11:01:03,027 INFO L485 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 74 flow [2025-04-29 11:01:03,028 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-29 11:01:03,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:03,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:03,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:01:03,028 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-29 11:01:03,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:03,028 INFO L85 PathProgramCache]: Analyzing trace with hash -1454706561, now seen corresponding path program 1 times [2025-04-29 11:01:03,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:03,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265734290] [2025-04-29 11:01:03,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:03,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:03,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:03,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:03,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:03,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:03,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:03,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:03,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265734290] [2025-04-29 11:01:03,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265734290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:03,102 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369104415] [2025-04-29 11:01:03,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:03,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:03,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:03,104 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:03,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:01:03,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:03,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:03,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:03,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:03,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:01:03,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:03,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:03,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369104415] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:03,188 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:03,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:01:03,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68007687] [2025-04-29 11:01:03,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:03,189 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:03,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:03,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:03,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:03,206 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:03,206 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-29 11:01:03,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:03,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:03,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:03,336 INFO L116 PetriNetUnfolderBase]: 43/149 cut-off events. [2025-04-29 11:01:03,336 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-29 11:01:03,336 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 546 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-29 11:01:03,337 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 16 selfloop transitions, 7 changer transitions 0/33 dead transitions. [2025-04-29 11:01:03,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 135 flow [2025-04-29 11:01:03,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:01:03,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:01:03,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2025-04-29 11:01:03,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4700460829493088 [2025-04-29 11:01:03,339 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 74 flow. Second operand 7 states and 102 transitions. [2025-04-29 11:01:03,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 135 flow [2025-04-29 11:01:03,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 121 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:03,340 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 100 flow [2025-04-29 11:01:03,340 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-29 11:01:03,340 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-04-29 11:01:03,340 INFO L485 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 100 flow [2025-04-29 11:01:03,340 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-29 11:01:03,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:03,341 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:03,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:01:03,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-04-29 11:01:03,545 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-29 11:01:03,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:03,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1312247361, now seen corresponding path program 2 times [2025-04-29 11:01:03,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:03,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871233887] [2025-04-29 11:01:03,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:03,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:03,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-29 11:01:03,565 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 16 statements. [2025-04-29 11:01:03,565 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:03,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:01:04,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:04,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871233887] [2025-04-29 11:01:04,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871233887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:04,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:04,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:04,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811990509] [2025-04-29 11:01:04,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:04,267 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:04,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:04,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:04,281 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:04,281 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-29 11:01:04,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:04,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:04,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:04,472 INFO L116 PetriNetUnfolderBase]: 49/151 cut-off events. [2025-04-29 11:01:04,472 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:01:04,473 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-29 11:01:04,473 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 31 selfloop transitions, 5 changer transitions 6/50 dead transitions. [2025-04-29 11:01:04,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 50 transitions, 218 flow [2025-04-29 11:01:04,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:04,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:04,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-04-29 11:01:04,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-04-29 11:01:04,474 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 100 flow. Second operand 6 states and 107 transitions. [2025-04-29 11:01:04,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 50 transitions, 218 flow [2025-04-29 11:01:04,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:04,475 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 123 flow [2025-04-29 11:01:04,476 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-29 11:01:04,476 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2025-04-29 11:01:04,476 INFO L485 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 123 flow [2025-04-29 11:01:04,476 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-29 11:01:04,476 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:04,476 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:04,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:01:04,476 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-29 11:01:04,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:04,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1312117143, now seen corresponding path program 1 times [2025-04-29 11:01:04,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:04,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376037897] [2025-04-29 11:01:04,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:04,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:04,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:01:04,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:01:04,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:04,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:01:04,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:04,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376037897] [2025-04-29 11:01:04,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376037897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:04,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:04,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:04,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881704088] [2025-04-29 11:01:04,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:04,518 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:04,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:04,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:04,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:04,522 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:04,523 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-29 11:01:04,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:04,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:04,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:04,594 INFO L116 PetriNetUnfolderBase]: 39/142 cut-off events. [2025-04-29 11:01:04,594 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:01:04,595 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 535 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-29 11:01:04,596 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 34 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2025-04-29 11:01:04,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 45 transitions, 233 flow [2025-04-29 11:01:04,596 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-29 11:01:04,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6129032258064516 [2025-04-29 11:01:04,597 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 123 flow. Second operand 4 states and 76 transitions. [2025-04-29 11:01:04,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 45 transitions, 233 flow [2025-04-29 11:01:04,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 222 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:04,600 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 118 flow [2025-04-29 11:01:04,600 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-29 11:01:04,600 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2025-04-29 11:01:04,601 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 118 flow [2025-04-29 11:01:04,601 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-29 11:01:04,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:04,601 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:04,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:01:04,601 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-29 11:01:04,602 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2020925483, now seen corresponding path program 1 times [2025-04-29 11:01:04,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:04,602 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254047810] [2025-04-29 11:01:04,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:04,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:01:04,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:01:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:01:04,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:04,654 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254047810] [2025-04-29 11:01:04,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254047810] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:04,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:04,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:04,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450572037] [2025-04-29 11:01:04,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:04,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:04,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:04,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:04,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:04,663 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:04,664 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-29 11:01:04,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:04,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:04,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:04,733 INFO L116 PetriNetUnfolderBase]: 33/118 cut-off events. [2025-04-29 11:01:04,736 INFO L117 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-04-29 11:01:04,736 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 367 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-29 11:01:04,737 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 33 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2025-04-29 11:01:04,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 224 flow [2025-04-29 11:01:04,740 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2025-04-29 11:01:04,740 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6048387096774194 [2025-04-29 11:01:04,740 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 118 flow. Second operand 4 states and 75 transitions. [2025-04-29 11:01:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 224 flow [2025-04-29 11:01:04,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 218 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:04,742 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 116 flow [2025-04-29 11:01:04,742 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-29 11:01:04,742 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2025-04-29 11:01:04,742 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 116 flow [2025-04-29 11:01:04,743 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-29 11:01:04,743 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:04,743 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:04,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:01:04,743 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-29 11:01:04,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:04,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1775819755, now seen corresponding path program 1 times [2025-04-29 11:01:04,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:04,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561968583] [2025-04-29 11:01:04,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:04,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:04,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:04,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:04,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:04,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:04,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561968583] [2025-04-29 11:01:04,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561968583] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:04,855 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944145215] [2025-04-29 11:01:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:04,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:04,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:04,857 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:04,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:01:04,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:01:04,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:01:04,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:04,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:04,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:01:04,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:04,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:05,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944145215] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:05,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-29 11:01:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385437290] [2025-04-29 11:01:05,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:05,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:01:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:05,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:01:05,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:01:05,037 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:05,038 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-29 11:01:05,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:05,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:05,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:05,176 INFO L116 PetriNetUnfolderBase]: 33/135 cut-off events. [2025-04-29 11:01:05,177 INFO L117 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-04-29 11:01:05,178 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 402 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-29 11:01:05,179 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 17 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2025-04-29 11:01:05,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 40 transitions, 228 flow [2025-04-29 11:01:05,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:01:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:01:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 200 transitions. [2025-04-29 11:01:05,182 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43010752688172044 [2025-04-29 11:01:05,183 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 116 flow. Second operand 15 states and 200 transitions. [2025-04-29 11:01:05,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 40 transitions, 228 flow [2025-04-29 11:01:05,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 40 transitions, 222 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:05,186 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 207 flow [2025-04-29 11:01:05,186 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-29 11:01:05,186 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 26 predicate places. [2025-04-29 11:01:05,186 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 207 flow [2025-04-29 11:01:05,187 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-29 11:01:05,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:05,188 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:05,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-29 11:01:05,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:05,390 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-29 11:01:05,390 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash 433319531, now seen corresponding path program 2 times [2025-04-29 11:01:05,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:05,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776943233] [2025-04-29 11:01:05,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:05,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:05,399 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-29 11:01:05,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 30 statements. [2025-04-29 11:01:05,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:05,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:05,799 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-04-29 11:01:05,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:05,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776943233] [2025-04-29 11:01:05,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776943233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:05,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:05,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:05,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242355761] [2025-04-29 11:01:05,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:05,800 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:05,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:05,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:05,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:05,806 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:05,807 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-29 11:01:05,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:05,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:05,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:05,935 INFO L116 PetriNetUnfolderBase]: 36/136 cut-off events. [2025-04-29 11:01:05,935 INFO L117 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2025-04-29 11:01:05,936 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 380 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-29 11:01:05,937 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 40 selfloop transitions, 6 changer transitions 4/56 dead transitions. [2025-04-29 11:01:05,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 351 flow [2025-04-29 11:01:05,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:05,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 107 transitions. [2025-04-29 11:01:05,938 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5752688172043011 [2025-04-29 11:01:05,938 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 207 flow. Second operand 6 states and 107 transitions. [2025-04-29 11:01:05,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 351 flow [2025-04-29 11:01:05,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 56 transitions, 341 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:05,941 INFO L231 Difference]: Finished difference. Result has 64 places, 43 transitions, 237 flow [2025-04-29 11:01:05,941 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-29 11:01:05,941 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 31 predicate places. [2025-04-29 11:01:05,941 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 43 transitions, 237 flow [2025-04-29 11:01:05,941 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-29 11:01:05,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:05,943 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:05,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:01:05,943 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-29 11:01:05,944 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:05,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1003731379, now seen corresponding path program 1 times [2025-04-29 11:01:05,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:05,944 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167024029] [2025-04-29 11:01:05,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:05,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:05,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:01:05,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:01:05,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:05,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:06,168 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:06,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167024029] [2025-04-29 11:01:06,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167024029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:06,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956990056] [2025-04-29 11:01:06,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:06,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:06,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:06,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:06,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:01:06,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:01:06,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:01:06,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:06,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:06,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:01:06,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:06,270 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:06,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956990056] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:06,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:06,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-29 11:01:06,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136572544] [2025-04-29 11:01:06,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:06,412 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:01:06,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:06,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:01:06,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:01:06,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 31 [2025-04-29 11:01:06,431 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-29 11:01:06,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:06,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 31 [2025-04-29 11:01:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:06,576 INFO L116 PetriNetUnfolderBase]: 32/135 cut-off events. [2025-04-29 11:01:06,576 INFO L117 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-04-29 11:01:06,577 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 328 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-29 11:01:06,577 INFO L140 encePairwiseOnDemand]: 27/31 looper letters, 20 selfloop transitions, 21 changer transitions 0/49 dead transitions. [2025-04-29 11:01:06,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 49 transitions, 373 flow [2025-04-29 11:01:06,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:01:06,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:01:06,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 271 transitions. [2025-04-29 11:01:06,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4162826420890937 [2025-04-29 11:01:06,582 INFO L175 Difference]: Start difference. First operand has 64 places, 43 transitions, 237 flow. Second operand 21 states and 271 transitions. [2025-04-29 11:01:06,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 49 transitions, 373 flow [2025-04-29 11:01:06,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 49 transitions, 365 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:06,584 INFO L231 Difference]: Finished difference. Result has 84 places, 49 transitions, 340 flow [2025-04-29 11:01:06,584 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-29 11:01:06,585 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-04-29 11:01:06,585 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 49 transitions, 340 flow [2025-04-29 11:01:06,585 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-29 11:01:06,585 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:06,585 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:06,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:01:06,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:06,790 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-29 11:01:06,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:06,790 INFO L85 PathProgramCache]: Analyzing trace with hash 483844559, now seen corresponding path program 2 times [2025-04-29 11:01:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:06,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477702724] [2025-04-29 11:01:06,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:06,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:06,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-29 11:01:06,827 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-29 11:01:06,827 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:06,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:10,854 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:10,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:10,854 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477702724] [2025-04-29 11:01:10,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477702724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:10,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:10,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511143677] [2025-04-29 11:01:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:10,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:10,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:10,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:10,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:10,872 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-29 11:01:10,872 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-29 11:01:10,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:10,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-29 11:01:10,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:12,244 INFO L116 PetriNetUnfolderBase]: 70/209 cut-off events. [2025-04-29 11:01:12,244 INFO L117 PetriNetUnfolderBase]: For 239/239 co-relation queries the response was YES. [2025-04-29 11:01:12,244 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 678 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-29 11:01:12,246 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 65 selfloop transitions, 17 changer transitions 3/87 dead transitions. [2025-04-29 11:01:12,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 626 flow [2025-04-29 11:01:12,246 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:01:12,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:01:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2025-04-29 11:01:12,247 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4222873900293255 [2025-04-29 11:01:12,247 INFO L175 Difference]: Start difference. First operand has 84 places, 49 transitions, 340 flow. Second operand 11 states and 144 transitions. [2025-04-29 11:01:12,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 626 flow [2025-04-29 11:01:12,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 583 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-29 11:01:12,251 INFO L231 Difference]: Finished difference. Result has 87 places, 60 transitions, 410 flow [2025-04-29 11:01:12,251 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-29 11:01:12,253 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2025-04-29 11:01:12,253 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 60 transitions, 410 flow [2025-04-29 11:01:12,253 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-29 11:01:12,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:12,253 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:12,253 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:01:12,253 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-29 11:01:12,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1997241123, now seen corresponding path program 3 times [2025-04-29 11:01:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:12,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763527945] [2025-04-29 11:01:12,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:12,262 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-04-29 11:01:12,296 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-29 11:01:12,299 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:12,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:14,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:14,941 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763527945] [2025-04-29 11:01:14,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763527945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:14,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:14,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:01:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129357057] [2025-04-29 11:01:14,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:14,942 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:01:14,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:14,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:01:14,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:01:14,968 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-29 11:01:14,969 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-29 11:01:14,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:14,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-29 11:01:14,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:16,063 INFO L116 PetriNetUnfolderBase]: 80/247 cut-off events. [2025-04-29 11:01:16,063 INFO L117 PetriNetUnfolderBase]: For 410/412 co-relation queries the response was YES. [2025-04-29 11:01:16,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 247 events. 80/247 cut-off events. For 410/412 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 897 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-29 11:01:16,064 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 66 selfloop transitions, 27 changer transitions 7/102 dead transitions. [2025-04-29 11:01:16,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 102 transitions, 816 flow [2025-04-29 11:01:16,064 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:01:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:01:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 190 transitions. [2025-04-29 11:01:16,065 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3605313092979127 [2025-04-29 11:01:16,065 INFO L175 Difference]: Start difference. First operand has 87 places, 60 transitions, 410 flow. Second operand 17 states and 190 transitions. [2025-04-29 11:01:16,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 102 transitions, 816 flow [2025-04-29 11:01:16,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 102 transitions, 786 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:16,069 INFO L231 Difference]: Finished difference. Result has 104 places, 73 transitions, 563 flow [2025-04-29 11:01:16,069 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-29 11:01:16,069 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 71 predicate places. [2025-04-29 11:01:16,069 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 73 transitions, 563 flow [2025-04-29 11:01:16,070 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-29 11:01:16,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:16,070 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:16,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:01:16,070 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-29 11:01:16,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1576722792, now seen corresponding path program 1 times [2025-04-29 11:01:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:16,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084154005] [2025-04-29 11:01:16,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:16,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:16,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:01:16,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:01:16,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:16,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:18,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084154005] [2025-04-29 11:01:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084154005] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:18,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:18,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:01:18,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973528378] [2025-04-29 11:01:18,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:18,630 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:01:18,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:18,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:01:18,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:01:18,672 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2025-04-29 11:01:18,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 73 transitions, 563 flow. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:18,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:18,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2025-04-29 11:01:18,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:19,619 INFO L116 PetriNetUnfolderBase]: 77/257 cut-off events. [2025-04-29 11:01:19,619 INFO L117 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2025-04-29 11:01:19,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 257 events. 77/257 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1029 event pairs, 30 based on Foata normal form. 7/264 useless extension candidates. Maximal degree in co-relation 827. Up to 125 conditions per place. [2025-04-29 11:01:19,620 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 60 selfloop transitions, 33 changer transitions 7/106 dead transitions. [2025-04-29 11:01:19,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 106 transitions, 914 flow [2025-04-29 11:01:19,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-29 11:01:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-29 11:01:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 213 transitions. [2025-04-29 11:01:19,623 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3817204301075269 [2025-04-29 11:01:19,623 INFO L175 Difference]: Start difference. First operand has 104 places, 73 transitions, 563 flow. Second operand 18 states and 213 transitions. [2025-04-29 11:01:19,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 106 transitions, 914 flow [2025-04-29 11:01:19,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 106 transitions, 841 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:19,627 INFO L231 Difference]: Finished difference. Result has 118 places, 84 transitions, 663 flow [2025-04-29 11:01:19,627 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=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=663, PETRI_PLACES=118, PETRI_TRANSITIONS=84} [2025-04-29 11:01:19,628 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 85 predicate places. [2025-04-29 11:01:19,628 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 84 transitions, 663 flow [2025-04-29 11:01:19,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 11 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:19,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:19,628 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:19,628 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:01:19,629 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-29 11:01:19,629 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1978004040, now seen corresponding path program 2 times [2025-04-29 11:01:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:19,629 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707352917] [2025-04-29 11:01:19,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:19,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-04-29 11:01:19,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-29 11:01:19,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:19,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:24,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707352917] [2025-04-29 11:01:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707352917] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:24,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:24,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:01:24,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559265296] [2025-04-29 11:01:24,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:24,191 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:01:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:24,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:01:24,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:01:24,208 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-29 11:01:24,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 84 transitions, 663 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-29 11:01:24,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:24,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-29 11:01:24,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:25,720 INFO L116 PetriNetUnfolderBase]: 87/279 cut-off events. [2025-04-29 11:01:25,720 INFO L117 PetriNetUnfolderBase]: For 603/607 co-relation queries the response was YES. [2025-04-29 11:01:25,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 279 events. 87/279 cut-off events. For 603/607 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1148 event pairs, 35 based on Foata normal form. 4/283 useless extension candidates. Maximal degree in co-relation 930. Up to 133 conditions per place. [2025-04-29 11:01:25,722 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 67 selfloop transitions, 36 changer transitions 7/112 dead transitions. [2025-04-29 11:01:25,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 112 transitions, 1018 flow [2025-04-29 11:01:25,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-29 11:01:25,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-29 11:01:25,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 212 transitions. [2025-04-29 11:01:25,724 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3419354838709677 [2025-04-29 11:01:25,724 INFO L175 Difference]: Start difference. First operand has 118 places, 84 transitions, 663 flow. Second operand 20 states and 212 transitions. [2025-04-29 11:01:25,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 112 transitions, 1018 flow [2025-04-29 11:01:25,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 112 transitions, 976 flow, removed 8 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:25,730 INFO L231 Difference]: Finished difference. Result has 134 places, 90 transitions, 770 flow [2025-04-29 11:01:25,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=634, 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=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=770, PETRI_PLACES=134, PETRI_TRANSITIONS=90} [2025-04-29 11:01:25,731 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 101 predicate places. [2025-04-29 11:01:25,731 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 90 transitions, 770 flow [2025-04-29 11:01:25,731 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-29 11:01:25,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:25,731 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:25,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:01:25,731 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-29 11:01:25,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:25,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1977427440, now seen corresponding path program 3 times [2025-04-29 11:01:25,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:25,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331633400] [2025-04-29 11:01:25,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:25,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:25,738 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 44 statements into 11 equivalence classes. [2025-04-29 11:01:25,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 44 statements. [2025-04-29 11:01:25,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:25,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:29,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:29,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331633400] [2025-04-29 11:01:29,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331633400] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:29,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:29,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:01:29,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982994040] [2025-04-29 11:01:29,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:29,876 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:01:29,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:29,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:01:29,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:01:29,920 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-29 11:01:29,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 90 transitions, 770 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-29 11:01:29,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:29,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-29 11:01:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:31,050 INFO L116 PetriNetUnfolderBase]: 89/289 cut-off events. [2025-04-29 11:01:31,050 INFO L117 PetriNetUnfolderBase]: For 768/773 co-relation queries the response was YES. [2025-04-29 11:01:31,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 289 events. 89/289 cut-off events. For 768/773 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1232 event pairs, 30 based on Foata normal form. 5/294 useless extension candidates. Maximal degree in co-relation 1033. Up to 129 conditions per place. [2025-04-29 11:01:31,054 INFO L140 encePairwiseOnDemand]: 18/31 looper letters, 73 selfloop transitions, 42 changer transitions 0/117 dead transitions. [2025-04-29 11:01:31,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 117 transitions, 1118 flow [2025-04-29 11:01:31,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:01:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:01:31,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-04-29 11:01:31,056 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3586337760910816 [2025-04-29 11:01:31,056 INFO L175 Difference]: Start difference. First operand has 134 places, 90 transitions, 770 flow. Second operand 17 states and 189 transitions. [2025-04-29 11:01:31,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 117 transitions, 1118 flow [2025-04-29 11:01:31,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 117 transitions, 1072 flow, removed 8 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:31,062 INFO L231 Difference]: Finished difference. Result has 144 places, 97 transitions, 875 flow [2025-04-29 11:01:31,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=875, PETRI_PLACES=144, PETRI_TRANSITIONS=97} [2025-04-29 11:01:31,063 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 111 predicate places. [2025-04-29 11:01:31,063 INFO L485 AbstractCegarLoop]: Abstraction has has 144 places, 97 transitions, 875 flow [2025-04-29 11:01:31,063 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-29 11:01:31,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:31,064 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:31,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:01:31,064 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-29 11:01:31,064 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1994091180, now seen corresponding path program 4 times [2025-04-29 11:01:31,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:31,064 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83578641] [2025-04-29 11:01:31,065 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:31,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-29 11:01:31,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:01:31,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:32,419 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:32,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:32,420 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83578641] [2025-04-29 11:01:32,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83578641] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:32,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:32,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:32,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465136033] [2025-04-29 11:01:32,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:32,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:32,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:32,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:32,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:32,432 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 31 [2025-04-29 11:01:32,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 97 transitions, 875 flow. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-29 11:01:32,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:32,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 31 [2025-04-29 11:01:32,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:32,856 INFO L116 PetriNetUnfolderBase]: 87/283 cut-off events. [2025-04-29 11:01:32,856 INFO L117 PetriNetUnfolderBase]: For 883/888 co-relation queries the response was YES. [2025-04-29 11:01:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 283 events. 87/283 cut-off events. For 883/888 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1204 event pairs, 15 based on Foata normal form. 5/288 useless extension candidates. Maximal degree in co-relation 1093. Up to 87 conditions per place. [2025-04-29 11:01:32,858 INFO L140 encePairwiseOnDemand]: 22/31 looper letters, 83 selfloop transitions, 30 changer transitions 0/115 dead transitions. [2025-04-29 11:01:32,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 115 transitions, 1178 flow [2025-04-29 11:01:32,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:01:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:01:32,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 122 transitions. [2025-04-29 11:01:32,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3935483870967742 [2025-04-29 11:01:32,862 INFO L175 Difference]: Start difference. First operand has 144 places, 97 transitions, 875 flow. Second operand 10 states and 122 transitions. [2025-04-29 11:01:32,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 115 transitions, 1178 flow [2025-04-29 11:01:32,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 115 transitions, 1104 flow, removed 8 selfloop flow, removed 13 redundant places. [2025-04-29 11:01:32,870 INFO L231 Difference]: Finished difference. Result has 139 places, 96 transitions, 851 flow [2025-04-29 11:01:32,871 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=851, PETRI_PLACES=139, PETRI_TRANSITIONS=96} [2025-04-29 11:01:32,871 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 106 predicate places. [2025-04-29 11:01:32,872 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 96 transitions, 851 flow [2025-04-29 11:01:32,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 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-29 11:01:32,872 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:32,872 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:32,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:01:32,872 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-29 11:01:32,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:32,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1095954885, now seen corresponding path program 4 times [2025-04-29 11:01:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:32,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455806905] [2025-04-29 11:01:32,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:32,881 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-29 11:01:32,927 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:01:32,927 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:32,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 92 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:01:35,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:35,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455806905] [2025-04-29 11:01:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455806905] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:35,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545953956] [2025-04-29 11:01:35,079 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:35,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:35,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:35,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:01:35,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:01:35,123 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 44 statements into 2 equivalence classes. [2025-04-29 11:01:35,207 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:01:35,207 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:35,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:35,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-04-29 11:01:35,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:36,738 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-04-29 11:01:36,957 INFO L325 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-04-29 11:01:36,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 141 [2025-04-29 11:01:38,155 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:01:38,156 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 485 treesize of output 519 [2025-04-29 11:01:42,060 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:01:42,061 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 587 treesize of output 365 [2025-04-29 11:01:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:01:43,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:43,391 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-04-29 11:01:43,396 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2025-04-29 11:01:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545953956] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:01:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [27, 25] total 59 [2025-04-29 11:01:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046795921] [2025-04-29 11:01:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:43,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:01:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:43,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:01:43,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2025-04-29 11:01:43,813 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 31 [2025-04-29 11:01:43,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 96 transitions, 851 flow. Second operand has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:43,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:43,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 31 [2025-04-29 11:01:43,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:47,825 INFO L116 PetriNetUnfolderBase]: 80/302 cut-off events. [2025-04-29 11:01:47,825 INFO L117 PetriNetUnfolderBase]: For 926/930 co-relation queries the response was YES. [2025-04-29 11:01:47,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 302 events. 80/302 cut-off events. For 926/930 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1473 event pairs, 1 based on Foata normal form. 7/308 useless extension candidates. Maximal degree in co-relation 1141. Up to 45 conditions per place. [2025-04-29 11:01:47,827 INFO L140 encePairwiseOnDemand]: 19/31 looper letters, 89 selfloop transitions, 61 changer transitions 1/163 dead transitions. [2025-04-29 11:01:47,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 1489 flow [2025-04-29 11:01:47,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:01:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-29 11:01:47,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 343 transitions. [2025-04-29 11:01:47,828 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4425806451612903 [2025-04-29 11:01:47,828 INFO L175 Difference]: Start difference. First operand has 139 places, 96 transitions, 851 flow. Second operand 25 states and 343 transitions. [2025-04-29 11:01:47,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 1489 flow [2025-04-29 11:01:47,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 163 transitions, 1426 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-29 11:01:47,834 INFO L231 Difference]: Finished difference. Result has 162 places, 124 transitions, 1122 flow [2025-04-29 11:01:47,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=800, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1122, PETRI_PLACES=162, PETRI_TRANSITIONS=124} [2025-04-29 11:01:47,834 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 129 predicate places. [2025-04-29 11:01:47,834 INFO L485 AbstractCegarLoop]: Abstraction has has 162 places, 124 transitions, 1122 flow [2025-04-29 11:01:47,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.555555555555555) internal successors, (104), 9 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:47,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:47,835 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-29 11:01:47,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-29 11:01:48,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-29 11:01:48,035 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-29 11:01:48,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:48,036 INFO L85 PathProgramCache]: Analyzing trace with hash -131749123, now seen corresponding path program 1 times [2025-04-29 11:01:48,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:48,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571103753] [2025-04-29 11:01:48,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:48,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:48,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:01:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:01:48,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:48,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:50,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:50,156 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571103753] [2025-04-29 11:01:50,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571103753] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:50,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:50,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844691742] [2025-04-29 11:01:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:50,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:50,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:50,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:50,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:50,203 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-29 11:01:50,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 124 transitions, 1122 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-29 11:01:50,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:50,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-29 11:01:50,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:51,512 INFO L116 PetriNetUnfolderBase]: 98/361 cut-off events. [2025-04-29 11:01:51,512 INFO L117 PetriNetUnfolderBase]: For 1543/1548 co-relation queries the response was YES. [2025-04-29 11:01:51,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 361 events. 98/361 cut-off events. For 1543/1548 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1899 event pairs, 22 based on Foata normal form. 11/372 useless extension candidates. Maximal degree in co-relation 1516. Up to 163 conditions per place. [2025-04-29 11:01:51,514 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 78 selfloop transitions, 19 changer transitions 33/151 dead transitions. [2025-04-29 11:01:51,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 151 transitions, 1536 flow [2025-04-29 11:01:51,514 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:01:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:01:51,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2025-04-29 11:01:51,515 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44193548387096776 [2025-04-29 11:01:51,515 INFO L175 Difference]: Start difference. First operand has 162 places, 124 transitions, 1122 flow. Second operand 10 states and 137 transitions. [2025-04-29 11:01:51,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 151 transitions, 1536 flow [2025-04-29 11:01:51,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 151 transitions, 1429 flow, removed 13 selfloop flow, removed 7 redundant places. [2025-04-29 11:01:51,523 INFO L231 Difference]: Finished difference. Result has 166 places, 113 transitions, 982 flow [2025-04-29 11:01:51,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=1038, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=982, PETRI_PLACES=166, PETRI_TRANSITIONS=113} [2025-04-29 11:01:51,523 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 133 predicate places. [2025-04-29 11:01:51,523 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 113 transitions, 982 flow [2025-04-29 11:01:51,523 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-29 11:01:51,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:51,524 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-29 11:01:51,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:01:51,524 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-29 11:01:51,524 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1633766027, now seen corresponding path program 1 times [2025-04-29 11:01:51,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:51,524 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030670888] [2025-04-29 11:01:51,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:51,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:51,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:01:51,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:01:51,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:51,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:53,705 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:53,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:53,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030670888] [2025-04-29 11:01:53,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030670888] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:53,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:53,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:53,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806164467] [2025-04-29 11:01:53,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:53,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:53,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:53,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:53,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:53,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-29 11:01:53,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 113 transitions, 982 flow. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:53,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:53,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-29 11:01:53,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:54,579 INFO L116 PetriNetUnfolderBase]: 67/270 cut-off events. [2025-04-29 11:01:54,580 INFO L117 PetriNetUnfolderBase]: For 1178/1184 co-relation queries the response was YES. [2025-04-29 11:01:54,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 270 events. 67/270 cut-off events. For 1178/1184 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1246 event pairs, 17 based on Foata normal form. 9/279 useless extension candidates. Maximal degree in co-relation 1113. Up to 152 conditions per place. [2025-04-29 11:01:54,581 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 69 selfloop transitions, 21 changer transitions 13/123 dead transitions. [2025-04-29 11:01:54,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 123 transitions, 1220 flow [2025-04-29 11:01:54,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:01:54,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:01:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 165 transitions. [2025-04-29 11:01:54,582 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4094292803970223 [2025-04-29 11:01:54,582 INFO L175 Difference]: Start difference. First operand has 166 places, 113 transitions, 982 flow. Second operand 13 states and 165 transitions. [2025-04-29 11:01:54,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 123 transitions, 1220 flow [2025-04-29 11:01:54,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 123 transitions, 1134 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-04-29 11:01:54,589 INFO L231 Difference]: Finished difference. Result has 160 places, 105 transitions, 861 flow [2025-04-29 11:01:54,589 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=861, PETRI_PLACES=160, PETRI_TRANSITIONS=105} [2025-04-29 11:01:54,590 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 127 predicate places. [2025-04-29 11:01:54,590 INFO L485 AbstractCegarLoop]: Abstraction has has 160 places, 105 transitions, 861 flow [2025-04-29 11:01:54,590 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:54,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:54,590 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-29 11:01:54,590 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:01:54,590 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:01:54,590 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:54,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1170708227, now seen corresponding path program 2 times [2025-04-29 11:01:54,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:54,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629760582] [2025-04-29 11:01:54,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:54,598 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:01:54,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-04-29 11:01:54,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:54,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-04-29 11:01:57,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:57,021 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629760582] [2025-04-29 11:01:57,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629760582] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:57,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:57,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:01:57,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66500402] [2025-04-29 11:01:57,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:57,021 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:01:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:57,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:01:57,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:01:57,080 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 31 [2025-04-29 11:01:57,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 105 transitions, 861 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-29 11:01:57,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:57,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 31 [2025-04-29 11:01:57,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:58,145 INFO L116 PetriNetUnfolderBase]: 60/244 cut-off events. [2025-04-29 11:01:58,145 INFO L117 PetriNetUnfolderBase]: For 718/718 co-relation queries the response was YES. [2025-04-29 11:01:58,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 244 events. 60/244 cut-off events. For 718/718 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1062 event pairs, 9 based on Foata normal form. 3/245 useless extension candidates. Maximal degree in co-relation 945. Up to 129 conditions per place. [2025-04-29 11:01:58,147 INFO L140 encePairwiseOnDemand]: 20/31 looper letters, 66 selfloop transitions, 26 changer transitions 7/118 dead transitions. [2025-04-29 11:01:58,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 118 transitions, 1105 flow [2025-04-29 11:01:58,147 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-29 11:01:58,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-29 11:01:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 174 transitions. [2025-04-29 11:01:58,148 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4009216589861751 [2025-04-29 11:01:58,148 INFO L175 Difference]: Start difference. First operand has 160 places, 105 transitions, 861 flow. Second operand 14 states and 174 transitions. [2025-04-29 11:01:58,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 118 transitions, 1105 flow [2025-04-29 11:01:58,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 118 transitions, 1037 flow, removed 3 selfloop flow, removed 13 redundant places. [2025-04-29 11:01:58,152 INFO L231 Difference]: Finished difference. Result has 153 places, 101 transitions, 817 flow [2025-04-29 11:01:58,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=817, PETRI_PLACES=153, PETRI_TRANSITIONS=101} [2025-04-29 11:01:58,152 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 120 predicate places. [2025-04-29 11:01:58,152 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 101 transitions, 817 flow [2025-04-29 11:01:58,152 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-29 11:01:58,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:58,152 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-29 11:01:58,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:01:58,153 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-29 11:01:58,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:58,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1188582827, now seen corresponding path program 3 times [2025-04-29 11:01:58,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:58,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733717016] [2025-04-29 11:01:58,153 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:58,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:58,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-29 11:01:58,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 45 statements. [2025-04-29 11:01:58,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:58,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15