./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.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_06-tricky_address1.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 d4b0baa913b04cb405887810f5346cca5c549e3b66e03da220a52b8657c83a30 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:56,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:56,532 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:56,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:56,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:56,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:56,562 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:56,562 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:56,562 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:56,562 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:56,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:56,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:56,563 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:56,563 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:56,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:56,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:56,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:56,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:56,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:56,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:56,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:56,567 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:56,567 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 -> d4b0baa913b04cb405887810f5346cca5c549e3b66e03da220a52b8657c83a30 [2025-04-29 11:00:56,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:56,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:56,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:56,815 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:56,815 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:56,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c [2025-04-29 11:00:58,068 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d030c11/b797e43dcf5a4a62ae2f8a044c1faa06/FLAGe9a9f19c9 [2025-04-29 11:00:58,270 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:58,272 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_06-tricky_address1.c [2025-04-29 11:00:58,275 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:58,275 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:58,282 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d030c11/b797e43dcf5a4a62ae2f8a044c1faa06/FLAGe9a9f19c9 [2025-04-29 11:00:59,119 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4d030c11/b797e43dcf5a4a62ae2f8a044c1faa06 [2025-04-29 11:00:59,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:59,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:59,123 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:59,123 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:59,126 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:59,127 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,128 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a61248f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59, skipping insertion in model container [2025-04-29 11:00:59,128 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,136 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:59,295 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:59,305 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:59,332 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:59,349 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:59,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59 WrapperNode [2025-04-29 11:00:59,350 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:59,351 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:59,351 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:59,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:59,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,380 INFO L138 Inliner]: procedures = 14, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 90 [2025-04-29 11:00:59,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:59,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:59,382 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:59,382 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:59,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,390 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,404 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:00:59,404 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,404 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,407 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,408 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,410 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,411 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,411 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,416 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:59,417 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:59,417 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:59,417 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:59,419 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (1/1) ... [2025-04-29 11:00:59,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:59,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:59,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:00:59,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:00:59,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:59,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:59,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:00:59,462 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:00:59,462 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:00:59,462 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:00:59,520 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:59,521 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:59,671 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:00:59,671 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:59,815 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:59,816 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:59,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:59 BoogieIcfgContainer [2025-04-29 11:00:59,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:59,818 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:59,818 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:59,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:59,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:59" (1/3) ... [2025-04-29 11:00:59,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c394f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:59, skipping insertion in model container [2025-04-29 11:00:59,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:59" (2/3) ... [2025-04-29 11:00:59,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48c394f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:59, skipping insertion in model container [2025-04-29 11:00:59,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:59" (3/3) ... [2025-04-29 11:00:59,825 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_06-tricky_address1.c [2025-04-29 11:00:59,834 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:59,835 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_06-tricky_address1.c that has 2 procedures, 27 locations, 26 edges, 1 initial locations, 1 loop locations, and 6 error locations. [2025-04-29 11:00:59,835 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:00:59,867 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:00:59,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 58 flow [2025-04-29 11:00:59,913 INFO L116 PetriNetUnfolderBase]: 1/26 cut-off events. [2025-04-29 11:00:59,917 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:59,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 26 events. 1/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 7. Up to 2 conditions per place. [2025-04-29 11:00:59,919 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 58 flow [2025-04-29 11:00:59,922 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 55 flow [2025-04-29 11:00:59,929 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:59,942 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;@4a8faff3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:59,942 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:00:59,947 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:00:59,947 INFO L116 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-04-29 11:00:59,947 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:59,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:59,948 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-04-29 11:00:59,948 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:00:59,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:59,953 INFO L85 PathProgramCache]: Analyzing trace with hash 259021, now seen corresponding path program 1 times [2025-04-29 11:00:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:59,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290799931] [2025-04-29 11:00:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:59,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:00,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-29 11:01:00,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-29 11:01:00,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:00,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,131 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:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:00,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290799931] [2025-04-29 11:01:00,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290799931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:00,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:00,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:00,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156298960] [2025-04-29 11:01:00,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:00,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:01:00,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:00,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:01:00,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:01:00,192 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:00,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:00,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:00,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:00,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:00,268 INFO L116 PetriNetUnfolderBase]: 37/119 cut-off events. [2025-04-29 11:01:00,268 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:01:00,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 119 events. 37/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 398 event pairs, 36 based on Foata normal form. 1/109 useless extension candidates. Maximal degree in co-relation 192. Up to 92 conditions per place. [2025-04-29 11:01:00,270 INFO L140 encePairwiseOnDemand]: 21/27 looper letters, 18 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2025-04-29 11:01:00,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 101 flow [2025-04-29 11:01:00,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:01:00,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:01:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-29 11:01:00,279 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-29 11:01:00,280 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 55 flow. Second operand 4 states and 56 transitions. [2025-04-29 11:01:00,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 101 flow [2025-04-29 11:01:00,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 28 transitions, 100 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:00,284 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 78 flow [2025-04-29 11:01:00,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2025-04-29 11:01:00,288 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2025-04-29 11:01:00,288 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 78 flow [2025-04-29 11:01:00,289 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:00,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:00,289 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-29 11:01:00,289 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:01:00,289 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:00,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:00,290 INFO L85 PathProgramCache]: Analyzing trace with hash -873200180, now seen corresponding path program 1 times [2025-04-29 11:01:00,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:00,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440756491] [2025-04-29 11:01:00,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:00,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:00,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:00,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:00,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:00,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,390 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:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:00,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440756491] [2025-04-29 11:01:00,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440756491] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:00,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484685292] [2025-04-29 11:01:00,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:00,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:00,393 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:00,395 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:00,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:01:00,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:01:00,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:00,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:01:00,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:00,485 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:00,485 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:01:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484685292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:00,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:01:00,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-04-29 11:01:00,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883212868] [2025-04-29 11:01:00,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:00,486 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:01:00,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:00,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:01:00,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:00,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:00,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 78 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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:00,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:00,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:00,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:00,582 INFO L116 PetriNetUnfolderBase]: 37/118 cut-off events. [2025-04-29 11:01:00,582 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:01:00,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 118 events. 37/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 394 event pairs, 36 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 209. Up to 87 conditions per place. [2025-04-29 11:01:00,584 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 14 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2025-04-29 11:01:00,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 114 flow [2025-04-29 11:01:00,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:00,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2025-04-29 11:01:00,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42592592592592593 [2025-04-29 11:01:00,586 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 78 flow. Second operand 6 states and 69 transitions. [2025-04-29 11:01:00,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 114 flow [2025-04-29 11:01:00,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 112 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:01:00,586 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 84 flow [2025-04-29 11:01:00,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2025-04-29 11:01:00,587 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 7 predicate places. [2025-04-29 11:01:00,587 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 84 flow [2025-04-29 11:01:00,587 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 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:00,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:00,587 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-04-29 11:01:00,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:01:00,788 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:00,788 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:00,788 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:00,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1299401563, now seen corresponding path program 1 times [2025-04-29 11:01:00,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:00,789 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766827389] [2025-04-29 11:01:00,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:00,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:00,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:01:00,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:01:00,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:00,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,834 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:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:00,834 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766827389] [2025-04-29 11:01:00,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766827389] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:00,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:00,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:01:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079662665] [2025-04-29 11:01:00,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:00,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:01:00,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:00,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:01:00,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:01:00,838 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:00,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:00,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:00,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:00,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:00,896 INFO L116 PetriNetUnfolderBase]: 37/117 cut-off events. [2025-04-29 11:01:00,896 INFO L117 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-04-29 11:01:00,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 117 events. 37/117 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 391 event pairs, 36 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 205. Up to 90 conditions per place. [2025-04-29 11:01:00,897 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 15 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2025-04-29 11:01:00,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 118 flow [2025-04-29 11:01:00,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:01:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:01:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-29 11:01:00,901 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5185185185185185 [2025-04-29 11:01:00,901 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 84 flow. Second operand 3 states and 42 transitions. [2025-04-29 11:01:00,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 118 flow [2025-04-29 11:01:00,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 96 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-29 11:01:00,902 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 66 flow [2025-04-29 11:01:00,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2025-04-29 11:01:00,903 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2025-04-29 11:01:00,903 INFO L485 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 66 flow [2025-04-29 11:01:00,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:00,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:00,903 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:00,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:01:00,903 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:00,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:00,904 INFO L85 PathProgramCache]: Analyzing trace with hash 108361906, now seen corresponding path program 1 times [2025-04-29 11:01:00,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:00,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630023875] [2025-04-29 11:01:00,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:00,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:00,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:00,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:00,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:00,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:00,980 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:00,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:00,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630023875] [2025-04-29 11:01:00,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630023875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:00,981 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456087082] [2025-04-29 11:01:00,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:00,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:00,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:00,983 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:00,984 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:01,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-29 11:01:01,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-29 11:01:01,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:01,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:01,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:01:01,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:01,045 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:01,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:01,071 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:01,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456087082] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:01,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-29 11:01:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213680818] [2025-04-29 11:01:01,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:01,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:01,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:01,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:01,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:01,085 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:01,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 66 flow. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:01,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:01,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:01,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:01,191 INFO L116 PetriNetUnfolderBase]: 37/121 cut-off events. [2025-04-29 11:01:01,191 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-29 11:01:01,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 121 events. 37/121 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 386 event pairs, 36 based on Foata normal form. 2/114 useless extension candidates. Maximal degree in co-relation 198. Up to 88 conditions per place. [2025-04-29 11:01:01,192 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 15 selfloop transitions, 7 changer transitions 0/29 dead transitions. [2025-04-29 11:01:01,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 125 flow [2025-04-29 11:01:01,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:01:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:01:01,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-29 11:01:01,194 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.42328042328042326 [2025-04-29 11:01:01,194 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 66 flow. Second operand 7 states and 80 transitions. [2025-04-29 11:01:01,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 125 flow [2025-04-29 11:01:01,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 29 transitions, 111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:01,197 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 92 flow [2025-04-29 11:01:01,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2025-04-29 11:01:01,197 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2025-04-29 11:01:01,197 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 92 flow [2025-04-29 11:01:01,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 10 states have internal predecessors, (95), 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:01,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:01,198 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:01,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-29 11:01:01,398 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:01,398 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:01,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:01,399 INFO L85 PathProgramCache]: Analyzing trace with hash 2036914450, now seen corresponding path program 2 times [2025-04-29 11:01:01,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:01,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234760626] [2025-04-29 11:01:01,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:01,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:01,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-04-29 11:01:01,423 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:01,423 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:01,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,165 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:02,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:02,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234760626] [2025-04-29 11:01:02,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234760626] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:02,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:02,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:02,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214938771] [2025-04-29 11:01:02,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:02,166 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:02,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:02,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:02,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:02,179 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:02,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:02,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:02,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:02,377 INFO L116 PetriNetUnfolderBase]: 43/128 cut-off events. [2025-04-29 11:01:02,378 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:01:02,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 128 events. 43/128 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 383 event pairs, 18 based on Foata normal form. 7/129 useless extension candidates. Maximal degree in co-relation 222. Up to 73 conditions per place. [2025-04-29 11:01:02,380 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 28 selfloop transitions, 5 changer transitions 6/44 dead transitions. [2025-04-29 11:01:02,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 200 flow [2025-04-29 11:01:02,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2025-04-29 11:01:02,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5308641975308642 [2025-04-29 11:01:02,383 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 92 flow. Second operand 6 states and 86 transitions. [2025-04-29 11:01:02,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 200 flow [2025-04-29 11:01:02,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:02,386 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 115 flow [2025-04-29 11:01:02,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2025-04-29 11:01:02,386 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 14 predicate places. [2025-04-29 11:01:02,388 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 115 flow [2025-04-29 11:01:02,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:02,388 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:02,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:01:02,388 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:02,389 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2037549402, now seen corresponding path program 1 times [2025-04-29 11:01:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:02,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695945070] [2025-04-29 11:01:02,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:02,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:01:02,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:01:02,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,499 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:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:02,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695945070] [2025-04-29 11:01:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695945070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:02,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935154114] [2025-04-29 11:01:02,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:02,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:02,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:02,502 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:02,504 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:02,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-29 11:01:02,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-29 11:01:02,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:02,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:02,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:01:02,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:02,584 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:02,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:02,652 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:02,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935154114] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:02,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:02,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-29 11:01:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064590738] [2025-04-29 11:01:02,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:02,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-29 11:01:02,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:02,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-29 11:01:02,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-04-29 11:01:02,671 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:02,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 115 flow. Second operand has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 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,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:02,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:02,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:02,805 INFO L116 PetriNetUnfolderBase]: 27/117 cut-off events. [2025-04-29 11:01:02,805 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-29 11:01:02,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 117 events. 27/117 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 322 event pairs, 26 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 253. Up to 69 conditions per place. [2025-04-29 11:01:02,806 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 16 selfloop transitions, 15 changer transitions 0/38 dead transitions. [2025-04-29 11:01:02,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 38 transitions, 225 flow [2025-04-29 11:01:02,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:01:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:01:02,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 154 transitions. [2025-04-29 11:01:02,808 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3802469135802469 [2025-04-29 11:01:02,808 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 115 flow. Second operand 15 states and 154 transitions. [2025-04-29 11:01:02,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 38 transitions, 225 flow [2025-04-29 11:01:02,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 38 transitions, 216 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-29 11:01:02,813 INFO L231 Difference]: Finished difference. Result has 57 places, 38 transitions, 203 flow [2025-04-29 11:01:02,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=203, PETRI_PLACES=57, PETRI_TRANSITIONS=38} [2025-04-29 11:01:02,814 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 28 predicate places. [2025-04-29 11:01:02,814 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 38 transitions, 203 flow [2025-04-29 11:01:02,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.277777777777779) internal successors, (167), 18 states have internal predecessors, (167), 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,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:02,815 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:02,823 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:03,015 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:03,016 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:03,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 146403866, now seen corresponding path program 2 times [2025-04-29 11:01:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:03,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541146584] [2025-04-29 11:01:03,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:03,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-29 11:01:03,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 28 statements. [2025-04-29 11:01:03,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:03,346 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:03,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:03,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541146584] [2025-04-29 11:01:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541146584] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:01:03,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395947660] [2025-04-29 11:01:03,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:03,349 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:01:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:03,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:01:03,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:01:03,354 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:03,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 38 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:03,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:03,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:03,497 INFO L116 PetriNetUnfolderBase]: 30/119 cut-off events. [2025-04-29 11:01:03,498 INFO L117 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-04-29 11:01:03,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 119 events. 30/119 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 319 event pairs, 8 based on Foata normal form. 14/133 useless extension candidates. Maximal degree in co-relation 208. Up to 51 conditions per place. [2025-04-29 11:01:03,500 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 38 selfloop transitions, 6 changer transitions 4/53 dead transitions. [2025-04-29 11:01:03,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 53 transitions, 341 flow [2025-04-29 11:01:03,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:01:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:01:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-29 11:01:03,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5370370370370371 [2025-04-29 11:01:03,502 INFO L175 Difference]: Start difference. First operand has 57 places, 38 transitions, 203 flow. Second operand 6 states and 87 transitions. [2025-04-29 11:01:03,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 53 transitions, 341 flow [2025-04-29 11:01:03,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 331 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:03,505 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 233 flow [2025-04-29 11:01:03,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2025-04-29 11:01:03,505 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 33 predicate places. [2025-04-29 11:01:03,505 INFO L485 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 233 flow [2025-04-29 11:01:03,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:03,507 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:03,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:01:03,508 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:03,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1343466669, now seen corresponding path program 1 times [2025-04-29 11:01:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:03,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6174938] [2025-04-29 11:01:03,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:03,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:03,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:01:03,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:01:03,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:03,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:03,700 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:03,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:03,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6174938] [2025-04-29 11:01:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6174938] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:03,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152018862] [2025-04-29 11:01:03,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:03,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:03,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:03,704 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:03,705 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:03,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:01:03,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:01:03,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:03,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:03,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:01:03,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:03,806 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:03,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:01:03,954 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:03,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152018862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:01:03,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:01:03,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2025-04-29 11:01:03,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978023847] [2025-04-29 11:01:03,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:01:03,955 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-29 11:01:03,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:03,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-29 11:01:03,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-04-29 11:01:03,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 27 [2025-04-29 11:01:03,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 233 flow. Second operand has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 23 states have internal predecessors, (217), 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,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:03,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 27 [2025-04-29 11:01:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:04,116 INFO L116 PetriNetUnfolderBase]: 26/123 cut-off events. [2025-04-29 11:01:04,116 INFO L117 PetriNetUnfolderBase]: For 168/169 co-relation queries the response was YES. [2025-04-29 11:01:04,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 123 events. 26/123 cut-off events. For 168/169 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 295 event pairs, 22 based on Foata normal form. 3/126 useless extension candidates. Maximal degree in co-relation 336. Up to 68 conditions per place. [2025-04-29 11:01:04,117 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 19 selfloop transitions, 21 changer transitions 0/47 dead transitions. [2025-04-29 11:01:04,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 47 transitions, 367 flow [2025-04-29 11:01:04,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:01:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:01:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 207 transitions. [2025-04-29 11:01:04,119 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36507936507936506 [2025-04-29 11:01:04,119 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 233 flow. Second operand 21 states and 207 transitions. [2025-04-29 11:01:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 47 transitions, 367 flow [2025-04-29 11:01:04,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 47 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:04,122 INFO L231 Difference]: Finished difference. Result has 82 places, 47 transitions, 336 flow [2025-04-29 11:01:04,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=336, PETRI_PLACES=82, PETRI_TRANSITIONS=47} [2025-04-29 11:01:04,122 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 53 predicate places. [2025-04-29 11:01:04,122 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 47 transitions, 336 flow [2025-04-29 11:01:04,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 9.434782608695652) internal successors, (217), 23 states have internal predecessors, (217), 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,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:04,123 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:04,129 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:04,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:04,323 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:04,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:04,326 INFO L85 PathProgramCache]: Analyzing trace with hash -879889022, now seen corresponding path program 1 times [2025-04-29 11:01:04,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:04,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602277874] [2025-04-29 11:01:04,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:01:04,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:04,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-04-29 11:01:04,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:01:04,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:01:04,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:07,054 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:07,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:07,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602277874] [2025-04-29 11:01:07,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602277874] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:07,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:07,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:07,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150784309] [2025-04-29 11:01:07,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:07,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:07,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:07,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:07,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:07,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-29 11:01:07,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 47 transitions, 336 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:07,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:07,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-29 11:01:07,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:08,091 INFO L116 PetriNetUnfolderBase]: 58/184 cut-off events. [2025-04-29 11:01:08,091 INFO L117 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2025-04-29 11:01:08,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 184 events. 58/184 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 575 event pairs, 12 based on Foata normal form. 3/187 useless extension candidates. Maximal degree in co-relation 409. Up to 64 conditions per place. [2025-04-29 11:01:08,092 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 56 selfloop transitions, 24 changer transitions 6/87 dead transitions. [2025-04-29 11:01:08,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 87 transitions, 640 flow [2025-04-29 11:01:08,093 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:01:08,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:01:08,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 132 transitions. [2025-04-29 11:01:08,094 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3055555555555556 [2025-04-29 11:01:08,094 INFO L175 Difference]: Start difference. First operand has 82 places, 47 transitions, 336 flow. Second operand 16 states and 132 transitions. [2025-04-29 11:01:08,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 87 transitions, 640 flow [2025-04-29 11:01:08,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 87 transitions, 597 flow, removed 1 selfloop flow, removed 13 redundant places. [2025-04-29 11:01:08,097 INFO L231 Difference]: Finished difference. Result has 91 places, 64 transitions, 454 flow [2025-04-29 11:01:08,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=454, PETRI_PLACES=91, PETRI_TRANSITIONS=64} [2025-04-29 11:01:08,098 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 62 predicate places. [2025-04-29 11:01:08,098 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 64 transitions, 454 flow [2025-04-29 11:01:08,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:08,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:08,098 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:08,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:01:08,098 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:08,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1026194410, now seen corresponding path program 2 times [2025-04-29 11:01:08,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:08,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273115228] [2025-04-29 11:01:08,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:08,106 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:01:08,125 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-29 11:01:08,125 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:08,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:10,174 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,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:10,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273115228] [2025-04-29 11:01:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273115228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440665509] [2025-04-29 11:01:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:10,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:10,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:10,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:10,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:10,215 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 27 [2025-04-29 11:01:10,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 64 transitions, 454 flow. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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:10,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:10,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 27 [2025-04-29 11:01:10,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:11,454 INFO L116 PetriNetUnfolderBase]: 49/181 cut-off events. [2025-04-29 11:01:11,454 INFO L117 PetriNetUnfolderBase]: For 329/331 co-relation queries the response was YES. [2025-04-29 11:01:11,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 181 events. 49/181 cut-off events. For 329/331 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 607 event pairs, 18 based on Foata normal form. 3/184 useless extension candidates. Maximal degree in co-relation 575. Up to 71 conditions per place. [2025-04-29 11:01:11,456 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 54 selfloop transitions, 26 changer transitions 4/87 dead transitions. [2025-04-29 11:01:11,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 87 transitions, 746 flow [2025-04-29 11:01:11,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:01:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:01:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 133 transitions. [2025-04-29 11:01:11,457 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32839506172839505 [2025-04-29 11:01:11,457 INFO L175 Difference]: Start difference. First operand has 91 places, 64 transitions, 454 flow. Second operand 15 states and 133 transitions. [2025-04-29 11:01:11,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 87 transitions, 746 flow [2025-04-29 11:01:11,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 87 transitions, 715 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:11,461 INFO L231 Difference]: Finished difference. Result has 108 places, 73 transitions, 594 flow [2025-04-29 11:01:11,461 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=594, PETRI_PLACES=108, PETRI_TRANSITIONS=73} [2025-04-29 11:01:11,461 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2025-04-29 11:01:11,461 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 73 transitions, 594 flow [2025-04-29 11:01:11,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 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:11,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:11,462 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:11,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:01:11,462 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:11,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:11,462 INFO L85 PathProgramCache]: Analyzing trace with hash 949008764, now seen corresponding path program 3 times [2025-04-29 11:01:11,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:11,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761693311] [2025-04-29 11:01:11,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:11,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:11,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-04-29 11:01:11,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-29 11:01:11,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:11,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:15,098 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:15,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:15,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761693311] [2025-04-29 11:01:15,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761693311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:15,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:15,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:15,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181868489] [2025-04-29 11:01:15,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:15,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:15,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:15,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:15,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:15,116 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-29 11:01:15,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 73 transitions, 594 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:15,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:15,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-29 11:01:15,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:15,990 INFO L116 PetriNetUnfolderBase]: 64/210 cut-off events. [2025-04-29 11:01:15,990 INFO L117 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2025-04-29 11:01:15,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 848 conditions, 210 events. 64/210 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 741 event pairs, 19 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 748. Up to 78 conditions per place. [2025-04-29 11:01:15,991 INFO L140 encePairwiseOnDemand]: 16/27 looper letters, 60 selfloop transitions, 30 changer transitions 3/94 dead transitions. [2025-04-29 11:01:15,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 94 transitions, 873 flow [2025-04-29 11:01:15,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:01:15,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-29 11:01:15,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 121 transitions. [2025-04-29 11:01:15,992 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29876543209876544 [2025-04-29 11:01:15,992 INFO L175 Difference]: Start difference. First operand has 108 places, 73 transitions, 594 flow. Second operand 15 states and 121 transitions. [2025-04-29 11:01:15,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 94 transitions, 873 flow [2025-04-29 11:01:15,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 94 transitions, 859 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-29 11:01:15,999 INFO L231 Difference]: Finished difference. Result has 124 places, 78 transitions, 719 flow [2025-04-29 11:01:15,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=719, PETRI_PLACES=124, PETRI_TRANSITIONS=78} [2025-04-29 11:01:16,000 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2025-04-29 11:01:16,001 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 78 transitions, 719 flow [2025-04-29 11:01:16,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:16,001 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:16,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:01:16,001 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:16,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:16,002 INFO L85 PathProgramCache]: Analyzing trace with hash 949412384, now seen corresponding path program 4 times [2025-04-29 11:01:16,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:16,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664151647] [2025-04-29 11:01:16,002 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:16,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:16,010 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:01:16,040 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:01:16,040 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:16,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:17,251 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:17,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:17,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664151647] [2025-04-29 11:01:17,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664151647] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:17,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:17,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:01:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139084725] [2025-04-29 11:01:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:17,252 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:01:17,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:17,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:01:17,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:01:17,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-29 11:01:17,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 78 transitions, 719 flow. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:17,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:17,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-29 11:01:17,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:17,583 INFO L116 PetriNetUnfolderBase]: 62/203 cut-off events. [2025-04-29 11:01:17,583 INFO L117 PetriNetUnfolderBase]: For 607/607 co-relation queries the response was YES. [2025-04-29 11:01:17,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 904 conditions, 203 events. 62/203 cut-off events. For 607/607 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 694 event pairs, 8 based on Foata normal form. 3/206 useless extension candidates. Maximal degree in co-relation 812. Up to 60 conditions per place. [2025-04-29 11:01:17,585 INFO L140 encePairwiseOnDemand]: 18/27 looper letters, 61 selfloop transitions, 27 changer transitions 1/90 dead transitions. [2025-04-29 11:01:17,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 90 transitions, 941 flow [2025-04-29 11:01:17,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:01:17,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:01:17,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 89 transitions. [2025-04-29 11:01:17,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3296296296296296 [2025-04-29 11:01:17,586 INFO L175 Difference]: Start difference. First operand has 124 places, 78 transitions, 719 flow. Second operand 10 states and 89 transitions. [2025-04-29 11:01:17,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 90 transitions, 941 flow [2025-04-29 11:01:17,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 90 transitions, 890 flow, removed 8 selfloop flow, removed 10 redundant places. [2025-04-29 11:01:17,591 INFO L231 Difference]: Finished difference. Result has 121 places, 77 transitions, 715 flow [2025-04-29 11:01:17,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=661, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=715, PETRI_PLACES=121, PETRI_TRANSITIONS=77} [2025-04-29 11:01:17,591 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 92 predicate places. [2025-04-29 11:01:17,591 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 77 transitions, 715 flow [2025-04-29 11:01:17,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 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:17,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:17,592 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:17,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:01:17,592 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:17,592 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:17,592 INFO L85 PathProgramCache]: Analyzing trace with hash 640593804, now seen corresponding path program 2 times [2025-04-29 11:01:17,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:17,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79579185] [2025-04-29 11:01:17,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:01:17,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:17,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:01:17,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-29 11:01:17,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:01:17,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:18,763 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,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:18,763 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79579185] [2025-04-29 11:01:18,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79579185] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:18,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:18,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:01:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351640009] [2025-04-29 11:01:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:18,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:01:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:18,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:01:18,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:01:18,796 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 27 [2025-04-29 11:01:18,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 77 transitions, 715 flow. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:18,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:18,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 27 [2025-04-29 11:01:18,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:20,113 INFO L116 PetriNetUnfolderBase]: 52/210 cut-off events. [2025-04-29 11:01:20,113 INFO L117 PetriNetUnfolderBase]: For 680/689 co-relation queries the response was YES. [2025-04-29 11:01:20,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 210 events. 52/210 cut-off events. For 680/689 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 846 event pairs, 22 based on Foata normal form. 3/213 useless extension candidates. Maximal degree in co-relation 763. Up to 74 conditions per place. [2025-04-29 11:01:20,115 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 62 selfloop transitions, 22 changer transitions 3/96 dead transitions. [2025-04-29 11:01:20,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 96 transitions, 1008 flow [2025-04-29 11:01:20,115 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:01:20,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:01:20,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2025-04-29 11:01:20,117 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3925925925925926 [2025-04-29 11:01:20,117 INFO L175 Difference]: Start difference. First operand has 121 places, 77 transitions, 715 flow. Second operand 10 states and 106 transitions. [2025-04-29 11:01:20,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 96 transitions, 1008 flow [2025-04-29 11:01:20,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 96 transitions, 949 flow, removed 1 selfloop flow, removed 8 redundant places. [2025-04-29 11:01:20,123 INFO L231 Difference]: Finished difference. Result has 125 places, 81 transitions, 768 flow [2025-04-29 11:01:20,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=768, PETRI_PLACES=125, PETRI_TRANSITIONS=81} [2025-04-29 11:01:20,124 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 96 predicate places. [2025-04-29 11:01:20,125 INFO L485 AbstractCegarLoop]: Abstraction has has 125 places, 81 transitions, 768 flow [2025-04-29 11:01:20,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:01:20,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:20,125 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:20,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:01:20,125 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:20,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:20,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1798757846, now seen corresponding path program 3 times [2025-04-29 11:01:20,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:20,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476523404] [2025-04-29 11:01:20,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:01:20,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:20,135 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 11 equivalence classes. [2025-04-29 11:01:20,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-04-29 11:01:20,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:01:20,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:21,318 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:21,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:21,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476523404] [2025-04-29 11:01:21,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476523404] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:01:21,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:01:21,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:01:21,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739845708] [2025-04-29 11:01:21,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:01:21,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:01:21,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:01:21,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:01:21,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:01:21,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 27 [2025-04-29 11:01:21,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 81 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:21,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:01:21,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 27 [2025-04-29 11:01:21,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:01:22,141 INFO L116 PetriNetUnfolderBase]: 76/252 cut-off events. [2025-04-29 11:01:22,141 INFO L117 PetriNetUnfolderBase]: For 698/698 co-relation queries the response was YES. [2025-04-29 11:01:22,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 252 events. 76/252 cut-off events. For 698/698 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1039 event pairs, 34 based on Foata normal form. 3/255 useless extension candidates. Maximal degree in co-relation 976. Up to 105 conditions per place. [2025-04-29 11:01:22,144 INFO L140 encePairwiseOnDemand]: 17/27 looper letters, 71 selfloop transitions, 31 changer transitions 3/106 dead transitions. [2025-04-29 11:01:22,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 106 transitions, 1132 flow [2025-04-29 11:01:22,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:01:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:01:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 129 transitions. [2025-04-29 11:01:22,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28104575163398693 [2025-04-29 11:01:22,146 INFO L175 Difference]: Start difference. First operand has 125 places, 81 transitions, 768 flow. Second operand 17 states and 129 transitions. [2025-04-29 11:01:22,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 106 transitions, 1132 flow [2025-04-29 11:01:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 106 transitions, 1092 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-04-29 11:01:22,153 INFO L231 Difference]: Finished difference. Result has 140 places, 90 transitions, 916 flow [2025-04-29 11:01:22,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=916, PETRI_PLACES=140, PETRI_TRANSITIONS=90} [2025-04-29 11:01:22,153 INFO L279 CegarLoopForPetriNet]: 29 programPoint places, 111 predicate places. [2025-04-29 11:01:22,154 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 90 transitions, 916 flow [2025-04-29 11:01:22,154 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 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:22,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:01:22,154 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:01:22,154 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:01:22,154 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-04-29 11:01:22,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:01:22,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1811702516, now seen corresponding path program 4 times [2025-04-29 11:01:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:01:22,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754108231] [2025-04-29 11:01:22,155 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:01:22,160 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:01:22,184 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:01:22,187 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:22,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:22,840 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-04-29 11:01:22,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:01:22,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754108231] [2025-04-29 11:01:22,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754108231] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:01:22,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539140117] [2025-04-29 11:01:22,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:01:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:01:22,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:01:22,843 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:22,845 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:22,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 42 statements into 2 equivalence classes. [2025-04-29 11:01:23,042 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 42 of 42 statements. [2025-04-29 11:01:23,042 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-29 11:01:23,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:01:23,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-04-29 11:01:23,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:01:24,234 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:24,472 INFO L325 Elim1Store]: treesize reduction 180, result has 38.1 percent of original size [2025-04-29 11:01:24,472 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:25,975 INFO L325 Elim1Store]: treesize reduction 10, result has 94.2 percent of original size [2025-04-29 11:01:25,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 505 treesize of output 611 Killed by 15