./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-atomic/szymanski.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-atomic/szymanski.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:47:26,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:47:26,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:47:26,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:47:26,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:47:26,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:47:26,854 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:47:26,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:47:26,855 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:47:26,855 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:47:26,855 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:47:26,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:47:26,856 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:47:26,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:47:26,859 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:47:26,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:47:26,860 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:47:26,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:47:26,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:47:26,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:47:26,860 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:47:26,861 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:47:26,862 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:47:26,863 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:47:26,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:47:26,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:47:26,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:47:26,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:47:26,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:47:26,863 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:47:26,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:47:26,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:47:26,865 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> a3cd4be37ada319d324d40d8d6c18fff519996a186a93f33b3070275487295e3 [2024-11-10 17:47:27,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:47:27,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:47:27,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:47:27,115 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:47:27,115 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:47:27,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/szymanski.i [2024-11-10 17:47:28,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:47:28,479 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:47:28,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/szymanski.i [2024-11-10 17:47:28,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fed8b4b/acf44e98066f4c0eadb858b8d9ad9b60/FLAG88cabf400 [2024-11-10 17:47:28,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82fed8b4b/acf44e98066f4c0eadb858b8d9ad9b60 [2024-11-10 17:47:28,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:47:28,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:47:28,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:47:28,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:47:28,861 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:47:28,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:47:28" (1/1) ... [2024-11-10 17:47:28,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13c2011f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:28, skipping insertion in model container [2024-11-10 17:47:28,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:47:28" (1/1) ... [2024-11-10 17:47:28,893 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:47:29,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:47:29,209 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:47:29,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:47:29,279 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:47:29,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29 WrapperNode [2024-11-10 17:47:29,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:47:29,280 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:47:29,280 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:47:29,281 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:47:29,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,296 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,312 INFO L138 Inliner]: procedures = 166, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2024-11-10 17:47:29,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:47:29,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:47:29,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:47:29,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:47:29,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,328 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,343 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 17:47:29,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,348 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,350 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:47:29,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:47:29,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:47:29,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:47:29,351 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (1/1) ... [2024-11-10 17:47:29,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:47:29,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:47:29,380 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) [2024-11-10 17:47:29,382 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 [2024-11-10 17:47:29,416 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-10 17:47:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-10 17:47:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 17:47:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 17:47:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:47:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:47:29,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:47:29,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:47:29,418 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 17:47:29,574 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:47:29,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:47:29,729 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 17:47:29,732 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:47:29,775 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:47:29,776 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:47:29,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:47:29 BoogieIcfgContainer [2024-11-10 17:47:29,776 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:47:29,780 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:47:29,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:47:29,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:47:29,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:47:28" (1/3) ... [2024-11-10 17:47:29,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d105a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:47:29, skipping insertion in model container [2024-11-10 17:47:29,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:47:29" (2/3) ... [2024-11-10 17:47:29,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d105a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:47:29, skipping insertion in model container [2024-11-10 17:47:29,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:47:29" (3/3) ... [2024-11-10 17:47:29,786 INFO L112 eAbstractionObserver]: Analyzing ICFG szymanski.i [2024-11-10 17:47:29,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:47:29,800 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 17:47:29,801 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 17:47:29,848 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-10 17:47:29,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 78 transitions, 170 flow [2024-11-10 17:47:29,908 INFO L124 PetriNetUnfolderBase]: 22/76 cut-off events. [2024-11-10 17:47:29,908 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 17:47:29,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 76 events. 22/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 148 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 71. Up to 3 conditions per place. [2024-11-10 17:47:29,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 78 transitions, 170 flow [2024-11-10 17:47:29,915 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 75 transitions, 162 flow [2024-11-10 17:47:29,922 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:47:29,930 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=None, 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;@271c80fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:47:29,931 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 17:47:29,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 17:47:29,946 INFO L124 PetriNetUnfolderBase]: 18/56 cut-off events. [2024-11-10 17:47:29,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 17:47:29,946 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:29,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:29,947 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:29,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1984602435, now seen corresponding path program 1 times [2024-11-10 17:47:29,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:29,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103278881] [2024-11-10 17:47:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:30,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103278881] [2024-11-10 17:47:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103278881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:30,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:30,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:47:30,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263308498] [2024-11-10 17:47:30,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:30,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:47:30,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:30,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:47:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:47:30,131 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 78 [2024-11-10 17:47:30,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 75 transitions, 162 flow. Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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) [2024-11-10 17:47:30,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:30,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 78 [2024-11-10 17:47:30,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:30,257 INFO L124 PetriNetUnfolderBase]: 222/490 cut-off events. [2024-11-10 17:47:30,258 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-10 17:47:30,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 858 conditions, 490 events. 222/490 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2652 event pairs, 182 based on Foata normal form. 188/583 useless extension candidates. Maximal degree in co-relation 804. Up to 338 conditions per place. [2024-11-10 17:47:30,264 INFO L140 encePairwiseOnDemand]: 66/78 looper letters, 22 selfloop transitions, 0 changer transitions 0/61 dead transitions. [2024-11-10 17:47:30,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 61 transitions, 178 flow [2024-11-10 17:47:30,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:47:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-10 17:47:30,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 120 transitions. [2024-11-10 17:47:30,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7692307692307693 [2024-11-10 17:47:30,274 INFO L175 Difference]: Start difference. First operand has 60 places, 75 transitions, 162 flow. Second operand 2 states and 120 transitions. [2024-11-10 17:47:30,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 61 transitions, 178 flow [2024-11-10 17:47:30,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 170 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-10 17:47:30,281 INFO L231 Difference]: Finished difference. Result has 55 places, 61 transitions, 126 flow [2024-11-10 17:47:30,283 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=126, PETRI_PLACES=55, PETRI_TRANSITIONS=61} [2024-11-10 17:47:30,285 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2024-11-10 17:47:30,285 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 61 transitions, 126 flow [2024-11-10 17:47:30,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 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) [2024-11-10 17:47:30,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:30,286 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:30,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:47:30,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:30,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:30,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1168935516, now seen corresponding path program 1 times [2024-11-10 17:47:30,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:30,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850974256] [2024-11-10 17:47:30,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:30,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:30,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:30,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:30,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850974256] [2024-11-10 17:47:30,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850974256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:30,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:30,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:30,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972543736] [2024-11-10 17:47:30,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:30,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:30,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:30,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:30,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:30,365 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 78 [2024-11-10 17:47:30,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 61 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:30,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:30,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 78 [2024-11-10 17:47:30,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:30,490 INFO L124 PetriNetUnfolderBase]: 322/730 cut-off events. [2024-11-10 17:47:30,491 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-11-10 17:47:30,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1245 conditions, 730 events. 322/730 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3983 event pairs, 136 based on Foata normal form. 22/630 useless extension candidates. Maximal degree in co-relation 1242. Up to 288 conditions per place. [2024-11-10 17:47:30,499 INFO L140 encePairwiseOnDemand]: 73/78 looper letters, 36 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2024-11-10 17:47:30,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 75 transitions, 234 flow [2024-11-10 17:47:30,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-10 17:47:30,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.688034188034188 [2024-11-10 17:47:30,503 INFO L175 Difference]: Start difference. First operand has 55 places, 61 transitions, 126 flow. Second operand 3 states and 161 transitions. [2024-11-10 17:47:30,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 75 transitions, 234 flow [2024-11-10 17:47:30,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 17:47:30,506 INFO L231 Difference]: Finished difference. Result has 59 places, 62 transitions, 146 flow [2024-11-10 17:47:30,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=59, PETRI_TRANSITIONS=62} [2024-11-10 17:47:30,507 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2024-11-10 17:47:30,507 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 62 transitions, 146 flow [2024-11-10 17:47:30,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:30,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:30,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:30,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:47:30,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr2Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:30,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:30,510 INFO L85 PathProgramCache]: Analyzing trace with hash 991750830, now seen corresponding path program 1 times [2024-11-10 17:47:30,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:30,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421413300] [2024-11-10 17:47:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:30,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:30,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:30,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:30,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421413300] [2024-11-10 17:47:30,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421413300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:30,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:30,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:30,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514068114] [2024-11-10 17:47:30,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:30,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:30,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:30,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:30,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:30,568 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 78 [2024-11-10 17:47:30,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 62 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:47:30,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:30,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 78 [2024-11-10 17:47:30,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:30,669 INFO L124 PetriNetUnfolderBase]: 316/733 cut-off events. [2024-11-10 17:47:30,670 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2024-11-10 17:47:30,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1320 conditions, 733 events. 316/733 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3879 event pairs, 161 based on Foata normal form. 27/655 useless extension candidates. Maximal degree in co-relation 1315. Up to 335 conditions per place. [2024-11-10 17:47:30,675 INFO L140 encePairwiseOnDemand]: 74/78 looper letters, 36 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2024-11-10 17:47:30,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 248 flow [2024-11-10 17:47:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2024-11-10 17:47:30,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6837606837606838 [2024-11-10 17:47:30,680 INFO L175 Difference]: Start difference. First operand has 59 places, 62 transitions, 146 flow. Second operand 3 states and 160 transitions. [2024-11-10 17:47:30,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 248 flow [2024-11-10 17:47:30,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:47:30,683 INFO L231 Difference]: Finished difference. Result has 60 places, 62 transitions, 150 flow [2024-11-10 17:47:30,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=60, PETRI_TRANSITIONS=62} [2024-11-10 17:47:30,684 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2024-11-10 17:47:30,685 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 62 transitions, 150 flow [2024-11-10 17:47:30,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:47:30,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:30,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:30,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:47:30,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:30,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:30,688 INFO L85 PathProgramCache]: Analyzing trace with hash 54343621, now seen corresponding path program 1 times [2024-11-10 17:47:30,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:30,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187901915] [2024-11-10 17:47:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:30,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:30,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187901915] [2024-11-10 17:47:30,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187901915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:30,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:30,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255986929] [2024-11-10 17:47:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:30,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:30,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:30,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:30,798 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 78 [2024-11-10 17:47:30,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 62 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:30,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:30,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 78 [2024-11-10 17:47:30,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:30,895 INFO L124 PetriNetUnfolderBase]: 386/920 cut-off events. [2024-11-10 17:47:30,895 INFO L125 PetriNetUnfolderBase]: For 72/77 co-relation queries the response was YES. [2024-11-10 17:47:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1604 conditions, 920 events. 386/920 cut-off events. For 72/77 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 5023 event pairs, 194 based on Foata normal form. 32/877 useless extension candidates. Maximal degree in co-relation 1598. Up to 406 conditions per place. [2024-11-10 17:47:30,899 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 36 selfloop transitions, 6 changer transitions 2/79 dead transitions. [2024-11-10 17:47:30,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 79 transitions, 276 flow [2024-11-10 17:47:30,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:30,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:30,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2024-11-10 17:47:30,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2024-11-10 17:47:30,902 INFO L175 Difference]: Start difference. First operand has 60 places, 62 transitions, 150 flow. Second operand 3 states and 162 transitions. [2024-11-10 17:47:30,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 79 transitions, 276 flow [2024-11-10 17:47:30,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 79 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 17:47:30,904 INFO L231 Difference]: Finished difference. Result has 63 places, 67 transitions, 200 flow [2024-11-10 17:47:30,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2024-11-10 17:47:30,906 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2024-11-10 17:47:30,906 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 200 flow [2024-11-10 17:47:30,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:30,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:30,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:30,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:47:30,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:30,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -607668305, now seen corresponding path program 2 times [2024-11-10 17:47:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514000880] [2024-11-10 17:47:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:30,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:30,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514000880] [2024-11-10 17:47:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514000880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:30,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:30,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:30,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262940349] [2024-11-10 17:47:30,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:30,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:30,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:30,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:30,964 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 78 [2024-11-10 17:47:30,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:30,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:30,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 78 [2024-11-10 17:47:30,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:31,100 INFO L124 PetriNetUnfolderBase]: 430/1028 cut-off events. [2024-11-10 17:47:31,100 INFO L125 PetriNetUnfolderBase]: For 443/454 co-relation queries the response was YES. [2024-11-10 17:47:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2102 conditions, 1028 events. 430/1028 cut-off events. For 443/454 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5669 event pairs, 162 based on Foata normal form. 24/949 useless extension candidates. Maximal degree in co-relation 2095. Up to 330 conditions per place. [2024-11-10 17:47:31,108 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 38 selfloop transitions, 9 changer transitions 2/84 dead transitions. [2024-11-10 17:47:31,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 84 transitions, 348 flow [2024-11-10 17:47:31,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2024-11-10 17:47:31,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.688034188034188 [2024-11-10 17:47:31,111 INFO L175 Difference]: Start difference. First operand has 63 places, 67 transitions, 200 flow. Second operand 3 states and 161 transitions. [2024-11-10 17:47:31,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 84 transitions, 348 flow [2024-11-10 17:47:31,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:47:31,117 INFO L231 Difference]: Finished difference. Result has 65 places, 72 transitions, 258 flow [2024-11-10 17:47:31,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=65, PETRI_TRANSITIONS=72} [2024-11-10 17:47:31,118 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2024-11-10 17:47:31,119 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 72 transitions, 258 flow [2024-11-10 17:47:31,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:31,119 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:31,119 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:47:31,120 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -31999565, now seen corresponding path program 3 times [2024-11-10 17:47:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627943427] [2024-11-10 17:47:31,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:31,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:31,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627943427] [2024-11-10 17:47:31,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627943427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:31,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521792858] [2024-11-10 17:47:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:31,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:31,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 78 [2024-11-10 17:47:31,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 72 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2024-11-10 17:47:31,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:31,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 78 [2024-11-10 17:47:31,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:31,250 INFO L124 PetriNetUnfolderBase]: 430/959 cut-off events. [2024-11-10 17:47:31,250 INFO L125 PetriNetUnfolderBase]: For 1044/1063 co-relation queries the response was YES. [2024-11-10 17:47:31,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2284 conditions, 959 events. 430/959 cut-off events. For 1044/1063 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 5065 event pairs, 213 based on Foata normal form. 25/871 useless extension candidates. Maximal degree in co-relation 2276. Up to 543 conditions per place. [2024-11-10 17:47:31,255 INFO L140 encePairwiseOnDemand]: 69/78 looper letters, 42 selfloop transitions, 5 changer transitions 2/83 dead transitions. [2024-11-10 17:47:31,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 83 transitions, 382 flow [2024-11-10 17:47:31,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2024-11-10 17:47:31,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2024-11-10 17:47:31,256 INFO L175 Difference]: Start difference. First operand has 65 places, 72 transitions, 258 flow. Second operand 3 states and 158 transitions. [2024-11-10 17:47:31,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 83 transitions, 382 flow [2024-11-10 17:47:31,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 83 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:47:31,259 INFO L231 Difference]: Finished difference. Result has 67 places, 72 transitions, 278 flow [2024-11-10 17:47:31,260 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=67, PETRI_TRANSITIONS=72} [2024-11-10 17:47:31,261 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 7 predicate places. [2024-11-10 17:47:31,262 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 72 transitions, 278 flow [2024-11-10 17:47:31,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 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) [2024-11-10 17:47:31,262 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:31,262 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:31,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:47:31,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:31,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:31,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1611622553, now seen corresponding path program 4 times [2024-11-10 17:47:31,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:31,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933502660] [2024-11-10 17:47:31,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:31,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:31,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933502660] [2024-11-10 17:47:31,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933502660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:31,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:31,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:31,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621056058] [2024-11-10 17:47:31,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:31,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:31,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:31,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:31,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:31,325 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 78 [2024-11-10 17:47:31,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 72 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:31,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:31,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 78 [2024-11-10 17:47:31,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:31,411 INFO L124 PetriNetUnfolderBase]: 519/1143 cut-off events. [2024-11-10 17:47:31,412 INFO L125 PetriNetUnfolderBase]: For 977/1001 co-relation queries the response was YES. [2024-11-10 17:47:31,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1143 events. 519/1143 cut-off events. For 977/1001 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6180 event pairs, 212 based on Foata normal form. 43/1134 useless extension candidates. Maximal degree in co-relation 2652. Up to 509 conditions per place. [2024-11-10 17:47:31,417 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 44 selfloop transitions, 6 changer transitions 1/86 dead transitions. [2024-11-10 17:47:31,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 86 transitions, 454 flow [2024-11-10 17:47:31,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:31,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:31,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-10 17:47:31,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6794871794871795 [2024-11-10 17:47:31,419 INFO L175 Difference]: Start difference. First operand has 67 places, 72 transitions, 278 flow. Second operand 3 states and 159 transitions. [2024-11-10 17:47:31,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 86 transitions, 454 flow [2024-11-10 17:47:31,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 86 transitions, 432 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-10 17:47:31,425 INFO L231 Difference]: Finished difference. Result has 62 places, 71 transitions, 298 flow [2024-11-10 17:47:31,425 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=298, PETRI_PLACES=62, PETRI_TRANSITIONS=71} [2024-11-10 17:47:31,425 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-11-10 17:47:31,425 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 71 transitions, 298 flow [2024-11-10 17:47:31,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 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) [2024-11-10 17:47:31,426 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:31,426 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:31,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:47:31,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:31,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:31,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1681074651, now seen corresponding path program 1 times [2024-11-10 17:47:31,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:31,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818106079] [2024-11-10 17:47:31,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:31,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:31,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:31,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818106079] [2024-11-10 17:47:31,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818106079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:31,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:31,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:47:31,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861277918] [2024-11-10 17:47:31,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:31,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:31,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:31,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:31,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:31,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 78 [2024-11-10 17:47:31,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 71 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2024-11-10 17:47:31,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:31,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 78 [2024-11-10 17:47:31,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:31,582 INFO L124 PetriNetUnfolderBase]: 461/1017 cut-off events. [2024-11-10 17:47:31,582 INFO L125 PetriNetUnfolderBase]: For 1019/1102 co-relation queries the response was YES. [2024-11-10 17:47:31,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2618 conditions, 1017 events. 461/1017 cut-off events. For 1019/1102 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5373 event pairs, 199 based on Foata normal form. 30/985 useless extension candidates. Maximal degree in co-relation 2609. Up to 547 conditions per place. [2024-11-10 17:47:31,587 INFO L140 encePairwiseOnDemand]: 68/78 looper letters, 45 selfloop transitions, 5 changer transitions 1/85 dead transitions. [2024-11-10 17:47:31,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 460 flow [2024-11-10 17:47:31,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2024-11-10 17:47:31,588 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6709401709401709 [2024-11-10 17:47:31,588 INFO L175 Difference]: Start difference. First operand has 62 places, 71 transitions, 298 flow. Second operand 3 states and 157 transitions. [2024-11-10 17:47:31,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 460 flow [2024-11-10 17:47:31,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 447 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 17:47:31,592 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 329 flow [2024-11-10 17:47:31,592 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2024-11-10 17:47:31,593 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2024-11-10 17:47:31,593 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 329 flow [2024-11-10 17:47:31,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 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) [2024-11-10 17:47:31,593 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 17:47:31,593 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:47:31,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:47:31,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [thr2Err0ASSERT_VIOLATIONMEMORY_LEAK, thr1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-11-10 17:47:31,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:47:31,594 INFO L85 PathProgramCache]: Analyzing trace with hash 205395733, now seen corresponding path program 2 times [2024-11-10 17:47:31,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:47:31,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248522502] [2024-11-10 17:47:31,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:47:31,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:47:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:47:31,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:47:31,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:47:31,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248522502] [2024-11-10 17:47:31,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248522502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:47:31,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:47:31,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 17:47:31,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628561442] [2024-11-10 17:47:31,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:47:31,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:47:31,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:47:31,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:47:31,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:47:31,629 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 78 [2024-11-10 17:47:31,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2024-11-10 17:47:31,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 17:47:31,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 78 [2024-11-10 17:47:31,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 17:47:31,695 INFO L124 PetriNetUnfolderBase]: 373/826 cut-off events. [2024-11-10 17:47:31,695 INFO L125 PetriNetUnfolderBase]: For 1359/1404 co-relation queries the response was YES. [2024-11-10 17:47:31,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2373 conditions, 826 events. 373/826 cut-off events. For 1359/1404 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4482 event pairs, 221 based on Foata normal form. 2/711 useless extension candidates. Maximal degree in co-relation 2364. Up to 521 conditions per place. [2024-11-10 17:47:31,697 INFO L140 encePairwiseOnDemand]: 76/78 looper letters, 0 selfloop transitions, 0 changer transitions 72/72 dead transitions. [2024-11-10 17:47:31,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 389 flow [2024-11-10 17:47:31,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:47:31,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 17:47:31,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2024-11-10 17:47:31,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2024-11-10 17:47:31,699 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 329 flow. Second operand 3 states and 147 transitions. [2024-11-10 17:47:31,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 389 flow [2024-11-10 17:47:31,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 379 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 17:47:31,701 INFO L231 Difference]: Finished difference. Result has 62 places, 0 transitions, 0 flow [2024-11-10 17:47:31,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=78, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=62, PETRI_TRANSITIONS=0} [2024-11-10 17:47:31,702 INFO L277 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2024-11-10 17:47:31,702 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 0 transitions, 0 flow [2024-11-10 17:47:31,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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) [2024-11-10 17:47:31,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-10 17:47:31,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-10 17:47:31,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-10 17:47:31,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-10 17:47:31,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-10 17:47:31,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr2Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 7 remaining) [2024-11-10 17:47:31,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-10 17:47:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:47:31,707 INFO L407 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1] [2024-11-10 17:47:31,715 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 17:47:31,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 17:47:31,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:47:31 BasicIcfg [2024-11-10 17:47:31,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 17:47:31,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 17:47:31,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 17:47:31,721 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 17:47:31,722 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:47:29" (3/4) ... [2024-11-10 17:47:31,723 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 17:47:31,725 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thr2 [2024-11-10 17:47:31,725 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thr1 [2024-11-10 17:47:31,727 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2024-11-10 17:47:31,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-10 17:47:31,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-10 17:47:31,729 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 17:47:31,795 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 17:47:31,796 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 17:47:31,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 17:47:31,797 INFO L158 Benchmark]: Toolchain (without parser) took 2939.94ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 74.1MB in the beginning and 90.6MB in the end (delta: -16.5MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,797 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:47:31,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.53ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 116.4MB in the end (delta: -42.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.69ms. Allocated memory is still 155.2MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,798 INFO L158 Benchmark]: Boogie Preprocessor took 35.42ms. Allocated memory is still 155.2MB. Free memory was 114.3MB in the beginning and 112.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,798 INFO L158 Benchmark]: IcfgBuilder took 428.71ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 110.7MB in the end (delta: 2.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,799 INFO L158 Benchmark]: TraceAbstraction took 1938.50ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 109.9MB in the beginning and 94.8MB in the end (delta: 15.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,799 INFO L158 Benchmark]: Witness Printer took 76.80ms. Allocated memory is still 203.4MB. Free memory was 93.8MB in the beginning and 90.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 17:47:31,800 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.15ms. Allocated memory is still 155.2MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 422.53ms. Allocated memory is still 155.2MB. Free memory was 73.8MB in the beginning and 116.4MB in the end (delta: -42.7MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.69ms. Allocated memory is still 155.2MB. Free memory was 116.4MB in the beginning and 114.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.42ms. Allocated memory is still 155.2MB. Free memory was 114.3MB in the beginning and 112.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 428.71ms. Allocated memory is still 155.2MB. Free memory was 112.9MB in the beginning and 110.7MB in the end (delta: 2.2MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1938.50ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 109.9MB in the beginning and 94.8MB in the end (delta: 15.1MB). Peak memory consumption was 65.1MB. Max. memory is 16.1GB. * Witness Printer took 76.80ms. Allocated memory is still 203.4MB. Free memory was 93.8MB in the beginning and 90.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 12]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 765]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 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: 1.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 127 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 497 IncrementalHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 42 mSDtfsCounter, 497 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=8, InterpolantAutomatonStates: 26, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 17:47:31,821 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