./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/goblint-regression/04-mutex_51-mutex_ptr.i -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 676d96662ae61a9d27f232e6ef1f1837cf504ffa210b7be2fd6286f04a0fe098 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:36:07,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:36:07,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:36:07,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:36:07,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:36:07,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:36:07,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:36:07,791 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:36:07,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:36:07,791 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:36:07,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:36:07,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:36:07,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:36:07,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:36:07,793 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:36:07,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:36:07,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:36:07,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:36:07,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:36:07,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:36:07,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:36:07,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:36:07,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:36:07,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:36:07,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:36:07,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:36:07,796 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 -> 676d96662ae61a9d27f232e6ef1f1837cf504ffa210b7be2fd6286f04a0fe098 [2025-03-17 19:36:08,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:36:08,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:36:08,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:36:08,062 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:36:08,062 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:36:08,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.i [2025-03-17 19:36:09,259 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21d3f916/f8a331c0345647d0892ea580d08829ea/FLAG11d819a88 [2025-03-17 19:36:09,580 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:36:09,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_51-mutex_ptr.i [2025-03-17 19:36:09,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21d3f916/f8a331c0345647d0892ea580d08829ea/FLAG11d819a88 [2025-03-17 19:36:09,812 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b21d3f916/f8a331c0345647d0892ea580d08829ea [2025-03-17 19:36:09,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:36:09,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:36:09,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:36:09,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:36:09,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:36:09,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:09" (1/1) ... [2025-03-17 19:36:09,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183b31ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:09, skipping insertion in model container [2025-03-17 19:36:09,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:36:09" (1/1) ... [2025-03-17 19:36:09,852 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:36:10,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:36:10,203 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:36:10,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:36:10,278 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:36:10,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10 WrapperNode [2025-03-17 19:36:10,279 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:36:10,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:36:10,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:36:10,280 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:36:10,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,316 INFO L138 Inliner]: procedures = 262, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2025-03-17 19:36:10,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:36:10,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:36:10,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:36:10,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:36:10,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,325 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,342 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [5, 1]. The 2 writes are split as follows [0, 2]. [2025-03-17 19:36:10,342 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,342 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:36:10,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:36:10,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:36:10,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:36:10,355 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (1/1) ... [2025-03-17 19:36:10,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:36:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:36:10,377 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-17 19:36:10,379 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-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 19:36:10,395 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 19:36:10,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:36:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:36:10,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:36:10,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:36:10,397 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 19:36:10,518 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:36:10,519 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:36:10,700 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 19:36:10,700 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:36:10,885 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:36:10,886 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 19:36:10,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:10 BoogieIcfgContainer [2025-03-17 19:36:10,887 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:36:10,889 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:36:10,889 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:36:10,893 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:36:10,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:36:09" (1/3) ... [2025-03-17 19:36:10,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6e01a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:10, skipping insertion in model container [2025-03-17 19:36:10,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:36:10" (2/3) ... [2025-03-17 19:36:10,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b6e01a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:36:10, skipping insertion in model container [2025-03-17 19:36:10,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:10" (3/3) ... [2025-03-17 19:36:10,896 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_51-mutex_ptr.i [2025-03-17 19:36:10,907 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:36:10,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_51-mutex_ptr.i that has 2 procedures, 24 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-17 19:36:10,908 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 19:36:10,945 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-17 19:36:10,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 23 transitions, 53 flow [2025-03-17 19:36:10,998 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-17 19:36:11,000 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 19:36:11,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-17 19:36:11,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 23 transitions, 53 flow [2025-03-17 19:36:11,008 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 24 places, 20 transitions, 43 flow [2025-03-17 19:36:11,017 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:36:11,029 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;@2d911427, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:36:11,029 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-17 19:36:11,039 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 19:36:11,040 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-17 19:36:11,040 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:36:11,040 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:11,040 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:36:11,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:11,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:11,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1045505820, now seen corresponding path program 1 times [2025-03-17 19:36:11,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:11,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87277079] [2025-03-17 19:36:11,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:11,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:11,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:36:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:36:11,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:11,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:11,393 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-17 19:36:11,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:11,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87277079] [2025-03-17 19:36:11,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87277079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:11,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:11,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:11,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115730139] [2025-03-17 19:36:11,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:11,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:36:11,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:11,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:36:11,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:36:11,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-17 19:36:11,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 43 flow. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-17 19:36:11,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:11,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-17 19:36:11,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:11,588 INFO L124 PetriNetUnfolderBase]: 33/98 cut-off events. [2025-03-17 19:36:11,589 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 19:36:11,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 98 events. 33/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 7 based on Foata normal form. 6/101 useless extension candidates. Maximal degree in co-relation 176. Up to 55 conditions per place. [2025-03-17 19:36:11,591 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 22 selfloop transitions, 6 changer transitions 5/38 dead transitions. [2025-03-17 19:36:11,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 38 transitions, 145 flow [2025-03-17 19:36:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:36:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 19:36:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2025-03-17 19:36:11,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2025-03-17 19:36:11,603 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 43 flow. Second operand 6 states and 73 transitions. [2025-03-17 19:36:11,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 38 transitions, 145 flow [2025-03-17 19:36:11,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 38 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:11,609 INFO L231 Difference]: Finished difference. Result has 32 places, 23 transitions, 80 flow [2025-03-17 19:36:11,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2025-03-17 19:36:11,614 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2025-03-17 19:36:11,614 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 80 flow [2025-03-17 19:36:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-17 19:36:11,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:11,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:36:11,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:36:11,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:11,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1045604545, now seen corresponding path program 1 times [2025-03-17 19:36:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:11,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541580060] [2025-03-17 19:36:11,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:11,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:11,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:36:11,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:36:11,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:11,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:11,740 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-17 19:36:11,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:11,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541580060] [2025-03-17 19:36:11,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541580060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:11,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:11,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:36:11,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622785125] [2025-03-17 19:36:11,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:11,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:36:11,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:11,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:36:11,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:36:11,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 23 [2025-03-17 19:36:11,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 19:36:11,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:11,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 23 [2025-03-17 19:36:11,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:11,822 INFO L124 PetriNetUnfolderBase]: 26/91 cut-off events. [2025-03-17 19:36:11,823 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 19:36:11,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 91 events. 26/91 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 300 event pairs, 13 based on Foata normal form. 14/105 useless extension candidates. Maximal degree in co-relation 201. Up to 44 conditions per place. [2025-03-17 19:36:11,823 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 19 selfloop transitions, 5 changer transitions 4/33 dead transitions. [2025-03-17 19:36:11,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 33 transitions, 167 flow [2025-03-17 19:36:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:36:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 19:36:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2025-03-17 19:36:11,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5304347826086957 [2025-03-17 19:36:11,825 INFO L175 Difference]: Start difference. First operand has 32 places, 23 transitions, 80 flow. Second operand 5 states and 61 transitions. [2025-03-17 19:36:11,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 33 transitions, 167 flow [2025-03-17 19:36:11,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 33 transitions, 158 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:11,826 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 100 flow [2025-03-17 19:36:11,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2025-03-17 19:36:11,827 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 12 predicate places. [2025-03-17 19:36:11,827 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 100 flow [2025-03-17 19:36:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 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-17 19:36:11,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:11,827 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:11,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 19:36:11,828 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:11,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:11,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1545585417, now seen corresponding path program 1 times [2025-03-17 19:36:11,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:11,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764173981] [2025-03-17 19:36:11,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:11,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 19:36:11,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 19:36:11,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:11,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:11,945 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-17 19:36:11,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:11,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764173981] [2025-03-17 19:36:11,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764173981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:11,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:11,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:36:11,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105728078] [2025-03-17 19:36:11,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:11,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:36:11,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:11,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:36:11,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:36:11,946 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 23 [2025-03-17 19:36:11,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 19:36:11,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:11,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 23 [2025-03-17 19:36:11,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:11,988 INFO L124 PetriNetUnfolderBase]: 12/56 cut-off events. [2025-03-17 19:36:11,989 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-17 19:36:11,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 56 events. 12/56 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 137 event pairs, 3 based on Foata normal form. 6/62 useless extension candidates. Maximal degree in co-relation 136. Up to 26 conditions per place. [2025-03-17 19:36:11,990 INFO L140 encePairwiseOnDemand]: 19/23 looper letters, 17 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2025-03-17 19:36:11,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 156 flow [2025-03-17 19:36:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:36:11,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 19:36:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-03-17 19:36:11,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6086956521739131 [2025-03-17 19:36:11,991 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 100 flow. Second operand 3 states and 42 transitions. [2025-03-17 19:36:11,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 156 flow [2025-03-17 19:36:11,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 148 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:11,993 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 100 flow [2025-03-17 19:36:11,994 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2025-03-17 19:36:11,994 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2025-03-17 19:36:11,994 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 24 transitions, 100 flow [2025-03-17 19:36:11,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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-17 19:36:11,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:11,995 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:11,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:36:11,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:11,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 985051062, now seen corresponding path program 1 times [2025-03-17 19:36:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:11,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722624526] [2025-03-17 19:36:11,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:11,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:12,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:12,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:12,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:12,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:12,286 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-17 19:36:12,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:12,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722624526] [2025-03-17 19:36:12,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722624526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:12,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:12,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:12,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164386212] [2025-03-17 19:36:12,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:12,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:12,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:12,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:12,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:12,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 24 transitions, 100 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:12,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:12,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:12,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:12,447 INFO L124 PetriNetUnfolderBase]: 13/54 cut-off events. [2025-03-17 19:36:12,447 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-03-17 19:36:12,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 54 events. 13/54 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 123 event pairs, 1 based on Foata normal form. 4/58 useless extension candidates. Maximal degree in co-relation 140. Up to 12 conditions per place. [2025-03-17 19:36:12,447 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 21 selfloop transitions, 7 changer transitions 0/31 dead transitions. [2025-03-17 19:36:12,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 31 transitions, 178 flow [2025-03-17 19:36:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:36:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:36:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2025-03-17 19:36:12,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35403726708074534 [2025-03-17 19:36:12,450 INFO L175 Difference]: Start difference. First operand has 35 places, 24 transitions, 100 flow. Second operand 7 states and 57 transitions. [2025-03-17 19:36:12,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 31 transitions, 178 flow [2025-03-17 19:36:12,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 171 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 19:36:12,451 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 106 flow [2025-03-17 19:36:12,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=106, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2025-03-17 19:36:12,451 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 15 predicate places. [2025-03-17 19:36:12,451 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 106 flow [2025-03-17 19:36:12,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:12,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:12,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:12,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:36:12,452 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1694436654, now seen corresponding path program 1 times [2025-03-17 19:36:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:12,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958823735] [2025-03-17 19:36:12,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:12,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:12,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:12,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:12,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:12,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:12,626 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-17 19:36:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:12,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958823735] [2025-03-17 19:36:12,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958823735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:12,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:12,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:12,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159983710] [2025-03-17 19:36:12,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:12,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:12,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:12,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:12,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:12,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:12,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 106 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:12,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:12,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:12,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:12,748 INFO L124 PetriNetUnfolderBase]: 12/62 cut-off events. [2025-03-17 19:36:12,751 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2025-03-17 19:36:12,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 62 events. 12/62 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 7 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 164. Up to 28 conditions per place. [2025-03-17 19:36:12,752 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2025-03-17 19:36:12,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 202 flow [2025-03-17 19:36:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:36:12,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:36:12,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 61 transitions. [2025-03-17 19:36:12,753 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33152173913043476 [2025-03-17 19:36:12,754 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 106 flow. Second operand 8 states and 61 transitions. [2025-03-17 19:36:12,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 202 flow [2025-03-17 19:36:12,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 182 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-17 19:36:12,755 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 148 flow [2025-03-17 19:36:12,755 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2025-03-17 19:36:12,755 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 21 predicate places. [2025-03-17 19:36:12,755 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 148 flow [2025-03-17 19:36:12,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:12,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:12,755 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:12,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:36:12,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1011614058, now seen corresponding path program 2 times [2025-03-17 19:36:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489992414] [2025-03-17 19:36:12,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:12,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:12,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:12,786 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:36:12,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:12,930 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-17 19:36:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:12,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489992414] [2025-03-17 19:36:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489992414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030867002] [2025-03-17 19:36:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:12,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:12,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:12,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:12,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:12,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:12,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:12,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:12,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:13,074 INFO L124 PetriNetUnfolderBase]: 11/67 cut-off events. [2025-03-17 19:36:13,074 INFO L125 PetriNetUnfolderBase]: For 107/111 co-relation queries the response was YES. [2025-03-17 19:36:13,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 67 events. 11/67 cut-off events. For 107/111 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 215 event pairs, 4 based on Foata normal form. 5/72 useless extension candidates. Maximal degree in co-relation 185. Up to 31 conditions per place. [2025-03-17 19:36:13,075 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 23 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2025-03-17 19:36:13,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 37 transitions, 256 flow [2025-03-17 19:36:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:36:13,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:36:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 64 transitions. [2025-03-17 19:36:13,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34782608695652173 [2025-03-17 19:36:13,078 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 148 flow. Second operand 8 states and 64 transitions. [2025-03-17 19:36:13,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 37 transitions, 256 flow [2025-03-17 19:36:13,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 245 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-17 19:36:13,081 INFO L231 Difference]: Finished difference. Result has 54 places, 30 transitions, 202 flow [2025-03-17 19:36:13,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=54, PETRI_TRANSITIONS=30} [2025-03-17 19:36:13,081 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 30 predicate places. [2025-03-17 19:36:13,082 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 30 transitions, 202 flow [2025-03-17 19:36:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:13,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:13,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:36:13,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash -917045928, now seen corresponding path program 3 times [2025-03-17 19:36:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946684431] [2025-03-17 19:36:13,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:36:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:13,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 12 statements into 1 equivalence classes. [2025-03-17 19:36:13,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 19:36:13,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:36:13,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:13,233 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-17 19:36:13,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946684431] [2025-03-17 19:36:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946684431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:13,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:13,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:13,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818540811] [2025-03-17 19:36:13,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:13,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:13,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:13,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:13,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:13,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:13,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 30 transitions, 202 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:13,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:13,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:13,343 INFO L124 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-03-17 19:36:13,343 INFO L125 PetriNetUnfolderBase]: For 159/159 co-relation queries the response was YES. [2025-03-17 19:36:13,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 66 events. 11/66 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 204 event pairs, 7 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 201. Up to 19 conditions per place. [2025-03-17 19:36:13,344 INFO L140 encePairwiseOnDemand]: 15/23 looper letters, 20 selfloop transitions, 11 changer transitions 0/34 dead transitions. [2025-03-17 19:36:13,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 34 transitions, 270 flow [2025-03-17 19:36:13,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:36:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:36:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2025-03-17 19:36:13,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.32065217391304346 [2025-03-17 19:36:13,349 INFO L175 Difference]: Start difference. First operand has 54 places, 30 transitions, 202 flow. Second operand 8 states and 59 transitions. [2025-03-17 19:36:13,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 34 transitions, 270 flow [2025-03-17 19:36:13,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 34 transitions, 252 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-03-17 19:36:13,351 INFO L231 Difference]: Finished difference. Result has 56 places, 29 transitions, 198 flow [2025-03-17 19:36:13,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=29} [2025-03-17 19:36:13,356 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 32 predicate places. [2025-03-17 19:36:13,356 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 29 transitions, 198 flow [2025-03-17 19:36:13,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:13,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:13,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:36:13,357 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:13,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1295264506, now seen corresponding path program 1 times [2025-03-17 19:36:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:13,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94163023] [2025-03-17 19:36:13,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:13,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:13,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:13,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:13,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:13,500 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-17 19:36:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:13,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94163023] [2025-03-17 19:36:13,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94163023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:13,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:13,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:13,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67705636] [2025-03-17 19:36:13,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:13,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:13,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:13,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:13,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:13,528 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:13,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 29 transitions, 198 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:13,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:13,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:13,627 INFO L124 PetriNetUnfolderBase]: 11/66 cut-off events. [2025-03-17 19:36:13,627 INFO L125 PetriNetUnfolderBase]: For 174/176 co-relation queries the response was YES. [2025-03-17 19:36:13,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 66 events. 11/66 cut-off events. For 174/176 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 4 based on Foata normal form. 3/69 useless extension candidates. Maximal degree in co-relation 201. Up to 32 conditions per place. [2025-03-17 19:36:13,628 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 20 selfloop transitions, 7 changer transitions 6/36 dead transitions. [2025-03-17 19:36:13,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 36 transitions, 276 flow [2025-03-17 19:36:13,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:36:13,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-17 19:36:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2025-03-17 19:36:13,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3423913043478261 [2025-03-17 19:36:13,630 INFO L175 Difference]: Start difference. First operand has 56 places, 29 transitions, 198 flow. Second operand 8 states and 63 transitions. [2025-03-17 19:36:13,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 36 transitions, 276 flow [2025-03-17 19:36:13,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 36 transitions, 238 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-17 19:36:13,632 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 141 flow [2025-03-17 19:36:13,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=141, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2025-03-17 19:36:13,633 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 31 predicate places. [2025-03-17 19:36:13,633 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 141 flow [2025-03-17 19:36:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:13,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:13,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:36:13,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:13,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:13,634 INFO L85 PathProgramCache]: Analyzing trace with hash 978158329, now seen corresponding path program 1 times [2025-03-17 19:36:13,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:13,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409601308] [2025-03-17 19:36:13,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:36:13,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:13,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:13,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:13,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:36:13,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:13,803 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-17 19:36:13,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:13,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409601308] [2025-03-17 19:36:13,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409601308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:13,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:13,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:13,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137348897] [2025-03-17 19:36:13,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:13,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:13,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:13,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:13,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:13,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:13,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 141 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:13,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:13,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:13,907 INFO L124 PetriNetUnfolderBase]: 10/55 cut-off events. [2025-03-17 19:36:13,907 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-17 19:36:13,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 55 events. 10/55 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 144 event pairs, 2 based on Foata normal form. 2/57 useless extension candidates. Maximal degree in co-relation 158. Up to 14 conditions per place. [2025-03-17 19:36:13,909 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 10 selfloop transitions, 5 changer transitions 13/31 dead transitions. [2025-03-17 19:36:13,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 31 transitions, 210 flow [2025-03-17 19:36:13,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:36:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-17 19:36:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 63 transitions. [2025-03-17 19:36:13,910 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.30434782608695654 [2025-03-17 19:36:13,910 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 141 flow. Second operand 9 states and 63 transitions. [2025-03-17 19:36:13,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 31 transitions, 210 flow [2025-03-17 19:36:13,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 183 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 19:36:13,912 INFO L231 Difference]: Finished difference. Result has 49 places, 18 transitions, 92 flow [2025-03-17 19:36:13,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=18} [2025-03-17 19:36:13,914 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 25 predicate places. [2025-03-17 19:36:13,914 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 18 transitions, 92 flow [2025-03-17 19:36:13,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:13,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:13,914 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:13,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:36:13,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:13,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:13,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1522688942, now seen corresponding path program 2 times [2025-03-17 19:36:13,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:13,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328430346] [2025-03-17 19:36:13,916 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:36:13,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:13,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:13,941 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:13,941 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:36:13,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:14,053 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-17 19:36:14,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:14,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328430346] [2025-03-17 19:36:14,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328430346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:14,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:14,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:14,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594852893] [2025-03-17 19:36:14,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:14,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:14,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:14,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:14,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:14,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:14,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 18 transitions, 92 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:14,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:14,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:14,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:14,145 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2025-03-17 19:36:14,145 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-17 19:36:14,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 24 events. 1/24 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 30 event pairs, 1 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 63. Up to 9 conditions per place. [2025-03-17 19:36:14,145 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 8 selfloop transitions, 3 changer transitions 5/19 dead transitions. [2025-03-17 19:36:14,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 19 transitions, 123 flow [2025-03-17 19:36:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:36:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:36:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2025-03-17 19:36:14,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2795031055900621 [2025-03-17 19:36:14,146 INFO L175 Difference]: Start difference. First operand has 49 places, 18 transitions, 92 flow. Second operand 7 states and 45 transitions. [2025-03-17 19:36:14,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 19 transitions, 123 flow [2025-03-17 19:36:14,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 19 transitions, 96 flow, removed 1 selfloop flow, removed 10 redundant places. [2025-03-17 19:36:14,146 INFO L231 Difference]: Finished difference. Result has 34 places, 14 transitions, 51 flow [2025-03-17 19:36:14,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=51, PETRI_PLACES=34, PETRI_TRANSITIONS=14} [2025-03-17 19:36:14,147 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 10 predicate places. [2025-03-17 19:36:14,147 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 14 transitions, 51 flow [2025-03-17 19:36:14,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:14,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 19:36:14,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:36:14,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:36:14,147 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-17 19:36:14,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:36:14,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1913403824, now seen corresponding path program 3 times [2025-03-17 19:36:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:36:14,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646741806] [2025-03-17 19:36:14,148 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 19:36:14,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:36:14,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-17 19:36:14,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 19:36:14,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 19:36:14,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:36:14,252 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-17 19:36:14,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:36:14,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646741806] [2025-03-17 19:36:14,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646741806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:36:14,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:36:14,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:36:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078622572] [2025-03-17 19:36:14,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:36:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:36:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:36:14,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:36:14,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:36:14,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 23 [2025-03-17 19:36:14,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 14 transitions, 51 flow. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:14,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 19:36:14,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 23 [2025-03-17 19:36:14,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 19:36:14,322 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2025-03-17 19:36:14,323 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 19:36:14,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 15 events. 1/15 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/16 useless extension candidates. Maximal degree in co-relation 33. Up to 4 conditions per place. [2025-03-17 19:36:14,323 INFO L140 encePairwiseOnDemand]: 17/23 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2025-03-17 19:36:14,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 14 transitions, 71 flow [2025-03-17 19:36:14,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:36:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 19:36:14,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2025-03-17 19:36:14,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2484472049689441 [2025-03-17 19:36:14,325 INFO L175 Difference]: Start difference. First operand has 34 places, 14 transitions, 51 flow. Second operand 7 states and 40 transitions. [2025-03-17 19:36:14,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 14 transitions, 71 flow [2025-03-17 19:36:14,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-17 19:36:14,326 INFO L231 Difference]: Finished difference. Result has 24 places, 0 transitions, 0 flow [2025-03-17 19:36:14,326 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=32, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=24, PETRI_TRANSITIONS=0} [2025-03-17 19:36:14,326 INFO L279 CegarLoopForPetriNet]: 24 programPoint places, 0 predicate places. [2025-03-17 19:36:14,326 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 0 transitions, 0 flow [2025-03-17 19:36:14,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-17 19:36:14,329 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-17 19:36:14,330 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-17 19:36:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 19:36:14,330 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2025-03-17 19:36:14,334 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 19:36:14,334 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 19:36:14,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 07:36:14 BasicIcfg [2025-03-17 19:36:14,338 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 19:36:14,339 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 19:36:14,339 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 19:36:14,339 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 19:36:14,340 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:36:10" (3/4) ... [2025-03-17 19:36:14,341 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 19:36:14,343 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-17 19:36:14,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 49 nodes and edges [2025-03-17 19:36:14,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-17 19:36:14,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-17 19:36:14,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 19:36:14,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 19:36:14,408 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 19:36:14,409 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 19:36:14,409 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 19:36:14,410 INFO L158 Benchmark]: Toolchain (without parser) took 4594.42ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 113.0MB in the beginning and 71.2MB in the end (delta: 41.7MB). Peak memory consumption was 76.0MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,410 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:14,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.52ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 85.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,412 INFO L158 Benchmark]: Boogie Preprocessor took 35.01ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 19:36:14,412 INFO L158 Benchmark]: IcfgBuilder took 534.85ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 105.8MB in the end (delta: -24.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,413 INFO L158 Benchmark]: TraceAbstraction took 3449.38ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 105.0MB in the beginning and 77.7MB in the end (delta: 27.3MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,413 INFO L158 Benchmark]: Witness Printer took 70.22ms. Allocated memory is still 176.2MB. Free memory was 77.7MB in the beginning and 71.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 19:36:14,414 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 125.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.52ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 85.1MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.33ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 83.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.01ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 81.2MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 534.85ms. Allocated memory is still 142.6MB. Free memory was 81.2MB in the beginning and 105.8MB in the end (delta: -24.6MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3449.38ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 105.0MB in the beginning and 77.7MB in the end (delta: 27.3MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * Witness Printer took 70.22ms. Allocated memory is still 176.2MB. Free memory was 77.7MB in the beginning and 71.2MB in the end (delta: 6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 937]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 926]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 35 locations, 34 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 297 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 240 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 309 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 988 IncrementalHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 16 mSDtfsCounter, 988 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=6, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 19:36:14,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE