./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.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-counter-determinism.wvr.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 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:53:02,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:53:02,700 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:53:02,706 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:53:02,709 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:53:02,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:53:02,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:53:02,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:53:02,738 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:53:02,738 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:53:02,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:53:02,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:53:02,739 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:53:02,739 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:53:02,739 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:53:02,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:53:02,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:53:02,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:53:02,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:53:02,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:53:02,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:02,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:53:02,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:02,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:53:02,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:53:02,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:53:02,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:53:02,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:53:02,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:53:02,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:53:02,744 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 -> 981eae178b9cad0bb64b87dda8360f4f1e2e23d7b9d396f9db2ad5a6977098c4 [2025-01-10 06:53:03,041 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:53:03,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:53:03,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:53:03,053 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:53:03,053 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:53:03,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-01-10 06:53:04,365 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7732df32/017a308699ac43fc8c858503074f2cb6/FLAG806758c55 [2025-01-10 06:53:04,647 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:53:04,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-counter-determinism.wvr.c [2025-01-10 06:53:04,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7732df32/017a308699ac43fc8c858503074f2cb6/FLAG806758c55 [2025-01-10 06:53:04,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d7732df32/017a308699ac43fc8c858503074f2cb6 [2025-01-10 06:53:04,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:53:04,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:53:04,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:04,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:53:04,719 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:53:04,720 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:04,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a6a1aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04, skipping insertion in model container [2025-01-10 06:53:04,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:04,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:53:04,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:04,912 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:53:04,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:53:04,946 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:53:04,947 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04 WrapperNode [2025-01-10 06:53:04,948 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:53:04,950 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:04,950 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:53:04,950 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:53:04,956 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:53:04" (1/1) ... [2025-01-10 06:53:04,962 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:53:04" (1/1) ... [2025-01-10 06:53:04,986 INFO L138 Inliner]: procedures = 20, calls = 14, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 98 [2025-01-10 06:53:04,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:53:04,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:53:04,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:53:04,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:53:04,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:04,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,023 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 06:53:05,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,027 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,036 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:53:05,039 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:53:05,039 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:53:05,039 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:53:05,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (1/1) ... [2025-01-10 06:53:05,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:53:05,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:05,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:53:05,080 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:53:05,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:53:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:53:05,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:53:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:53:05,106 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:53:05,106 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:53:05,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:53:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-10 06:53:05,107 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-10 06:53:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:53:05,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:53:05,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:53:05,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:53:05,186 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:53:05,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:53:05,410 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:53:05,410 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:53:05,554 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:53:05,554 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:53:05,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:05 BoogieIcfgContainer [2025-01-10 06:53:05,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:53:05,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:53:05,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:53:05,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:53:05,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:53:04" (1/3) ... [2025-01-10 06:53:05,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0ba1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:05, skipping insertion in model container [2025-01-10 06:53:05,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:53:04" (2/3) ... [2025-01-10 06:53:05,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0ba1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:53:05, skipping insertion in model container [2025-01-10 06:53:05,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:53:05" (3/3) ... [2025-01-10 06:53:05,566 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-counter-determinism.wvr.c [2025-01-10 06:53:05,580 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:53:05,581 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-counter-determinism.wvr.c that has 5 procedures, 59 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-01-10 06:53:05,582 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:53:05,663 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-10 06:53:05,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 06:53:05,739 INFO L124 PetriNetUnfolderBase]: 4/58 cut-off events. [2025-01-10 06:53:05,743 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-10 06:53:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 58 events. 4/58 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 161 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2025-01-10 06:53:05,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 62 transitions, 152 flow [2025-01-10 06:53:05,756 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 56 transitions, 133 flow [2025-01-10 06:53:05,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:53:05,780 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;@45114e6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:53:05,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 36 error locations. [2025-01-10 06:53:05,788 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:53:05,788 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-01-10 06:53:05,788 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:53:05,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:05,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:53:05,790 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:05,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:05,797 INFO L85 PathProgramCache]: Analyzing trace with hash 338881584, now seen corresponding path program 1 times [2025-01-10 06:53:05,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:05,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263988902] [2025-01-10 06:53:05,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:05,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:05,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:53:05,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:53:05,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:05,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:05,952 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,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:05,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263988902] [2025-01-10 06:53:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263988902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:05,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:05,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770792853] [2025-01-10 06:53:05,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:05,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:05,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:05,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:05,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:06,000 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:06,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:06,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:06,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:06,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:09,281 INFO L124 PetriNetUnfolderBase]: 28409/42102 cut-off events. [2025-01-10 06:53:09,282 INFO L125 PetriNetUnfolderBase]: For 2048/2048 co-relation queries the response was YES. [2025-01-10 06:53:09,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80736 conditions, 42102 events. 28409/42102 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 2237. Compared 313705 event pairs, 13092 based on Foata normal form. 0/30533 useless extension candidates. Maximal degree in co-relation 75051. Up to 20574 conditions per place. [2025-01-10 06:53:09,840 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 70 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2025-01-10 06:53:09,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 88 transitions, 360 flow [2025-01-10 06:53:09,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 06:53:09,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6989247311827957 [2025-01-10 06:53:09,857 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 133 flow. Second operand 3 states and 130 transitions. [2025-01-10 06:53:09,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 88 transitions, 360 flow [2025-01-10 06:53:09,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 88 transitions, 338 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-10 06:53:09,894 INFO L231 Difference]: Finished difference. Result has 61 places, 57 transitions, 144 flow [2025-01-10 06:53:09,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=61, PETRI_TRANSITIONS=57} [2025-01-10 06:53:09,899 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -4 predicate places. [2025-01-10 06:53:09,901 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 57 transitions, 144 flow [2025-01-10 06:53:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:09,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:09,902 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:53:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:53:09,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash 338881585, now seen corresponding path program 1 times [2025-01-10 06:53:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:09,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151364937] [2025-01-10 06:53:09,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:09,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:09,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:53:09,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:53:09,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:09,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:09,982 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:09,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:09,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151364937] [2025-01-10 06:53:09,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151364937] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:09,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:09,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:09,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366102759] [2025-01-10 06:53:09,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:09,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:09,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:09,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:09,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:09,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 57 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:09,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:09,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:09,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:12,472 INFO L124 PetriNetUnfolderBase]: 27849/40900 cut-off events. [2025-01-10 06:53:12,473 INFO L125 PetriNetUnfolderBase]: For 5620/5620 co-relation queries the response was YES. [2025-01-10 06:53:12,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83883 conditions, 40900 events. 27849/40900 cut-off events. For 5620/5620 co-relation queries the response was YES. Maximal size of possible extension queue 1687. Compared 293746 event pairs, 7534 based on Foata normal form. 953/35158 useless extension candidates. Maximal degree in co-relation 44733. Up to 29137 conditions per place. [2025-01-10 06:53:12,773 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 71 selfloop transitions, 3 changer transitions 0/88 dead transitions. [2025-01-10 06:53:12,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 88 transitions, 361 flow [2025-01-10 06:53:12,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2025-01-10 06:53:12,777 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6881720430107527 [2025-01-10 06:53:12,777 INFO L175 Difference]: Start difference. First operand has 61 places, 57 transitions, 144 flow. Second operand 3 states and 128 transitions. [2025-01-10 06:53:12,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 88 transitions, 361 flow [2025-01-10 06:53:12,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 88 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:12,859 INFO L231 Difference]: Finished difference. Result has 62 places, 58 transitions, 155 flow [2025-01-10 06:53:12,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=155, PETRI_PLACES=62, PETRI_TRANSITIONS=58} [2025-01-10 06:53:12,860 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, -3 predicate places. [2025-01-10 06:53:12,860 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 58 transitions, 155 flow [2025-01-10 06:53:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 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:12,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:12,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:53:12,861 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:12,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:12,863 INFO L85 PathProgramCache]: Analyzing trace with hash -752298349, now seen corresponding path program 1 times [2025-01-10 06:53:12,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780058125] [2025-01-10 06:53:12,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:12,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:12,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:53:12,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:53:12,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:12,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:12,958 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:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:12,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780058125] [2025-01-10 06:53:12,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780058125] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:12,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:12,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:12,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849098909] [2025-01-10 06:53:12,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:12,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:12,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:12,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:12,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:12,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:12,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:12,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:12,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:12,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:15,808 INFO L124 PetriNetUnfolderBase]: 43625/64390 cut-off events. [2025-01-10 06:53:15,809 INFO L125 PetriNetUnfolderBase]: For 15222/15222 co-relation queries the response was YES. [2025-01-10 06:53:15,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133438 conditions, 64390 events. 43625/64390 cut-off events. For 15222/15222 co-relation queries the response was YES. Maximal size of possible extension queue 2711. Compared 486329 event pairs, 25311 based on Foata normal form. 1154/54159 useless extension candidates. Maximal degree in co-relation 61087. Up to 45801 conditions per place. [2025-01-10 06:53:16,062 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 105 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-01-10 06:53:16,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 121 transitions, 527 flow [2025-01-10 06:53:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:16,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:16,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2025-01-10 06:53:16,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6895161290322581 [2025-01-10 06:53:16,066 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 155 flow. Second operand 4 states and 171 transitions. [2025-01-10 06:53:16,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 121 transitions, 527 flow [2025-01-10 06:53:16,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 121 transitions, 524 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:16,083 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 181 flow [2025-01-10 06:53:16,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2025-01-10 06:53:16,084 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 1 predicate places. [2025-01-10 06:53:16,084 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 181 flow [2025-01-10 06:53:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:16,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:16,084 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:16,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 06:53:16,085 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:16,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:16,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1382705420, now seen corresponding path program 1 times [2025-01-10 06:53:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590048098] [2025-01-10 06:53:16,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:16,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:16,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:16,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:16,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:16,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:16,170 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:16,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:16,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590048098] [2025-01-10 06:53:16,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590048098] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:16,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:16,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:16,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868214497] [2025-01-10 06:53:16,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:16,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:16,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:16,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:16,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:16,172 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:16,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:16,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:16,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:16,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:18,570 INFO L124 PetriNetUnfolderBase]: 38050/57086 cut-off events. [2025-01-10 06:53:18,571 INFO L125 PetriNetUnfolderBase]: For 23295/24231 co-relation queries the response was YES. [2025-01-10 06:53:18,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128828 conditions, 57086 events. 38050/57086 cut-off events. For 23295/24231 co-relation queries the response was YES. Maximal size of possible extension queue 2380. Compared 431347 event pairs, 18817 based on Foata normal form. 0/49054 useless extension candidates. Maximal degree in co-relation 76258. Up to 29564 conditions per place. [2025-01-10 06:53:19,137 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 76 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-01-10 06:53:19,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 453 flow [2025-01-10 06:53:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:19,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2025-01-10 06:53:19,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-01-10 06:53:19,139 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 181 flow. Second operand 3 states and 124 transitions. [2025-01-10 06:53:19,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 453 flow [2025-01-10 06:53:19,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:19,161 INFO L231 Difference]: Finished difference. Result has 68 places, 62 transitions, 202 flow [2025-01-10 06:53:19,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=62} [2025-01-10 06:53:19,162 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 3 predicate places. [2025-01-10 06:53:19,162 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 202 flow [2025-01-10 06:53:19,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:19,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:19,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:19,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:53:19,163 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:19,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:19,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1382705421, now seen corresponding path program 1 times [2025-01-10 06:53:19,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:19,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212004690] [2025-01-10 06:53:19,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:19,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:19,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:53:19,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:53:19,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:19,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:19,221 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:19,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:19,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212004690] [2025-01-10 06:53:19,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212004690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:19,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:19,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:53:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016796164] [2025-01-10 06:53:19,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:19,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:19,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:19,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:19,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:19,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:19,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:19,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:19,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:19,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:21,774 INFO L124 PetriNetUnfolderBase]: 37476/56046 cut-off events. [2025-01-10 06:53:21,775 INFO L125 PetriNetUnfolderBase]: For 29239/31111 co-relation queries the response was YES. [2025-01-10 06:53:21,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132687 conditions, 56046 events. 37476/56046 cut-off events. For 29239/31111 co-relation queries the response was YES. Maximal size of possible extension queue 1783. Compared 409209 event pairs, 10252 based on Foata normal form. 1332/55585 useless extension candidates. Maximal degree in co-relation 77752. Up to 38504 conditions per place. [2025-01-10 06:53:22,380 INFO L140 encePairwiseOnDemand]: 57/62 looper letters, 76 selfloop transitions, 3 changer transitions 1/94 dead transitions. [2025-01-10 06:53:22,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 94 transitions, 471 flow [2025-01-10 06:53:22,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2025-01-10 06:53:22,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6559139784946236 [2025-01-10 06:53:22,382 INFO L175 Difference]: Start difference. First operand has 68 places, 62 transitions, 202 flow. Second operand 3 states and 122 transitions. [2025-01-10 06:53:22,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 94 transitions, 471 flow [2025-01-10 06:53:22,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 94 transitions, 463 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:22,471 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 213 flow [2025-01-10 06:53:22,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2025-01-10 06:53:22,472 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 4 predicate places. [2025-01-10 06:53:22,472 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 213 flow [2025-01-10 06:53:22,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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:22,472 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:22,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:22,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:53:22,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:22,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:22,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1655247213, now seen corresponding path program 1 times [2025-01-10 06:53:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:22,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279966929] [2025-01-10 06:53:22,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:22,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:22,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:53:22,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:53:22,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:22,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:22,553 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:22,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:22,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279966929] [2025-01-10 06:53:22,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279966929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:22,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:22,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:53:22,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775960419] [2025-01-10 06:53:22,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:22,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:22,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:22,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:22,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:22,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 62 [2025-01-10 06:53:22,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:22,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:22,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 62 [2025-01-10 06:53:22,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:26,786 INFO L124 PetriNetUnfolderBase]: 58559/87003 cut-off events. [2025-01-10 06:53:26,787 INFO L125 PetriNetUnfolderBase]: For 54714/57060 co-relation queries the response was YES. [2025-01-10 06:53:26,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213365 conditions, 87003 events. 58559/87003 cut-off events. For 54714/57060 co-relation queries the response was YES. Maximal size of possible extension queue 2400. Compared 658653 event pairs, 15866 based on Foata normal form. 3434/88766 useless extension candidates. Maximal degree in co-relation 81967. Up to 31457 conditions per place. [2025-01-10 06:53:27,293 INFO L140 encePairwiseOnDemand]: 55/62 looper letters, 119 selfloop transitions, 7 changer transitions 0/140 dead transitions. [2025-01-10 06:53:27,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 140 transitions, 725 flow [2025-01-10 06:53:27,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2025-01-10 06:53:27,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7419354838709677 [2025-01-10 06:53:27,294 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 213 flow. Second operand 4 states and 184 transitions. [2025-01-10 06:53:27,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 140 transitions, 725 flow [2025-01-10 06:53:27,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 140 transitions, 718 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:27,313 INFO L231 Difference]: Finished difference. Result has 73 places, 68 transitions, 275 flow [2025-01-10 06:53:27,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=73, PETRI_TRANSITIONS=68} [2025-01-10 06:53:27,313 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 8 predicate places. [2025-01-10 06:53:27,314 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 68 transitions, 275 flow [2025-01-10 06:53:27,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 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:27,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:27,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:27,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:53:27,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:27,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:27,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1635028783, now seen corresponding path program 1 times [2025-01-10 06:53:27,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:27,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307954888] [2025-01-10 06:53:27,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:27,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:27,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:53:27,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:53:27,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:27,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:27,365 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:27,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:27,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307954888] [2025-01-10 06:53:27,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307954888] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:27,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:27,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:27,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202724843] [2025-01-10 06:53:27,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:27,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:27,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:27,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:27,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:27,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:27,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 68 transitions, 275 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:27,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:27,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:27,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:35,245 INFO L124 PetriNetUnfolderBase]: 93759/136706 cut-off events. [2025-01-10 06:53:35,245 INFO L125 PetriNetUnfolderBase]: For 128663/134365 co-relation queries the response was YES. [2025-01-10 06:53:35,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351495 conditions, 136706 events. 93759/136706 cut-off events. For 128663/134365 co-relation queries the response was YES. Maximal size of possible extension queue 3692. Compared 1059832 event pairs, 53447 based on Foata normal form. 2630/134930 useless extension candidates. Maximal degree in co-relation 169828. Up to 97029 conditions per place. [2025-01-10 06:53:36,073 INFO L140 encePairwiseOnDemand]: 56/62 looper letters, 131 selfloop transitions, 4 changer transitions 0/147 dead transitions. [2025-01-10 06:53:36,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 147 transitions, 915 flow [2025-01-10 06:53:36,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:53:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:53:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 06:53:36,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6612903225806451 [2025-01-10 06:53:36,074 INFO L175 Difference]: Start difference. First operand has 73 places, 68 transitions, 275 flow. Second operand 4 states and 164 transitions. [2025-01-10 06:53:36,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 147 transitions, 915 flow [2025-01-10 06:53:36,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 915 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:53:36,224 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 304 flow [2025-01-10 06:53:36,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=62, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2025-01-10 06:53:36,225 INFO L279 CegarLoopForPetriNet]: 65 programPoint places, 13 predicate places. [2025-01-10 06:53:36,225 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 304 flow [2025-01-10 06:53:36,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:36,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:36,226 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:36,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:53:36,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 33 more)] === [2025-01-10 06:53:36,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:36,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1554685487, now seen corresponding path program 1 times [2025-01-10 06:53:36,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:36,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283296733] [2025-01-10 06:53:36,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:36,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:36,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:53:36,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:53:36,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:36,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:36,274 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:36,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:36,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283296733] [2025-01-10 06:53:36,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283296733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:36,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:36,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:36,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690221560] [2025-01-10 06:53:36,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:36,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:36,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:36,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:36,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:36,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 62 [2025-01-10 06:53:36,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 304 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:36,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:36,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 62 [2025-01-10 06:53:36,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand