./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 798a7b37 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 ../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.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 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:27:26,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:27:26,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:27:26,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:27:26,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:27:27,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:27:27,016 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:27:27,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:27:27,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:27:27,018 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:27:27,018 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:27:27,018 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:27:27,019 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:27:27,019 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:27:27,019 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:27:27,020 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:27:27,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:27:27,021 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:27:27,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:27,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:27:27,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:27:27,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:27:27,023 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 -> 5bf746ef76f8c8352051d8eb5f02d7a475e14d238622e290fcb51135a3348206 [2025-03-04 15:27:27,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:27:27,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:27:27,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:27:27,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:27:27,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:27:27,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-04 15:27:28,412 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b726d70/b96405429b66467fbb5e613dfb9948ff/FLAG1a9699266 [2025-03-04 15:27:28,683 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:27:28,686 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-2.wvr-bad.c [2025-03-04 15:27:28,694 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b726d70/b96405429b66467fbb5e613dfb9948ff/FLAG1a9699266 [2025-03-04 15:27:28,980 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09b726d70/b96405429b66467fbb5e613dfb9948ff [2025-03-04 15:27:28,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:27:28,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:27:28,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:28,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:27:28,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:27:28,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:28" (1/1) ... [2025-03-04 15:27:28,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f99718 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:28, skipping insertion in model container [2025-03-04 15:27:28,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:27:28" (1/1) ... [2025-03-04 15:27:29,007 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:27:29,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:29,183 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:27:29,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:27:29,229 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:27:29,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29 WrapperNode [2025-03-04 15:27:29,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:27:29,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:29,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:27:29,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:27:29,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,244 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,266 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 479 [2025-03-04 15:27:29,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:27:29,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:27:29,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:27:29,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:27:29,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,277 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,304 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-03-04 15:27:29,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:27:29,321 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:27:29,321 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:27:29,321 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:27:29,321 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (1/1) ... [2025-03-04 15:27:29,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:27:29,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:29,355 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-03-04 15:27:29,360 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-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:27:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:27:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:27:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 15:27:29,376 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:27:29,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:27:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:27:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:27:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:27:29,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:27:29,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:27:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:27:29,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:27:29,379 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:27:29,459 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:27:29,461 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:27:29,922 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:27:29,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:27:30,313 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:27:30,313 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:27:30,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:30 BoogieIcfgContainer [2025-03-04 15:27:30,313 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:27:30,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:27:30,315 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:27:30,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:27:30,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:27:28" (1/3) ... [2025-03-04 15:27:30,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:30, skipping insertion in model container [2025-03-04 15:27:30,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:27:29" (2/3) ... [2025-03-04 15:27:30,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3764828c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:27:30, skipping insertion in model container [2025-03-04 15:27:30,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:27:30" (3/3) ... [2025-03-04 15:27:30,323 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-2.wvr-bad.c [2025-03-04 15:27:30,337 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:27:30,339 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-03-04 15:27:30,339 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:27:30,411 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 15:27:30,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 122 transitions, 272 flow [2025-03-04 15:27:30,488 INFO L124 PetriNetUnfolderBase]: 24/118 cut-off events. [2025-03-04 15:27:30,490 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 15:27:30,496 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 13. Compared 400 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-03-04 15:27:30,497 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 122 transitions, 272 flow [2025-03-04 15:27:30,501 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 116 transitions, 253 flow [2025-03-04 15:27:30,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:27:30,519 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;@68ccbdf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:27:30,520 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-04 15:27:30,525 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:27:30,525 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:27:30,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:27:30,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:30,526 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:27:30,526 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:30,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:30,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1322049, now seen corresponding path program 1 times [2025-03-04 15:27:30,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:30,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213652045] [2025-03-04 15:27:30,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:30,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:30,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:27:30,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:27:30,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:30,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:30,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213652045] [2025-03-04 15:27:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213652045] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:30,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:30,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:30,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463162619] [2025-03-04 15:27:30,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:30,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:27:30,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:30,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:27:30,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:27:30,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-03-04 15:27:30,831 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-03-04 15:27:30,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:30,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-03-04 15:27:30,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:34,318 INFO L124 PetriNetUnfolderBase]: 40188/53468 cut-off events. [2025-03-04 15:27:34,318 INFO L125 PetriNetUnfolderBase]: For 1465/1465 co-relation queries the response was YES. [2025-03-04 15:27:34,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103197 conditions, 53468 events. 40188/53468 cut-off events. For 1465/1465 co-relation queries the response was YES. Maximal size of possible extension queue 3602. Compared 345290 event pairs, 26584 based on Foata normal form. 4/33216 useless extension candidates. Maximal degree in co-relation 99324. Up to 48058 conditions per place. [2025-03-04 15:27:34,659 INFO L140 encePairwiseOnDemand]: 85/122 looper letters, 71 selfloop transitions, 13 changer transitions 0/112 dead transitions. [2025-03-04 15:27:34,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 112 transitions, 413 flow [2025-03-04 15:27:34,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:27:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:27:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2025-03-04 15:27:34,671 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48360655737704916 [2025-03-04 15:27:34,673 INFO L175 Difference]: Start difference. First operand has 105 places, 116 transitions, 253 flow. Second operand 4 states and 236 transitions. [2025-03-04 15:27:34,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 112 transitions, 413 flow [2025-03-04 15:27:34,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 112 transitions, 400 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-04 15:27:34,807 INFO L231 Difference]: Finished difference. Result has 92 places, 112 transitions, 324 flow [2025-03-04 15:27:34,809 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-03-04 15:27:34,812 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -13 predicate places. [2025-03-04 15:27:34,813 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 112 transitions, 324 flow [2025-03-04 15:27:34,813 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-03-04 15:27:34,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:34,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:27:34,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:27:34,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:34,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:34,816 INFO L85 PathProgramCache]: Analyzing trace with hash 731676278, now seen corresponding path program 1 times [2025-03-04 15:27:34,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:34,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691057873] [2025-03-04 15:27:34,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:34,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:34,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:34,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:34,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:34,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:34,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:34,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691057873] [2025-03-04 15:27:34,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691057873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922409399] [2025-03-04 15:27:34,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:34,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:34,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:34,971 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-03-04 15:27:35,072 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-03-04 15:27:35,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:27:35,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:27:35,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:35,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:35,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:35,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:35,188 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:27:35,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922409399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:35,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:27:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:27:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768831824] [2025-03-04 15:27:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:35,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:27:35,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:35,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:27:35,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:27:35,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-03-04 15:27:35,217 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-03-04 15:27:35,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:35,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-03-04 15:27:35,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:38,334 INFO L124 PetriNetUnfolderBase]: 40188/53464 cut-off events. [2025-03-04 15:27:38,334 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2025-03-04 15:27:38,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102742 conditions, 53464 events. 40188/53464 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 3602. Compared 345225 event pairs, 26584 based on Foata normal form. 4/33219 useless extension candidates. Maximal degree in co-relation 102646. Up to 48038 conditions per place. [2025-03-04 15:27:38,602 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 58 selfloop transitions, 22 changer transitions 0/108 dead transitions. [2025-03-04 15:27:38,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 108 transitions, 468 flow [2025-03-04 15:27:38,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:27:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:27:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2025-03-04 15:27:38,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3770491803278688 [2025-03-04 15:27:38,607 INFO L175 Difference]: Start difference. First operand has 92 places, 112 transitions, 324 flow. Second operand 6 states and 276 transitions. [2025-03-04 15:27:38,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 108 transitions, 468 flow [2025-03-04 15:27:38,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 108 transitions, 468 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:27:38,610 INFO L231 Difference]: Finished difference. Result has 93 places, 108 transitions, 352 flow [2025-03-04 15:27:38,611 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-03-04 15:27:38,611 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -12 predicate places. [2025-03-04 15:27:38,612 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 108 transitions, 352 flow [2025-03-04 15:27:38,612 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-03-04 15:27:38,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:38,612 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:27:38,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:27:38,814 WARN L453 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-03-04 15:27:38,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1207129365, now seen corresponding path program 1 times [2025-03-04 15:27:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-03-04 15:27:38,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:38,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:38,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:38,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:38,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:38,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:38,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:38,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514048941] [2025-03-04 15:27:38,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514048941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:27:38,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309818750] [2025-03-04 15:27:38,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:38,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:27:38,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:27:38,916 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-03-04 15:27:38,917 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-03-04 15:27:38,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:27:38,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:27:38,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:38,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:38,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:27:38,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:27:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:39,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:27:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:39,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309818750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:27:39,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:27:39,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:27:39,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541864404] [2025-03-04 15:27:39,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:27:39,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:27:39,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:39,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:27:39,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:27:39,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 122 [2025-03-04 15:27:39,082 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-03-04 15:27:39,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:39,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 122 [2025-03-04 15:27:39,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:41,853 INFO L124 PetriNetUnfolderBase]: 40200/53512 cut-off events. [2025-03-04 15:27:41,853 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2025-03-04 15:27:41,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102930 conditions, 53512 events. 40200/53512 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 3602. Compared 345403 event pairs, 26584 based on Foata normal form. 12/33276 useless extension candidates. Maximal degree in co-relation 102648. Up to 48057 conditions per place. [2025-03-04 15:27:42,203 INFO L140 encePairwiseOnDemand]: 105/122 looper letters, 67 selfloop transitions, 49 changer transitions 0/144 dead transitions. [2025-03-04 15:27:42,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 144 transitions, 818 flow [2025-03-04 15:27:42,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:27:42,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:27:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 448 transitions. [2025-03-04 15:27:42,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36721311475409835 [2025-03-04 15:27:42,206 INFO L175 Difference]: Start difference. First operand has 93 places, 108 transitions, 352 flow. Second operand 10 states and 448 transitions. [2025-03-04 15:27:42,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 144 transitions, 818 flow [2025-03-04 15:27:42,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 144 transitions, 710 flow, removed 20 selfloop flow, removed 5 redundant places. [2025-03-04 15:27:42,210 INFO L231 Difference]: Finished difference. Result has 100 places, 144 transitions, 642 flow [2025-03-04 15:27:42,210 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-03-04 15:27:42,210 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -5 predicate places. [2025-03-04 15:27:42,210 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 144 transitions, 642 flow [2025-03-04 15:27:42,211 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-03-04 15:27:42,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:42,211 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:42,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:27:42,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:27:42,412 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:42,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:42,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1015030347, now seen corresponding path program 1 times [2025-03-04 15:27:42,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:42,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199518531] [2025-03-04 15:27:42,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:42,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:42,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:27:42,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:27:42,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:42,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:42,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:42,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199518531] [2025-03-04 15:27:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199518531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:42,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:27:42,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546061145] [2025-03-04 15:27:42,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:42,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:42,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:42,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:42,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 122 [2025-03-04 15:27:42,528 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-03-04 15:27:42,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:42,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 122 [2025-03-04 15:27:42,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:47,355 INFO L124 PetriNetUnfolderBase]: 68337/91069 cut-off events. [2025-03-04 15:27:47,355 INFO L125 PetriNetUnfolderBase]: For 812/812 co-relation queries the response was YES. [2025-03-04 15:27:47,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175384 conditions, 91069 events. 68337/91069 cut-off events. For 812/812 co-relation queries the response was YES. Maximal size of possible extension queue 5146. Compared 610998 event pairs, 21415 based on Foata normal form. 2363/60168 useless extension candidates. Maximal degree in co-relation 175255. Up to 50735 conditions per place. [2025-03-04 15:27:48,106 INFO L140 encePairwiseOnDemand]: 112/122 looper letters, 150 selfloop transitions, 4 changer transitions 0/186 dead transitions. [2025-03-04 15:27:48,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 186 transitions, 1040 flow [2025-03-04 15:27:48,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:48,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:48,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 232 transitions. [2025-03-04 15:27:48,110 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6338797814207651 [2025-03-04 15:27:48,111 INFO L175 Difference]: Start difference. First operand has 100 places, 144 transitions, 642 flow. Second operand 3 states and 232 transitions. [2025-03-04 15:27:48,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 186 transitions, 1040 flow [2025-03-04 15:27:48,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 186 transitions, 990 flow, removed 12 selfloop flow, removed 2 redundant places. [2025-03-04 15:27:48,115 INFO L231 Difference]: Finished difference. Result has 101 places, 147 transitions, 628 flow [2025-03-04 15:27:48,116 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-03-04 15:27:48,119 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -4 predicate places. [2025-03-04 15:27:48,119 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 147 transitions, 628 flow [2025-03-04 15:27:48,119 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-03-04 15:27:48,119 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:48,119 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:48,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:27:48,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:48,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1401172034, now seen corresponding path program 1 times [2025-03-04 15:27:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:48,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259707416] [2025-03-04 15:27:48,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:27:48,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:27:48,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:48,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259707416] [2025-03-04 15:27:48,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259707416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:48,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:48,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:48,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467331029] [2025-03-04 15:27:48,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:48,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:48,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:48,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:48,198 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 122 [2025-03-04 15:27:48,198 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-03-04 15:27:48,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:48,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 122 [2025-03-04 15:27:48,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:27:54,601 INFO L124 PetriNetUnfolderBase]: 97694/129568 cut-off events. [2025-03-04 15:27:54,601 INFO L125 PetriNetUnfolderBase]: For 9854/10022 co-relation queries the response was YES. [2025-03-04 15:27:54,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269418 conditions, 129568 events. 97694/129568 cut-off events. For 9854/10022 co-relation queries the response was YES. Maximal size of possible extension queue 3483. Compared 822690 event pairs, 31944 based on Foata normal form. 0/98062 useless extension candidates. Maximal degree in co-relation 269294. Up to 66408 conditions per place. [2025-03-04 15:27:55,416 INFO L140 encePairwiseOnDemand]: 117/122 looper letters, 155 selfloop transitions, 4 changer transitions 0/184 dead transitions. [2025-03-04 15:27:55,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 184 transitions, 1032 flow [2025-03-04 15:27:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:27:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:27:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-03-04 15:27:55,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5683060109289617 [2025-03-04 15:27:55,418 INFO L175 Difference]: Start difference. First operand has 101 places, 147 transitions, 628 flow. Second operand 3 states and 208 transitions. [2025-03-04 15:27:55,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 184 transitions, 1032 flow [2025-03-04 15:27:55,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 184 transitions, 1028 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:27:55,427 INFO L231 Difference]: Finished difference. Result has 104 places, 148 transitions, 646 flow [2025-03-04 15:27:55,428 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-03-04 15:27:55,428 INFO L279 CegarLoopForPetriNet]: 105 programPoint places, -1 predicate places. [2025-03-04 15:27:55,430 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 148 transitions, 646 flow [2025-03-04 15:27:55,430 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-03-04 15:27:55,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:27:55,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:27:55,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:27:55,431 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 57 more)] === [2025-03-04 15:27:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:27:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1614350871, now seen corresponding path program 1 times [2025-03-04 15:27:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:27:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645877494] [2025-03-04 15:27:55,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:27:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:27:55,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:27:55,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:27:55,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:27:55,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:27:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:27:55,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:27:55,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645877494] [2025-03-04 15:27:55,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645877494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:27:55,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:27:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:27:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334966616] [2025-03-04 15:27:55,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:27:55,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:27:55,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:27:55,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:27:55,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:27:55,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 122 [2025-03-04 15:27:55,540 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-03-04 15:27:55,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:27:55,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 122 [2025-03-04 15:27:55,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand