./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:40,523 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:40,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:52:40,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:40,589 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:40,613 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:40,614 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:40,614 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:40,615 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:40,615 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:40,616 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:40,616 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:40,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:40,616 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:40,617 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:40,617 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:40,617 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:40,617 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:40,618 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2025-01-10 06:52:40,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:40,861 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:40,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:40,863 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:40,863 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:40,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-01-10 06:52:42,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e069fab0c/e8f0c6288187428abbb5a8c20b01ada8/FLAGeb8f62495 [2025-01-10 06:52:42,393 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:42,394 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-01-10 06:52:42,403 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e069fab0c/e8f0c6288187428abbb5a8c20b01ada8/FLAGeb8f62495 [2025-01-10 06:52:42,648 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e069fab0c/e8f0c6288187428abbb5a8c20b01ada8 [2025-01-10 06:52:42,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:42,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:42,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:42,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:42,656 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:42,657 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c938375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42, skipping insertion in model container [2025-01-10 06:52:42,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,672 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:42,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:42,839 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:42,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:42,890 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:42,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42 WrapperNode [2025-01-10 06:52:42,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:42,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:42,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:42,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:42,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,908 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,944 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 479 [2025-01-10 06:52:42,945 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:42,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:42,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:42,946 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:42,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,959 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,995 INFO L175 MemorySlicer]: Split 18 memory accesses to 2 slices as follows [2, 16]. 89 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 4 writes are split as follows [0, 4]. [2025-01-10 06:52:42,996 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:42,996 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,016 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,030 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:43,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:43,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:43,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:43,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (1/1) ... [2025-01-10 06:52:43,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:43,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:43,075 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-10 06:52:43,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:52:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 06:52:43,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:43,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:43,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:52:43,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:52:43,108 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:52:43,229 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:43,231 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:43,737 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:43,737 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:44,227 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:44,227 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-10 06:52:44,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:44 BoogieIcfgContainer [2025-01-10 06:52:44,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:44,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:44,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:44,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:44,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:42" (1/3) ... [2025-01-10 06:52:44,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af9cdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:44, skipping insertion in model container [2025-01-10 06:52:44,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:42" (2/3) ... [2025-01-10 06:52:44,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af9cdf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:44, skipping insertion in model container [2025-01-10 06:52:44,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:44" (3/3) ... [2025-01-10 06:52:44,236 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-01-10 06:52:44,249 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:44,251 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-2.wvr-bad.c that has 5 procedures, 99 locations, 1 initial locations, 8 loop locations, and 32 error locations. [2025-01-10 06:52:44,251 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:44,328 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:52:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 122 transitions, 272 flow [2025-01-10 06:52:44,403 INFO L124 PetriNetUnfolderBase]: 24/118 cut-off events. [2025-01-10 06:52:44,404 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:52:44,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 118 events. 24/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 406 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 102. Up to 8 conditions per place. [2025-01-10 06:52:44,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 122 transitions, 272 flow [2025-01-10 06:52:44,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 116 transitions, 253 flow [2025-01-10 06:52:44,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:44,424 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ebeda04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:44,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-01-10 06:52:44,429 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:44,429 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:52:44,429 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:44,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:44,429 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:52:44,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:52:44,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1426215, now seen corresponding path program 1 times [2025-01-10 06:52:44,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:44,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311007847] [2025-01-10 06:52:44,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:44,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:44,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:52:44,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:52:44,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:44,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:44,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:44,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:44,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311007847] [2025-01-10 06:52:44,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311007847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:44,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:44,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:44,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731843913] [2025-01-10 06:52:44,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:44,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:44,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:44,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:44,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:44,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-01-10 06:52:44,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 116 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:44,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:44,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-01-10 06:52:44,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:48,560 INFO L124 PetriNetUnfolderBase]: 40101/53128 cut-off events. [2025-01-10 06:52:48,560 INFO L125 PetriNetUnfolderBase]: For 1341/1341 co-relation queries the response was YES. [2025-01-10 06:52:48,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102857 conditions, 53128 events. 40101/53128 cut-off events. For 1341/1341 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 339968 event pairs, 26584 based on Foata normal form. 4/33268 useless extension candidates. Maximal degree in co-relation 98984. Up to 48058 conditions per place. [2025-01-10 06:52:48,985 INFO L140 encePairwiseOnDemand]: 85/122 looper letters, 71 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2025-01-10 06:52:48,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 112 transitions, 413 flow [2025-01-10 06:52:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:48,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-01-10 06:52:48,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2025-01-10 06:52:48,996 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 253 flow. Second operand 4 states and 236 transitions. [2025-01-10 06:52:48,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 112 transitions, 413 flow [2025-01-10 06:52:49,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 112 transitions, 400 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:52:49,113 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 324 flow [2025-01-10 06:52:49,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=324, PETRI_PLACES=92, PETRI_TRANSITIONS=112} [2025-01-10 06:52:49,246 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -13 predicate places. [2025-01-10 06:52:49,247 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 324 flow [2025-01-10 06:52:49,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:49,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:49,247 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:52:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:52:49,248 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:52:49,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -459855499, now seen corresponding path program 1 times [2025-01-10 06:52:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:49,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557736689] [2025-01-10 06:52:49,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:49,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:49,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:49,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:49,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:49,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:49,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557736689] [2025-01-10 06:52:49,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557736689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:49,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64313067] [2025-01-10 06:52:49,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:49,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:49,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:49,402 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:52:49,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-10 06:52:49,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:49,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:49,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:49,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:49,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:49,492 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:49,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:49,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64313067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:49,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:49,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:52:49,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023580001] [2025-01-10 06:52:49,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:49,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:52:49,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:49,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:52:49,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:52:49,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-01-10 06:52:49,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 112 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:49,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:49,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-01-10 06:52:49,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:53,328 INFO L124 PetriNetUnfolderBase]: 40101/53124 cut-off events. [2025-01-10 06:52:53,329 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2025-01-10 06:52:53,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102402 conditions, 53124 events. 40101/53124 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 339886 event pairs, 26584 based on Foata normal form. 4/33271 useless extension candidates. Maximal degree in co-relation 102306. Up to 48038 conditions per place. [2025-01-10 06:52:53,784 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 58 selfloop transitions, 22 changer transitions 0/108 dead transitions. [2025-01-10 06:52:53,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 468 flow [2025-01-10 06:52:53,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:52:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:52:53,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-01-10 06:52:53,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3770491803278688 [2025-01-10 06:52:53,790 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 324 flow. Second operand 6 states and 276 transitions. [2025-01-10 06:52:53,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 468 flow [2025-01-10 06:52:53,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:52:53,793 INFO L231 Difference]: Finished difference. Result has 93 places, 108 transitions, 352 flow [2025-01-10 06:52:53,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=93, PETRI_TRANSITIONS=108} [2025-01-10 06:52:53,794 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-01-10 06:52:53,794 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 108 transitions, 352 flow [2025-01-10 06:52:53,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:53,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:53,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:52:53,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:52:53,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:53,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:52:53,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:53,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1370617124, now seen corresponding path program 1 times [2025-01-10 06:52:53,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:53,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575914750] [2025-01-10 06:52:53,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:53,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:54,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:54,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:54,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:54,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:54,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:54,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575914750] [2025-01-10 06:52:54,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575914750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:54,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034237068] [2025-01-10 06:52:54,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:54,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:54,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:54,096 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:52:54,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-10 06:52:54,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:54,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:54,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:54,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:54,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:54,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:54,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:54,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:54,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034237068] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:54,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:54,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:52:54,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003852591] [2025-01-10 06:52:54,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:54,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:52:54,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:54,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:52:54,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:52:54,257 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-01-10 06:52:54,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 108 transitions, 352 flow. Second operand has 12 states, 12 states have (on average 33.083333333333336) internal successors, (397), 12 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:54,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:54,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-01-10 06:52:54,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:57,833 INFO L124 PetriNetUnfolderBase]: 40113/53172 cut-off events. [2025-01-10 06:52:57,833 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2025-01-10 06:52:57,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102590 conditions, 53172 events. 40113/53172 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 340652 event pairs, 26584 based on Foata normal form. 12/33328 useless extension candidates. Maximal degree in co-relation 102308. Up to 48057 conditions per place. [2025-01-10 06:52:58,129 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 67 selfloop transitions, 49 changer transitions 0/144 dead transitions. [2025-01-10 06:52:58,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 144 transitions, 818 flow [2025-01-10 06:52:58,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:52:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:52:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 448 transitions. [2025-01-10 06:52:58,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36721311475409835 [2025-01-10 06:52:58,135 INFO L175 Difference]: Start difference. First operand has 93 places, 108 transitions, 352 flow. Second operand 10 states and 448 transitions. [2025-01-10 06:52:58,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 144 transitions, 818 flow [2025-01-10 06:52:58,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 144 transitions, 710 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:58,144 INFO L231 Difference]: Finished difference. Result has 100 places, 144 transitions, 642 flow [2025-01-10 06:52:58,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=642, PETRI_PLACES=100, PETRI_TRANSITIONS=144} [2025-01-10 06:52:58,147 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -5 predicate places. [2025-01-10 06:52:58,147 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 144 transitions, 642 flow [2025-01-10 06:52:58,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.083333333333336) internal successors, (397), 12 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:58,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:58,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:58,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:52:58,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:58,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:52:58,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:58,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2057830854, now seen corresponding path program 1 times [2025-01-10 06:52:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:58,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284453629] [2025-01-10 06:52:58,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:58,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:52:58,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:52:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:58,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:52:58,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:58,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284453629] [2025-01-10 06:52:58,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284453629] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:58,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:58,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:52:58,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707846537] [2025-01-10 06:52:58,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:58,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:58,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:58,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:58,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:58,574 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 122 [2025-01-10 06:52:58,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 144 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:52:58,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:58,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 122 [2025-01-10 06:52:58,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:04,336 INFO L124 PetriNetUnfolderBase]: 68290/90889 cut-off events. [2025-01-10 06:53:04,337 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2025-01-10 06:53:04,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175204 conditions, 90889 events. 68290/90889 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 5135. Compared 608170 event pairs, 21433 based on Foata normal form. 2337/60221 useless extension candidates. Maximal degree in co-relation 175075. Up to 50735 conditions per place. [2025-01-10 06:53:05,192 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 150 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-01-10 06:53:05,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 186 transitions, 1040 flow [2025-01-10 06:53:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:05,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-01-10 06:53:05,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-01-10 06:53:05,196 INFO L175 Difference]: Start difference. First operand has 100 places, 144 transitions, 642 flow. Second operand 3 states and 232 transitions. [2025-01-10 06:53:05,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 186 transitions, 1040 flow [2025-01-10 06:53:05,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 186 transitions, 990 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:05,207 INFO L231 Difference]: Finished difference. Result has 101 places, 147 transitions, 628 flow [2025-01-10 06:53:05,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=101, PETRI_TRANSITIONS=147} [2025-01-10 06:53:05,208 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -4 predicate places. [2025-01-10 06:53:05,208 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 147 transitions, 628 flow [2025-01-10 06:53:05,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:05,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:05,209 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:05,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:53:05,209 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:53:05,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:05,209 INFO L85 PathProgramCache]: Analyzing trace with hash -631750431, now seen corresponding path program 1 times [2025-01-10 06:53:05,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:05,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099526046] [2025-01-10 06:53:05,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:05,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:05,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:05,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:05,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:05,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099526046] [2025-01-10 06:53:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099526046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:53:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651632327] [2025-01-10 06:53:05,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:05,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:05,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:05,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:05,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:05,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 122 [2025-01-10 06:53:05,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 147 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:05,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:05,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 122 [2025-01-10 06:53:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:12,846 INFO L124 PetriNetUnfolderBase]: 97640/129352 cut-off events. [2025-01-10 06:53:12,847 INFO L125 PetriNetUnfolderBase]: For 9837/9959 co-relation queries the response was YES. [2025-01-10 06:53:13,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269202 conditions, 129352 events. 97640/129352 cut-off events. For 9837/9959 co-relation queries the response was YES. Maximal size of possible extension queue 3454. Compared 818659 event pairs, 31944 based on Foata normal form. 0/98256 useless extension candidates. Maximal degree in co-relation 269078. Up to 66408 conditions per place. [2025-01-10 06:53:13,713 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 155 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2025-01-10 06:53:13,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 184 transitions, 1032 flow [2025-01-10 06:53:13,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:13,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-01-10 06:53:13,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2025-01-10 06:53:13,715 INFO L175 Difference]: Start difference. First operand has 101 places, 147 transitions, 628 flow. Second operand 3 states and 208 transitions. [2025-01-10 06:53:13,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 184 transitions, 1032 flow [2025-01-10 06:53:13,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 184 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:13,721 INFO L231 Difference]: Finished difference. Result has 104 places, 148 transitions, 646 flow [2025-01-10 06:53:13,721 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=104, PETRI_TRANSITIONS=148} [2025-01-10 06:53:13,724 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-01-10 06:53:13,724 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 148 transitions, 646 flow [2025-01-10 06:53:13,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:13,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:13,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:53:13,725 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-01-10 06:53:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1124723450, now seen corresponding path program 1 times [2025-01-10 06:53:13,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:13,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532353089] [2025-01-10 06:53:13,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:13,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:53:13,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:53:13,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:13,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:53:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532353089] [2025-01-10 06:53:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532353089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:13,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:13,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:53:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769804094] [2025-01-10 06:53:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:13,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:13,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:13,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:13,797 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 122 [2025-01-10 06:53:13,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 148 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:13,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:13,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 122 [2025-01-10 06:53:13,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand