./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-theta/unwind1-100.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd --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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:19:40,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:19:40,955 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 16:19:40,962 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:19:40,962 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:19:41,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:19:41,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:19:41,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:19:41,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:19:41,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:19:41,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:19:41,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:19:41,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:19:41,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:19:41,007 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:19:41,007 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:19:41,008 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:19:41,008 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:19:41,010 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:19:41,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:19:41,011 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:19:41,011 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:19:41,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:19:41,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:19:41,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:19:41,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:19:41,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:19:41,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:19:41,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-13 16:19:41,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:19:41,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:19:41,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:19:41,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:19:41,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:19:41,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-theta/unwind1-100.i Unable to find full path for "g++" [2024-11-13 16:19:43,854 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:19:44,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:19:44,321 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-13 16:19:44,344 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/de3496d98/295b6c9279b74b0d902c0a42d353966b/FLAGd9c67d5aa [2024-11-13 16:19:44,374 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/de3496d98/295b6c9279b74b0d902c0a42d353966b [2024-11-13 16:19:44,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:19:44,380 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:19:44,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:19:44,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:19:44,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:19:44,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:19:44" (1/1) ... [2024-11-13 16:19:44,391 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42522308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:44, skipping insertion in model container [2024-11-13 16:19:44,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:19:44" (1/1) ... [2024-11-13 16:19:44,465 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:19:44,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:19:44,959 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:19:45,018 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:19:45,062 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:19:45,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45 WrapperNode [2024-11-13 16:19:45,063 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:19:45,064 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:19:45,065 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:19:45,065 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:19:45,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,119 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 55 [2024-11-13 16:19:45,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:19:45,123 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:19:45,124 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:19:45,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:19:45,134 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,138 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,164 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-13 16:19:45,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:19:45,185 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:19:45,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:19:45,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:19:45,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (1/1) ... [2024-11-13 16:19:45,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:19:45,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:19:45,227 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:19:45,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:19:45,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:19:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-13 16:19:45,269 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-13 16:19:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-13 16:19:45,269 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-13 16:19:45,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 16:19:45,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:19:45,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:19:45,272 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:19:45,477 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:19:45,478 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:19:45,687 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:19:45,687 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:19:45,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:19:45,825 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:19:45,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:19:45 BoogieIcfgContainer [2024-11-13 16:19:45,826 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:19:45,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:19:45,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:19:45,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:19:45,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:19:44" (1/3) ... [2024-11-13 16:19:45,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796bafce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:19:45, skipping insertion in model container [2024-11-13 16:19:45,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:19:45" (2/3) ... [2024-11-13 16:19:45,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@796bafce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:19:45, skipping insertion in model container [2024-11-13 16:19:45,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:19:45" (3/3) ... [2024-11-13 16:19:45,839 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-13 16:19:45,860 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:19:45,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 16:19:45,863 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:19:45,920 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 16:19:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-13 16:19:46,000 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-13 16:19:46,003 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 16:19:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-13 16:19:46,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-13 16:19:46,011 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-13 16:19:46,022 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:19:46,037 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;@2c809dd0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:19:46,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 16:19:46,049 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:19:46,049 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-13 16:19:46,049 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 16:19:46,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:46,050 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:46,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:46,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:46,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1926184360, now seen corresponding path program 1 times [2024-11-13 16:19:46,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:46,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934210491] [2024-11-13 16:19:46,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:46,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:46,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:46,637 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-13 16:19:46,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:46,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934210491] [2024-11-13 16:19:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934210491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:46,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:46,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:19:46,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029053178] [2024-11-13 16:19:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:19:46,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:46,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:19:46,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:19:46,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:19:46,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-13 16:19:46,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:46,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:19:46,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:47,111 INFO L124 PetriNetUnfolderBase]: 152/302 cut-off events. [2024-11-13 16:19:47,111 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-13 16:19:47,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 602 conditions, 302 events. 152/302 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1213 event pairs, 68 based on Foata normal form. 22/268 useless extension candidates. Maximal degree in co-relation 532. Up to 146 conditions per place. [2024-11-13 16:19:47,123 INFO L140 encePairwiseOnDemand]: 20/29 looper letters, 33 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2024-11-13 16:19:47,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 46 transitions, 196 flow [2024-11-13 16:19:47,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 16:19:47,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 16:19:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2024-11-13 16:19:47,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5229885057471264 [2024-11-13 16:19:47,144 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 6 states and 91 transitions. [2024-11-13 16:19:47,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 46 transitions, 196 flow [2024-11-13 16:19:47,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 46 transitions, 180 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 16:19:47,156 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 91 flow [2024-11-13 16:19:47,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=91, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-11-13 16:19:47,164 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2024-11-13 16:19:47,164 INFO L471 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 91 flow [2024-11-13 16:19:47,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 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-13 16:19:47,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:47,165 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:47,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 16:19:47,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:47,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash 416841141, now seen corresponding path program 1 times [2024-11-13 16:19:47,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:47,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608439087] [2024-11-13 16:19:47,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:47,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:47,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608439087] [2024-11-13 16:19:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608439087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:47,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:47,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:19:47,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269491423] [2024-11-13 16:19:47,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:47,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:19:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:47,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:19:47,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:19:47,407 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-13 16:19:47,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:19:47,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:47,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-13 16:19:47,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:47,590 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-13 16:19:47,590 INFO L125 PetriNetUnfolderBase]: For 133/133 co-relation queries the response was YES. [2024-11-13 16:19:47,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 625 conditions, 247 events. 111/247 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 936 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 312. Up to 97 conditions per place. [2024-11-13 16:19:47,594 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-11-13 16:19:47,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 228 flow [2024-11-13 16:19:47,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:19:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 16:19:47,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-13 16:19:47,596 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-13 16:19:47,597 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 91 flow. Second operand 5 states and 73 transitions. [2024-11-13 16:19:47,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 228 flow [2024-11-13 16:19:47,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 45 transitions, 227 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:19:47,601 INFO L231 Difference]: Finished difference. Result has 38 places, 30 transitions, 127 flow [2024-11-13 16:19:47,601 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2024-11-13 16:19:47,602 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 9 predicate places. [2024-11-13 16:19:47,602 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 127 flow [2024-11-13 16:19:47,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:19:47,603 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:47,603 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:47,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 16:19:47,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:47,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1737908583, now seen corresponding path program 1 times [2024-11-13 16:19:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:47,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962933186] [2024-11-13 16:19:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:47,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:47,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962933186] [2024-11-13 16:19:47,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962933186] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:19:47,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394321299] [2024-11-13 16:19:47,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:47,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:47,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:19:47,891 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:19:47,895 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:19:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:48,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:19:48,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:48,136 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:19:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394321299] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:19:48,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:19:48,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-13 16:19:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193847984] [2024-11-13 16:19:48,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:19:48,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-13 16:19:48,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-13 16:19:48,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-13 16:19:48,281 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:19:48,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 127 flow. Second operand has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-13 16:19:48,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:48,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:19:48,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:48,838 INFO L124 PetriNetUnfolderBase]: 140/279 cut-off events. [2024-11-13 16:19:48,838 INFO L125 PetriNetUnfolderBase]: For 196/196 co-relation queries the response was YES. [2024-11-13 16:19:48,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 279 events. 140/279 cut-off events. For 196/196 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 896 event pairs, 21 based on Foata normal form. 5/267 useless extension candidates. Maximal degree in co-relation 458. Up to 65 conditions per place. [2024-11-13 16:19:48,842 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 48 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2024-11-13 16:19:48,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 71 transitions, 376 flow [2024-11-13 16:19:48,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 16:19:48,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-13 16:19:48,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 149 transitions. [2024-11-13 16:19:48,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3952254641909814 [2024-11-13 16:19:48,848 INFO L175 Difference]: Start difference. First operand has 38 places, 30 transitions, 127 flow. Second operand 13 states and 149 transitions. [2024-11-13 16:19:48,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 71 transitions, 376 flow [2024-11-13 16:19:48,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 71 transitions, 373 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:19:48,856 INFO L231 Difference]: Finished difference. Result has 52 places, 37 transitions, 212 flow [2024-11-13 16:19:48,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2024-11-13 16:19:48,861 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 23 predicate places. [2024-11-13 16:19:48,861 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 212 flow [2024-11-13 16:19:48,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.0) internal successors, (104), 13 states have internal predecessors, (104), 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-13 16:19:48,862 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:48,862 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:48,888 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:19:49,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-13 16:19:49,066 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:49,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:49,067 INFO L85 PathProgramCache]: Analyzing trace with hash 817215028, now seen corresponding path program 2 times [2024-11-13 16:19:49,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:49,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558744656] [2024-11-13 16:19:49,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:49,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-13 16:19:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558744656] [2024-11-13 16:19:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558744656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:19:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032221691] [2024-11-13 16:19:49,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:19:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:19:49,321 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:19:49,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:19:49,421 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:19:49,421 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:19:49,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 16:19:49,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:49,705 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:19:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:49,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032221691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:19:49,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:19:49,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 18 [2024-11-13 16:19:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404233892] [2024-11-13 16:19:49,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:19:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 16:19:49,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 16:19:49,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-13 16:19:49,931 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:19:49,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 212 flow. Second operand has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 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-13 16:19:49,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:49,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:19:49,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:51,416 INFO L124 PetriNetUnfolderBase]: 422/889 cut-off events. [2024-11-13 16:19:51,416 INFO L125 PetriNetUnfolderBase]: For 717/717 co-relation queries the response was YES. [2024-11-13 16:19:51,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2892 conditions, 889 events. 422/889 cut-off events. For 717/717 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4256 event pairs, 32 based on Foata normal form. 60/937 useless extension candidates. Maximal degree in co-relation 2423. Up to 189 conditions per place. [2024-11-13 16:19:51,425 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 182 selfloop transitions, 58 changer transitions 0/244 dead transitions. [2024-11-13 16:19:51,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 244 transitions, 1478 flow [2024-11-13 16:19:51,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-13 16:19:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-13 16:19:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 525 transitions. [2024-11-13 16:19:51,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39355322338830584 [2024-11-13 16:19:51,430 INFO L175 Difference]: Start difference. First operand has 52 places, 37 transitions, 212 flow. Second operand 46 states and 525 transitions. [2024-11-13 16:19:51,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 244 transitions, 1478 flow [2024-11-13 16:19:51,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 244 transitions, 1340 flow, removed 20 selfloop flow, removed 10 redundant places. [2024-11-13 16:19:51,444 INFO L231 Difference]: Finished difference. Result has 100 places, 81 transitions, 618 flow [2024-11-13 16:19:51,445 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=618, PETRI_PLACES=100, PETRI_TRANSITIONS=81} [2024-11-13 16:19:51,445 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 71 predicate places. [2024-11-13 16:19:51,446 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 81 transitions, 618 flow [2024-11-13 16:19:51,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.166666666666666) internal successors, (147), 18 states have internal predecessors, (147), 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-13 16:19:51,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:51,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:51,470 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:19:51,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:51,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:51,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:51,651 INFO L85 PathProgramCache]: Analyzing trace with hash 952105991, now seen corresponding path program 1 times [2024-11-13 16:19:51,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:51,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103712208] [2024-11-13 16:19:51,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:51,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:51,718 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-13 16:19:51,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:51,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103712208] [2024-11-13 16:19:51,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103712208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:19:51,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:19:51,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:19:51,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661205002] [2024-11-13 16:19:51,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:19:51,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:19:51,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:51,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:19:51,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:19:51,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:19:51,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 81 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 16:19:51,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:51,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:19:51,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:51,868 INFO L124 PetriNetUnfolderBase]: 321/761 cut-off events. [2024-11-13 16:19:51,868 INFO L125 PetriNetUnfolderBase]: For 1274/1274 co-relation queries the response was YES. [2024-11-13 16:19:51,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2706 conditions, 761 events. 321/761 cut-off events. For 1274/1274 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3945 event pairs, 291 based on Foata normal form. 15/762 useless extension candidates. Maximal degree in co-relation 2486. Up to 645 conditions per place. [2024-11-13 16:19:51,876 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 22 selfloop transitions, 1 changer transitions 53/80 dead transitions. [2024-11-13 16:19:51,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 80 transitions, 752 flow [2024-11-13 16:19:51,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:19:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:19:51,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-13 16:19:51,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-13 16:19:51,881 INFO L175 Difference]: Start difference. First operand has 100 places, 81 transitions, 618 flow. Second operand 3 states and 41 transitions. [2024-11-13 16:19:51,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 80 transitions, 752 flow [2024-11-13 16:19:51,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 80 transitions, 548 flow, removed 84 selfloop flow, removed 8 redundant places. [2024-11-13 16:19:51,913 INFO L231 Difference]: Finished difference. Result has 93 places, 27 transitions, 113 flow [2024-11-13 16:19:51,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=93, PETRI_TRANSITIONS=27} [2024-11-13 16:19:51,917 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 64 predicate places. [2024-11-13 16:19:51,917 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 27 transitions, 113 flow [2024-11-13 16:19:51,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 16:19:51,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:51,918 INFO L204 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:51,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 16:19:51,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:51,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:51,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1206200308, now seen corresponding path program 1 times [2024-11-13 16:19:51,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670772218] [2024-11-13 16:19:51,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:52,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:52,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670772218] [2024-11-13 16:19:52,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670772218] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:19:52,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853972712] [2024-11-13 16:19:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:52,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:52,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:19:52,365 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:19:52,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:19:52,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:52,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 16:19:52,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:52,908 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:19:53,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853972712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:19:53,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:19:53,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2024-11-13 16:19:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626340744] [2024-11-13 16:19:53,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:19:53,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-13 16:19:53,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:53,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-13 16:19:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2024-11-13 16:19:53,512 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:19:53,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 27 transitions, 113 flow. Second operand has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-13 16:19:53,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:53,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:19:53,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:19:54,697 INFO L124 PetriNetUnfolderBase]: 147/309 cut-off events. [2024-11-13 16:19:54,697 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-13 16:19:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 309 events. 147/309 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 726 event pairs, 15 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 800. Up to 79 conditions per place. [2024-11-13 16:19:54,699 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 80 selfloop transitions, 25 changer transitions 4/111 dead transitions. [2024-11-13 16:19:54,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 547 flow [2024-11-13 16:19:54,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 16:19:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-13 16:19:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 283 transitions. [2024-11-13 16:19:54,702 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3614303959131545 [2024-11-13 16:19:54,702 INFO L175 Difference]: Start difference. First operand has 93 places, 27 transitions, 113 flow. Second operand 27 states and 283 transitions. [2024-11-13 16:19:54,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 547 flow [2024-11-13 16:19:54,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 111 transitions, 502 flow, removed 13 selfloop flow, removed 20 redundant places. [2024-11-13 16:19:54,707 INFO L231 Difference]: Finished difference. Result has 71 places, 38 transitions, 211 flow [2024-11-13 16:19:54,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=211, PETRI_PLACES=71, PETRI_TRANSITIONS=38} [2024-11-13 16:19:54,709 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 42 predicate places. [2024-11-13 16:19:54,709 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 38 transitions, 211 flow [2024-11-13 16:19:54,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 7.325) internal successors, (293), 40 states have internal predecessors, (293), 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-13 16:19:54,710 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:19:54,710 INFO L204 CegarLoopForPetriNet]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:19:54,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:19:54,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:54,915 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:19:54,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:19:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -897053772, now seen corresponding path program 2 times [2024-11-13 16:19:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:19:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938383008] [2024-11-13 16:19:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:19:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:19:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:19:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:19:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938383008] [2024-11-13 16:19:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938383008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:19:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457709587] [2024-11-13 16:19:55,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:19:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:19:55,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:19:55,605 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:19:55,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:19:55,689 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:19:55,689 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:19:55,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-13 16:19:55,692 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:19:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:56,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:19:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:19:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457709587] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:19:57,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:19:57,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 75 [2024-11-13 16:19:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952023685] [2024-11-13 16:19:57,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:19:57,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2024-11-13 16:19:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:19:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2024-11-13 16:19:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1441, Invalid=4259, Unknown=0, NotChecked=0, Total=5700 [2024-11-13 16:19:57,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:19:57,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 38 transitions, 211 flow. Second operand has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-13 16:19:57,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:19:57,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:19:57,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:20:01,097 INFO L124 PetriNetUnfolderBase]: 262/539 cut-off events. [2024-11-13 16:20:01,098 INFO L125 PetriNetUnfolderBase]: For 8287/8287 co-relation queries the response was YES. [2024-11-13 16:20:01,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1654 conditions, 539 events. 262/539 cut-off events. For 8287/8287 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 1245 event pairs, 15 based on Foata normal form. 120/659 useless extension candidates. Maximal degree in co-relation 1635. Up to 199 conditions per place. [2024-11-13 16:20:01,102 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 152 selfloop transitions, 49 changer transitions 0/203 dead transitions. [2024-11-13 16:20:01,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 203 transitions, 1086 flow [2024-11-13 16:20:01,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-13 16:20:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-11-13 16:20:01,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 525 transitions. [2024-11-13 16:20:01,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-13 16:20:01,106 INFO L175 Difference]: Start difference. First operand has 71 places, 38 transitions, 211 flow. Second operand 50 states and 525 transitions. [2024-11-13 16:20:01,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 203 transitions, 1086 flow [2024-11-13 16:20:01,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 203 transitions, 1015 flow, removed 24 selfloop flow, removed 12 redundant places. [2024-11-13 16:20:01,119 INFO L231 Difference]: Finished difference. Result has 128 places, 62 transitions, 480 flow [2024-11-13 16:20:01,119 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=480, PETRI_PLACES=128, PETRI_TRANSITIONS=62} [2024-11-13 16:20:01,120 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2024-11-13 16:20:01,120 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 62 transitions, 480 flow [2024-11-13 16:20:01,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 7.171052631578948) internal successors, (545), 76 states have internal predecessors, (545), 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-13 16:20:01,121 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:20:01,121 INFO L204 CegarLoopForPetriNet]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:01,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 16:20:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:20:01,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:20:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:01,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1336478924, now seen corresponding path program 3 times [2024-11-13 16:20:01,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:20:01,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279372105] [2024-11-13 16:20:01,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:01,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:20:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:03,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:20:03,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279372105] [2024-11-13 16:20:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279372105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:20:03,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500111352] [2024-11-13 16:20:03,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:20:03,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:20:03,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:03,892 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:20:03,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:20:04,026 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-11-13 16:20:04,026 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:20:04,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-13 16:20:04,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:07,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:07,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:20:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:12,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500111352] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:20:12,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:20:12,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 147 [2024-11-13 16:20:12,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249800186] [2024-11-13 16:20:12,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:20:12,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2024-11-13 16:20:12,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:20:12,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2024-11-13 16:20:12,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5749, Invalid=16007, Unknown=0, NotChecked=0, Total=21756 [2024-11-13 16:20:13,023 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:20:13,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 62 transitions, 480 flow. Second operand has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-13 16:20:13,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:20:13,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:20:13,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:20:24,194 INFO L124 PetriNetUnfolderBase]: 502/1019 cut-off events. [2024-11-13 16:20:24,194 INFO L125 PetriNetUnfolderBase]: For 154385/154385 co-relation queries the response was YES. [2024-11-13 16:20:24,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1019 events. 502/1019 cut-off events. For 154385/154385 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2365 event pairs, 15 based on Foata normal form. 240/1259 useless extension candidates. Maximal degree in co-relation 3629. Up to 379 conditions per place. [2024-11-13 16:20:24,205 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 296 selfloop transitions, 97 changer transitions 0/395 dead transitions. [2024-11-13 16:20:24,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 395 transitions, 2315 flow [2024-11-13 16:20:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2024-11-13 16:20:24,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2024-11-13 16:20:24,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 1029 transitions. [2024-11-13 16:20:24,214 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3620689655172414 [2024-11-13 16:20:24,215 INFO L175 Difference]: Start difference. First operand has 128 places, 62 transitions, 480 flow. Second operand 98 states and 1029 transitions. [2024-11-13 16:20:24,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 395 transitions, 2315 flow [2024-11-13 16:20:24,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 395 transitions, 2023 flow, removed 121 selfloop flow, removed 25 redundant places. [2024-11-13 16:20:24,307 INFO L231 Difference]: Finished difference. Result has 248 places, 110 transitions, 960 flow [2024-11-13 16:20:24,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=960, PETRI_PLACES=248, PETRI_TRANSITIONS=110} [2024-11-13 16:20:24,310 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 219 predicate places. [2024-11-13 16:20:24,310 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 110 transitions, 960 flow [2024-11-13 16:20:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 7.087837837837838) internal successors, (1049), 148 states have internal predecessors, (1049), 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-13 16:20:24,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:20:24,312 INFO L204 CegarLoopForPetriNet]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:20:24,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:20:24,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:20:24,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:20:24,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:20:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -94813644, now seen corresponding path program 4 times [2024-11-13 16:20:24,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:20:24,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283131222] [2024-11-13 16:20:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:20:24,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:20:24,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:20:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:32,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 16:20:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283131222] [2024-11-13 16:20:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283131222] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 16:20:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401831028] [2024-11-13 16:20:32,749 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:20:32,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:20:32,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:20:32,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:20:32,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:20:32,906 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:20:32,906 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:20:32,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 99 conjuncts are in the unsatisfiable core [2024-11-13 16:20:32,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:20:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:44,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:20:59,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:20:59,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401831028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:20:59,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 16:20:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 291 [2024-11-13 16:20:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474956049] [2024-11-13 16:20:59,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 16:20:59,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 292 states [2024-11-13 16:20:59,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 16:20:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 292 interpolants. [2024-11-13 16:20:59,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19089, Invalid=65883, Unknown=0, NotChecked=0, Total=84972 [2024-11-13 16:21:00,311 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:21:00,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 110 transitions, 960 flow. Second operand has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-13 16:21:00,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:00,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:21:00,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:18,134 INFO L124 PetriNetUnfolderBase]: 537/1089 cut-off events. [2024-11-13 16:21:18,135 INFO L125 PetriNetUnfolderBase]: For 139338/139338 co-relation queries the response was YES. [2024-11-13 16:21:18,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4205 conditions, 1089 events. 537/1089 cut-off events. For 139338/139338 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 2529 event pairs, 15 based on Foata normal form. 35/1124 useless extension candidates. Maximal degree in co-relation 4114. Up to 294 conditions per place. [2024-11-13 16:21:18,146 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 317 selfloop transitions, 104 changer transitions 0/423 dead transitions. [2024-11-13 16:21:18,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 423 transitions, 2572 flow [2024-11-13 16:21:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2024-11-13 16:21:18,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2024-11-13 16:21:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 1058 transitions. [2024-11-13 16:21:18,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3474548440065681 [2024-11-13 16:21:18,152 INFO L175 Difference]: Start difference. First operand has 248 places, 110 transitions, 960 flow. Second operand 105 states and 1058 transitions. [2024-11-13 16:21:18,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 423 transitions, 2572 flow [2024-11-13 16:21:18,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 423 transitions, 2170 flow, removed 152 selfloop flow, removed 49 redundant places. [2024-11-13 16:21:18,336 INFO L231 Difference]: Finished difference. Result has 310 places, 117 transitions, 852 flow [2024-11-13 16:21:18,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=852, PETRI_PLACES=310, PETRI_TRANSITIONS=117} [2024-11-13 16:21:18,337 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 281 predicate places. [2024-11-13 16:21:18,337 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 117 transitions, 852 flow [2024-11-13 16:21:18,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 292 states, 292 states have (on average 7.044520547945205) internal successors, (2057), 292 states have internal predecessors, (2057), 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-13 16:21:18,339 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:18,339 INFO L204 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:18,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:21:18,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:18,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:18,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1828454265, now seen corresponding path program 5 times [2024-11-13 16:21:18,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 16:21:18,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439370397] [2024-11-13 16:21:18,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:18,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 16:21:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:21:18,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:21:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:21:18,835 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 16:21:18,837 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:21:18,839 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-13 16:21:18,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-13 16:21:18,841 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-13 16:21:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-13 16:21:18,842 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-13 16:21:18,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 16:21:18,843 INFO L407 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1] [2024-11-13 16:21:19,006 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:21:19,007 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:21:19,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:21:19 BasicIcfg [2024-11-13 16:21:19,015 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:21:19,016 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:21:19,016 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:21:19,017 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:21:19,017 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:19:45" (3/4) ... [2024-11-13 16:21:19,020 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:21:19,022 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:21:19,023 INFO L158 Benchmark]: Toolchain (without parser) took 94643.77ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 91.3MB in the beginning and 294.8MB in the end (delta: -203.6MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2024-11-13 16:21:19,023 INFO L158 Benchmark]: CDTParser took 0.98ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:21:19,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.47ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 71.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:21:19,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.00ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:21:19,026 INFO L158 Benchmark]: Boogie Preprocessor took 61.60ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 68.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:21:19,026 INFO L158 Benchmark]: RCFGBuilder took 640.24ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 49.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 16:21:19,027 INFO L158 Benchmark]: TraceAbstraction took 93186.60ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 49.1MB in the beginning and 294.9MB in the end (delta: -245.7MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. [2024-11-13 16:21:19,027 INFO L158 Benchmark]: Witness Printer took 6.02ms. Allocated memory is still 436.2MB. Free memory was 294.9MB in the beginning and 294.8MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:21:19,030 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.98ms. Allocated memory is still 117.4MB. Free memory is still 74.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.47ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 71.3MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.00ms. Allocated memory is still 117.4MB. Free memory was 71.0MB in the beginning and 69.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 61.60ms. Allocated memory is still 117.4MB. Free memory was 69.6MB in the beginning and 68.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 640.24ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 49.6MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 93186.60ms. Allocated memory was 117.4MB in the beginning and 436.2MB in the end (delta: 318.8MB). Free memory was 49.1MB in the beginning and 294.9MB in the end (delta: -245.7MB). Peak memory consumption was 225.8MB. Max. memory is 16.1GB. * Witness Printer took 6.02ms. Allocated memory is still 436.2MB. Free memory was 294.9MB in the beginning and 294.8MB in the end (delta: 66.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-2] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-2, t2=-1] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 43 locations, 5 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: 92.9s, OverallIterations: 10, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 37.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7934 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7925 mSDsluCounter, 491 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3916 IncrementalHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 4 mSDtfsCounter, 3916 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1016 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 900 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51510 ImplicationChecksByTransitivity, 69.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=960occurred in iteration=8, InterpolantAutomatonStates: 353, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 52.7s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 762 ConstructedInterpolants, 0 QuantifiedInterpolants, 3633 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 207 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 7/17596 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 16:21:19,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-theta/unwind1-100.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd --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 d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 16:21:22,333 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 16:21:22,504 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-13 16:21:22,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 16:21:22,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 16:21:22,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 16:21:22,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 16:21:22,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 16:21:22,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 16:21:22,543 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 16:21:22,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 16:21:22,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 16:21:22,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 16:21:22,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 16:21:22,544 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 16:21:22,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 16:21:22,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 16:21:22,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 16:21:22,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 16:21:22,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 16:21:22,545 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 16:21:22,545 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 16:21:22,545 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 16:21:22,546 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 16:21:22,546 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 16:21:22,546 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 16:21:22,546 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 16:21:22,546 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 16:21:22,547 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 16:21:22,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:21:22,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 16:21:22,548 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd 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 -> d866fedd3df666b1282e36d0ae87b17d0a587658c87dddd4d2314d9586432757 [2024-11-13 16:21:22,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 16:21:22,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 16:21:22,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 16:21:22,943 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 16:21:22,944 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 16:21:22,945 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread-theta/unwind1-100.i Unable to find full path for "g++" [2024-11-13 16:21:25,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 16:21:25,912 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 16:21:25,915 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/sv-benchmarks/c/pthread-theta/unwind1-100.i [2024-11-13 16:21:25,943 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/6a1112347/f3b129b4bd1f428bb6738c46f915ab44/FLAG4546fc66e [2024-11-13 16:21:25,973 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/data/6a1112347/f3b129b4bd1f428bb6738c46f915ab44 [2024-11-13 16:21:25,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 16:21:25,978 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 16:21:25,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 16:21:25,983 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 16:21:25,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 16:21:25,990 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:21:25" (1/1) ... [2024-11-13 16:21:25,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5c4ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:25, skipping insertion in model container [2024-11-13 16:21:25,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 04:21:25" (1/1) ... [2024-11-13 16:21:26,057 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 16:21:26,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:21:26,692 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 16:21:26,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 16:21:26,867 INFO L204 MainTranslator]: Completed translation [2024-11-13 16:21:26,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26 WrapperNode [2024-11-13 16:21:26,869 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 16:21:26,871 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 16:21:26,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 16:21:26,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 16:21:26,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:26,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:26,951 INFO L138 Inliner]: procedures = 170, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 56 [2024-11-13 16:21:26,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 16:21:26,955 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 16:21:26,955 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 16:21:26,956 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 16:21:26,966 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:26,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:26,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:26,999 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-13 16:21:27,004 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,004 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,015 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,027 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,034 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 16:21:27,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 16:21:27,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 16:21:27,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 16:21:27,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (1/1) ... [2024-11-13 16:21:27,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 16:21:27,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:27,095 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 16:21:27,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 16:21:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 16:21:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-13 16:21:27,137 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-13 16:21:27,137 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-13 16:21:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-13 16:21:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 16:21:27,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 16:21:27,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 16:21:27,140 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 16:21:27,358 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 16:21:27,361 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 16:21:27,570 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 16:21:27,570 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 16:21:27,816 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 16:21:27,816 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 16:21:27,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:21:27 BoogieIcfgContainer [2024-11-13 16:21:27,817 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 16:21:27,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 16:21:27,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 16:21:27,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 16:21:27,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 04:21:25" (1/3) ... [2024-11-13 16:21:27,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aed133d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:21:27, skipping insertion in model container [2024-11-13 16:21:27,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 04:21:26" (2/3) ... [2024-11-13 16:21:27,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aed133d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 04:21:27, skipping insertion in model container [2024-11-13 16:21:27,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:21:27" (3/3) ... [2024-11-13 16:21:27,831 INFO L112 eAbstractionObserver]: Analyzing ICFG unwind1-100.i [2024-11-13 16:21:27,852 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 16:21:27,854 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind1-100.i that has 3 procedures, 26 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-13 16:21:27,854 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 16:21:27,929 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 16:21:27,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-11-13 16:21:28,048 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-11-13 16:21:28,052 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 16:21:28,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2024-11-13 16:21:28,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-11-13 16:21:28,062 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-11-13 16:21:28,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 16:21:28,093 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;@6d26b476, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 16:21:28,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-13 16:21:28,110 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 16:21:28,113 INFO L124 PetriNetUnfolderBase]: 4/21 cut-off events. [2024-11-13 16:21:28,114 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-13 16:21:28,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:28,115 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:28,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:28,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1926184360, now seen corresponding path program 1 times [2024-11-13 16:21:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [616763049] [2024-11-13 16:21:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:28,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:28,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:28,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:28,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 16:21:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:21:28,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 16:21:28,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:28,461 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-13 16:21:28,462 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:21:28,463 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:28,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [616763049] [2024-11-13 16:21:28,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [616763049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:21:28,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:21:28,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 16:21:28,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835712627] [2024-11-13 16:21:28,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:21:28,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 16:21:28,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:28,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 16:21:28,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-13 16:21:28,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-11-13 16:21:28,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 16:21:28,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:28,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-11-13 16:21:28,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:28,848 INFO L124 PetriNetUnfolderBase]: 124/273 cut-off events. [2024-11-13 16:21:28,848 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-13 16:21:28,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 273 events. 124/273 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1167 event pairs, 68 based on Foata normal form. 33/265 useless extension candidates. Maximal degree in co-relation 460. Up to 146 conditions per place. [2024-11-13 16:21:28,854 INFO L140 encePairwiseOnDemand]: 21/29 looper letters, 27 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2024-11-13 16:21:28,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 163 flow [2024-11-13 16:21:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:21:28,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 16:21:28,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2024-11-13 16:21:28,872 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2024-11-13 16:21:28,874 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 5 states and 80 transitions. [2024-11-13 16:21:28,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 163 flow [2024-11-13 16:21:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 39 transitions, 149 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 16:21:28,885 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 80 flow [2024-11-13 16:21:28,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2024-11-13 16:21:28,893 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 1 predicate places. [2024-11-13 16:21:28,893 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 80 flow [2024-11-13 16:21:28,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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-13 16:21:28,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:28,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:28,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 16:21:29,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:29,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:29,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:29,100 INFO L85 PathProgramCache]: Analyzing trace with hash 416841141, now seen corresponding path program 1 times [2024-11-13 16:21:29,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:29,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [951575306] [2024-11-13 16:21:29,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:29,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:29,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:29,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:29,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 16:21:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:21:29,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 16:21:29,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:29,280 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:21:29,280 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:29,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951575306] [2024-11-13 16:21:29,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951575306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:21:29,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:21:29,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 16:21:29,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110761361] [2024-11-13 16:21:29,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:21:29,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 16:21:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 16:21:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 16:21:29,292 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-13 16:21:29,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:21:29,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:29,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-13 16:21:29,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:29,549 INFO L124 PetriNetUnfolderBase]: 111/247 cut-off events. [2024-11-13 16:21:29,551 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2024-11-13 16:21:29,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 589 conditions, 247 events. 111/247 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 934 event pairs, 30 based on Foata normal form. 13/245 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2024-11-13 16:21:29,557 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2024-11-13 16:21:29,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 216 flow [2024-11-13 16:21:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 16:21:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-13 16:21:29,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2024-11-13 16:21:29,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-11-13 16:21:29,561 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 80 flow. Second operand 5 states and 73 transitions. [2024-11-13 16:21:29,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 216 flow [2024-11-13 16:21:29,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 44 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 16:21:29,568 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 111 flow [2024-11-13 16:21:29,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-13 16:21:29,570 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 6 predicate places. [2024-11-13 16:21:29,571 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 111 flow [2024-11-13 16:21:29,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 16:21:29,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:29,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:29,604 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 16:21:29,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:29,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1737908583, now seen corresponding path program 1 times [2024-11-13 16:21:29,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:29,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [748967084] [2024-11-13 16:21:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:29,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:29,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:29,788 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:29,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 16:21:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:21:29,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 16:21:29,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:30,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:30,149 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:30,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748967084] [2024-11-13 16:21:30,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748967084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:30,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:30,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-13 16:21:30,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029250105] [2024-11-13 16:21:30,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:30,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 16:21:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 16:21:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 16:21:30,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-11-13 16:21:30,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 111 flow. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-13 16:21:30,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:30,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-11-13 16:21:30,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:30,836 INFO L124 PetriNetUnfolderBase]: 163/372 cut-off events. [2024-11-13 16:21:30,837 INFO L125 PetriNetUnfolderBase]: For 214/214 co-relation queries the response was YES. [2024-11-13 16:21:30,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 372 events. 163/372 cut-off events. For 214/214 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1626 event pairs, 63 based on Foata normal form. 10/362 useless extension candidates. Maximal degree in co-relation 554. Up to 93 conditions per place. [2024-11-13 16:21:30,842 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 52 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2024-11-13 16:21:30,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 375 flow [2024-11-13 16:21:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 16:21:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-13 16:21:30,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 142 transitions. [2024-11-13 16:21:30,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.445141065830721 [2024-11-13 16:21:30,845 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 111 flow. Second operand 11 states and 142 transitions. [2024-11-13 16:21:30,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 375 flow [2024-11-13 16:21:30,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 70 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 16:21:30,851 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 196 flow [2024-11-13 16:21:30,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=196, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-11-13 16:21:30,852 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 21 predicate places. [2024-11-13 16:21:30,852 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 196 flow [2024-11-13 16:21:30,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 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-13 16:21:30,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:30,853 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:30,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 16:21:31,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:31,058 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:31,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:31,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1893778804, now seen corresponding path program 1 times [2024-11-13 16:21:31,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:31,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655741646] [2024-11-13 16:21:31,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:31,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:31,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:31,063 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:31,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 16:21:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:21:31,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 16:21:31,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:31,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:31,284 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:31,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:31,438 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:31,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655741646] [2024-11-13 16:21:31,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655741646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:31,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:31,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-13 16:21:31,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696739281] [2024-11-13 16:21:31,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:31,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:21:31,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:31,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:21:31,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:21:31,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:21:31,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 196 flow. Second operand has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-13 16:21:31,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:31,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:21:31,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:32,336 INFO L124 PetriNetUnfolderBase]: 291/634 cut-off events. [2024-11-13 16:21:32,336 INFO L125 PetriNetUnfolderBase]: For 580/588 co-relation queries the response was YES. [2024-11-13 16:21:32,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 634 events. 291/634 cut-off events. For 580/588 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3027 event pairs, 61 based on Foata normal form. 38/656 useless extension candidates. Maximal degree in co-relation 1243. Up to 134 conditions per place. [2024-11-13 16:21:32,343 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 66 selfloop transitions, 28 changer transitions 0/102 dead transitions. [2024-11-13 16:21:32,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 102 transitions, 605 flow [2024-11-13 16:21:32,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 16:21:32,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-13 16:21:32,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 209 transitions. [2024-11-13 16:21:32,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4804597701149425 [2024-11-13 16:21:32,347 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 196 flow. Second operand 15 states and 209 transitions. [2024-11-13 16:21:32,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 102 transitions, 605 flow [2024-11-13 16:21:32,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 558 flow, removed 16 selfloop flow, removed 5 redundant places. [2024-11-13 16:21:32,361 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 339 flow [2024-11-13 16:21:32,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=339, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2024-11-13 16:21:32,362 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 35 predicate places. [2024-11-13 16:21:32,362 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 339 flow [2024-11-13 16:21:32,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.833333333333334) internal successors, (118), 12 states have internal predecessors, (118), 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-13 16:21:32,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:32,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:32,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-13 16:21:32,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:32,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash 532941955, now seen corresponding path program 1 times [2024-11-13 16:21:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:32,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [42454882] [2024-11-13 16:21:32,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 16:21:32,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:32,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:32,572 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:32,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 16:21:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 16:21:32,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-13 16:21:32,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:32,706 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-13 16:21:32,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 16:21:32,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:32,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42454882] [2024-11-13 16:21:32,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42454882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 16:21:32,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 16:21:32,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 16:21:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481510561] [2024-11-13 16:21:32,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 16:21:32,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 16:21:32,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:32,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 16:21:32,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 16:21:32,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:21:32,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 16:21:32,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:32,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:21:32,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:32,853 INFO L124 PetriNetUnfolderBase]: 233/564 cut-off events. [2024-11-13 16:21:32,854 INFO L125 PetriNetUnfolderBase]: For 1024/1024 co-relation queries the response was YES. [2024-11-13 16:21:32,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 564 events. 233/564 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2859 event pairs, 223 based on Foata normal form. 10/556 useless extension candidates. Maximal degree in co-relation 1687. Up to 472 conditions per place. [2024-11-13 16:21:32,859 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 27 selfloop transitions, 1 changer transitions 17/50 dead transitions. [2024-11-13 16:21:32,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 50 transitions, 419 flow [2024-11-13 16:21:32,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 16:21:32,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 16:21:32,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-13 16:21:32,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47126436781609193 [2024-11-13 16:21:32,861 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 339 flow. Second operand 3 states and 41 transitions. [2024-11-13 16:21:32,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 50 transitions, 419 flow [2024-11-13 16:21:32,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 322 flow, removed 36 selfloop flow, removed 7 redundant places. [2024-11-13 16:21:32,874 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 153 flow [2024-11-13 16:21:32,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-11-13 16:21:32,875 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 29 predicate places. [2024-11-13 16:21:32,875 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 153 flow [2024-11-13 16:21:32,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-13 16:21:32,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:32,876 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:32,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 16:21:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:33,080 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash -666920236, now seen corresponding path program 2 times [2024-11-13 16:21:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755036737] [2024-11-13 16:21:33,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:21:33,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:33,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:33,085 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:33,087 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 16:21:33,188 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:21:33,188 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:21:33,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:21:33,193 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:33,431 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:33,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:33,863 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755036737] [2024-11-13 16:21:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755036737] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:33,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-11-13 16:21:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227260703] [2024-11-13 16:21:33,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:33,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-13 16:21:33,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-13 16:21:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-13 16:21:34,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:21:34,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 153 flow. Second operand has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 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-13 16:21:34,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:34,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:21:34,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:35,651 INFO L124 PetriNetUnfolderBase]: 365/758 cut-off events. [2024-11-13 16:21:35,652 INFO L125 PetriNetUnfolderBase]: For 1044/1044 co-relation queries the response was YES. [2024-11-13 16:21:35,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2149 conditions, 758 events. 365/758 cut-off events. For 1044/1044 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3309 event pairs, 45 based on Foata normal form. 80/830 useless extension candidates. Maximal degree in co-relation 2131. Up to 191 conditions per place. [2024-11-13 16:21:35,656 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 55 selfloop transitions, 31 changer transitions 44/134 dead transitions. [2024-11-13 16:21:35,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 742 flow [2024-11-13 16:21:35,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-13 16:21:35,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-11-13 16:21:35,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 330 transitions. [2024-11-13 16:21:35,659 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4376657824933687 [2024-11-13 16:21:35,660 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 153 flow. Second operand 26 states and 330 transitions. [2024-11-13 16:21:35,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 742 flow [2024-11-13 16:21:35,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 134 transitions, 690 flow, removed 11 selfloop flow, removed 13 redundant places. [2024-11-13 16:21:35,666 INFO L231 Difference]: Finished difference. Result has 76 places, 48 transitions, 331 flow [2024-11-13 16:21:35,666 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=331, PETRI_PLACES=76, PETRI_TRANSITIONS=48} [2024-11-13 16:21:35,667 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 47 predicate places. [2024-11-13 16:21:35,667 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 48 transitions, 331 flow [2024-11-13 16:21:35,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 9.5) internal successors, (190), 20 states have internal predecessors, (190), 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-13 16:21:35,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:35,667 INFO L204 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:35,691 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 16:21:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:35,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash -79127212, now seen corresponding path program 3 times [2024-11-13 16:21:35,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1616656301] [2024-11-13 16:21:35,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:21:35,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:35,869 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:35,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:35,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 16:21:35,939 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 16:21:35,939 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:21:35,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-13 16:21:35,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:36,223 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-13 16:21:36,224 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:36,909 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-13 16:21:36,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:36,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616656301] [2024-11-13 16:21:36,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616656301] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:36,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:36,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2024-11-13 16:21:36,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816425067] [2024-11-13 16:21:36,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:36,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 16:21:36,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:36,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 16:21:36,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-13 16:21:36,963 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 29 [2024-11-13 16:21:36,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 48 transitions, 331 flow. Second operand has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 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-13 16:21:36,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:36,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 29 [2024-11-13 16:21:36,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:37,734 INFO L124 PetriNetUnfolderBase]: 196/406 cut-off events. [2024-11-13 16:21:37,734 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2024-11-13 16:21:37,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1451 conditions, 406 events. 196/406 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1319 event pairs, 57 based on Foata normal form. 5/407 useless extension candidates. Maximal degree in co-relation 1427. Up to 180 conditions per place. [2024-11-13 16:21:37,738 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 30 selfloop transitions, 4 changer transitions 33/69 dead transitions. [2024-11-13 16:21:37,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 69 transitions, 532 flow [2024-11-13 16:21:37,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 16:21:37,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 16:21:37,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-11-13 16:21:37,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.367816091954023 [2024-11-13 16:21:37,740 INFO L175 Difference]: Start difference. First operand has 76 places, 48 transitions, 331 flow. Second operand 9 states and 96 transitions. [2024-11-13 16:21:37,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 69 transitions, 532 flow [2024-11-13 16:21:37,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 427 flow, removed 40 selfloop flow, removed 15 redundant places. [2024-11-13 16:21:37,746 INFO L231 Difference]: Finished difference. Result has 60 places, 30 transitions, 149 flow [2024-11-13 16:21:37,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=149, PETRI_PLACES=60, PETRI_TRANSITIONS=30} [2024-11-13 16:21:37,747 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2024-11-13 16:21:37,747 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 30 transitions, 149 flow [2024-11-13 16:21:37,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 states have internal predecessors, (97), 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-13 16:21:37,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:37,748 INFO L204 CegarLoopForPetriNet]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:37,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 16:21:37,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:37,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:37,954 INFO L85 PathProgramCache]: Analyzing trace with hash -276600524, now seen corresponding path program 2 times [2024-11-13 16:21:37,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:37,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [739848311] [2024-11-13 16:21:37,955 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 16:21:37,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:37,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:37,957 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:37,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 16:21:38,041 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 16:21:38,042 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:21:38,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-13 16:21:38,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:38,483 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:38,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:39,586 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:39,587 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:39,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739848311] [2024-11-13 16:21:39,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739848311] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:39,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:39,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 35 [2024-11-13 16:21:39,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935675869] [2024-11-13 16:21:39,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:39,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-13 16:21:39,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-13 16:21:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=934, Unknown=0, NotChecked=0, Total=1260 [2024-11-13 16:21:40,780 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:21:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 30 transitions, 149 flow. Second operand has 36 states, 36 states have (on average 9.277777777777779) internal successors, (334), 36 states have internal predecessors, (334), 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-13 16:21:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:40,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:21:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:21:46,466 INFO L124 PetriNetUnfolderBase]: 259/535 cut-off events. [2024-11-13 16:21:46,467 INFO L125 PetriNetUnfolderBase]: For 3251/3251 co-relation queries the response was YES. [2024-11-13 16:21:46,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2320 conditions, 535 events. 259/535 cut-off events. For 3251/3251 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1541 event pairs, 24 based on Foata normal form. 80/613 useless extension candidates. Maximal degree in co-relation 2301. Up to 176 conditions per place. [2024-11-13 16:21:46,472 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 101 selfloop transitions, 32 changer transitions 64/200 dead transitions. [2024-11-13 16:21:46,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 200 transitions, 1345 flow [2024-11-13 16:21:46,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-13 16:21:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2024-11-13 16:21:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 605 transitions. [2024-11-13 16:21:46,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4257565095003519 [2024-11-13 16:21:46,477 INFO L175 Difference]: Start difference. First operand has 60 places, 30 transitions, 149 flow. Second operand 49 states and 605 transitions. [2024-11-13 16:21:46,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 200 transitions, 1345 flow [2024-11-13 16:21:46,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 200 transitions, 1277 flow, removed 30 selfloop flow, removed 6 redundant places. [2024-11-13 16:21:46,487 INFO L231 Difference]: Finished difference. Result has 124 places, 46 transitions, 403 flow [2024-11-13 16:21:46,487 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=403, PETRI_PLACES=124, PETRI_TRANSITIONS=46} [2024-11-13 16:21:46,488 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 95 predicate places. [2024-11-13 16:21:46,488 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 46 transitions, 403 flow [2024-11-13 16:21:46,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.277777777777779) internal successors, (334), 36 states have internal predecessors, (334), 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-13 16:21:46,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:21:46,489 INFO L204 CegarLoopForPetriNet]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:21:46,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 16:21:46,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:46,694 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:21:46,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:21:46,695 INFO L85 PathProgramCache]: Analyzing trace with hash -771609036, now seen corresponding path program 3 times [2024-11-13 16:21:46,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:21:46,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019404900] [2024-11-13 16:21:46,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 16:21:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:21:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:21:46,698 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:21:46,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 16:21:46,882 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2024-11-13 16:21:46,882 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:21:46,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-13 16:21:46,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:21:48,171 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:48,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:21:52,706 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:21:52,706 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:21:52,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019404900] [2024-11-13 16:21:52,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019404900] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:21:52,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:21:52,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 67 [2024-11-13 16:21:52,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152716509] [2024-11-13 16:21:52,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:21:52,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-11-13 16:21:52,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:21:52,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-11-13 16:21:52,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1158, Invalid=3398, Unknown=0, NotChecked=0, Total=4556 [2024-11-13 16:21:57,275 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:21:57,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 46 transitions, 403 flow. Second operand has 68 states, 68 states have (on average 9.147058823529411) internal successors, (622), 68 states have internal predecessors, (622), 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-13 16:21:57,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:21:57,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:21:57,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:22:30,331 INFO L124 PetriNetUnfolderBase]: 499/1015 cut-off events. [2024-11-13 16:22:30,332 INFO L125 PetriNetUnfolderBase]: For 65520/65520 co-relation queries the response was YES. [2024-11-13 16:22:30,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7467 conditions, 1015 events. 499/1015 cut-off events. For 65520/65520 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2944 event pairs, 24 based on Foata normal form. 160/1173 useless extension candidates. Maximal degree in co-relation 7418. Up to 416 conditions per place. [2024-11-13 16:22:30,347 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 197 selfloop transitions, 64 changer transitions 128/392 dead transitions. [2024-11-13 16:22:30,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 392 transitions, 3823 flow [2024-11-13 16:22:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-11-13 16:22:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2024-11-13 16:22:30,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 1197 transitions. [2024-11-13 16:22:30,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4255243512264486 [2024-11-13 16:22:30,355 INFO L175 Difference]: Start difference. First operand has 124 places, 46 transitions, 403 flow. Second operand 97 states and 1197 transitions. [2024-11-13 16:22:30,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 392 transitions, 3823 flow [2024-11-13 16:22:30,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 392 transitions, 3565 flow, removed 113 selfloop flow, removed 32 redundant places. [2024-11-13 16:22:30,541 INFO L231 Difference]: Finished difference. Result has 236 places, 78 transitions, 787 flow [2024-11-13 16:22:30,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=787, PETRI_PLACES=236, PETRI_TRANSITIONS=78} [2024-11-13 16:22:30,545 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 207 predicate places. [2024-11-13 16:22:30,546 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 78 transitions, 787 flow [2024-11-13 16:22:30,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 9.147058823529411) internal successors, (622), 68 states have internal predecessors, (622), 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-13 16:22:30,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:22:30,548 INFO L204 CegarLoopForPetriNet]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:22:30,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 16:22:30,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:30,752 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:22:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:22:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 511817780, now seen corresponding path program 4 times [2024-11-13 16:22:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:22:30,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1507017273] [2024-11-13 16:22:30,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-13 16:22:30,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:22:30,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:22:30,757 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:22:30,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 16:22:30,888 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-13 16:22:30,888 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 16:22:30,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 68 conjuncts are in the unsatisfiable core [2024-11-13 16:22:30,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 16:22:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:34,575 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 16:22:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 16:22:50,395 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 16:22:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507017273] [2024-11-13 16:22:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507017273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 16:22:50,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 16:22:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 131 [2024-11-13 16:22:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155464645] [2024-11-13 16:22:50,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 16:22:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2024-11-13 16:22:50,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 16:22:50,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2024-11-13 16:22:50,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4058, Invalid=13234, Unknown=0, NotChecked=0, Total=17292 [2024-11-13 16:23:02,709 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2024-11-13 16:23:02,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 78 transitions, 787 flow. Second operand has 132 states, 132 states have (on average 9.075757575757576) internal successors, (1198), 132 states have internal predecessors, (1198), 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-13 16:23:02,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 16:23:02,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2024-11-13 16:23:02,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 16:24:25,895 INFO L124 PetriNetUnfolderBase]: 729/1475 cut-off events. [2024-11-13 16:24:25,895 INFO L125 PetriNetUnfolderBase]: For 407394/407394 co-relation queries the response was YES. [2024-11-13 16:24:25,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16490 conditions, 1475 events. 729/1475 cut-off events. For 407394/407394 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 4355 event pairs, 24 based on Foata normal form. 195/1668 useless extension candidates. Maximal degree in co-relation 16393. Up to 566 conditions per place. [2024-11-13 16:24:25,929 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 314 selfloop transitions, 103 changer transitions 156/576 dead transitions. [2024-11-13 16:24:25,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 576 transitions, 7827 flow [2024-11-13 16:24:25,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2024-11-13 16:24:25,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2024-11-13 16:24:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 1756 transitions. [2024-11-13 16:24:25,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4234386303351821 [2024-11-13 16:24:25,940 INFO L175 Difference]: Start difference. First operand has 236 places, 78 transitions, 787 flow. Second operand 143 states and 1756 transitions. [2024-11-13 16:24:25,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 576 transitions, 7827 flow [2024-11-13 16:24:27,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 576 transitions, 7363 flow, removed 200 selfloop flow, removed 64 redundant places. [2024-11-13 16:24:27,121 INFO L231 Difference]: Finished difference. Result has 360 places, 117 transitions, 1155 flow [2024-11-13 16:24:27,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=143, PETRI_FLOW=1155, PETRI_PLACES=360, PETRI_TRANSITIONS=117} [2024-11-13 16:24:27,123 INFO L277 CegarLoopForPetriNet]: 29 programPoint places, 331 predicate places. [2024-11-13 16:24:27,123 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 117 transitions, 1155 flow [2024-11-13 16:24:27,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 9.075757575757576) internal successors, (1198), 132 states have internal predecessors, (1198), 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-13 16:24:27,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 16:24:27,124 INFO L204 CegarLoopForPetriNet]: trace histogram [101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 16:24:27,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 16:24:27,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:27,325 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f2Err0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-11-13 16:24:27,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 16:24:27,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1828454265, now seen corresponding path program 5 times [2024-11-13 16:24:27,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 16:24:27,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678547557] [2024-11-13 16:24:27,327 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-13 16:24:27,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:27,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 16:24:27,329 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 16:24:27,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 16:24:27,982 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 52 check-sat command(s) [2024-11-13 16:24:27,983 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-13 16:24:27,983 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 16:24:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 16:24:28,404 INFO L130 FreeRefinementEngine]: Strategy FOX found a feasible trace [2024-11-13 16:24:28,405 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 16:24:28,406 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (4 of 5 remaining) [2024-11-13 16:24:28,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 5 remaining) [2024-11-13 16:24:28,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-11-13 16:24:28,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-11-13 16:24:28,409 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 5 remaining) [2024-11-13 16:24:28,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-13 16:24:28,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 16:24:28,611 INFO L407 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1] [2024-11-13 16:24:28,798 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-13 16:24:28,798 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 16:24:28,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 04:24:28 BasicIcfg [2024-11-13 16:24:28,806 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 16:24:28,807 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 16:24:28,807 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 16:24:28,807 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 16:24:28,809 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 04:21:27" (3/4) ... [2024-11-13 16:24:28,811 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 16:24:28,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 16:24:28,814 INFO L158 Benchmark]: Toolchain (without parser) took 182835.54ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 59.3MB in the beginning and 44.1MB in the end (delta: 15.2MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-11-13 16:24:28,814 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 83.9MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:28,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 890.23ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 38.8MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-13 16:24:28,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.91ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 36.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:28,815 INFO L158 Benchmark]: Boogie Preprocessor took 86.06ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 34.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:28,816 INFO L158 Benchmark]: RCFGBuilder took 775.28ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 48.6MB in the end (delta: -13.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-13 16:24:28,816 INFO L158 Benchmark]: TraceAbstraction took 180985.67ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 48.1MB in the beginning and 44.1MB in the end (delta: 4.0MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2024-11-13 16:24:28,817 INFO L158 Benchmark]: Witness Printer took 5.74ms. Allocated memory is still 142.6MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 13.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 16:24:28,822 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.49ms. Allocated memory is still 83.9MB. Free memory is still 64.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 890.23ms. Allocated memory is still 83.9MB. Free memory was 59.3MB in the beginning and 38.8MB in the end (delta: 20.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.91ms. Allocated memory is still 83.9MB. Free memory was 38.8MB in the beginning and 36.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 86.06ms. Allocated memory is still 83.9MB. Free memory was 36.9MB in the beginning and 34.8MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 775.28ms. Allocated memory is still 83.9MB. Free memory was 34.8MB in the beginning and 48.6MB in the end (delta: -13.8MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 180985.67ms. Allocated memory was 83.9MB in the beginning and 142.6MB in the end (delta: 58.7MB). Free memory was 48.1MB in the beginning and 44.1MB in the end (delta: 4.0MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. * Witness Printer took 5.74ms. Allocated memory is still 142.6MB. Free memory was 44.1MB in the beginning and 44.1MB in the end (delta: 13.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 752]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 752. Possible FailurePath: [L754] 0 int _N; [L755] 0 atomic_int limit; [L772] 0 _N = 100 [L773] CALL 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L750] COND FALSE 0 !(!cond) [L773] RET 0 assume_abort_if_not(0 <= _N && _N <= 0x7fffffff - 1) [L774] 0 pthread_t t1, t2; [L775] FCALL, FORK 0 pthread_create(&t1, 0, f1, 0) VAL [\old(arg)={0:0}, _N=100, limit=0, t1=-1] [L776] FCALL, FORK 0 pthread_create(&t2, 0, f2, 0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=0, t1=-1, t2=0] [L757] COND FALSE 1 !(__VERIFIER_nondet_int()) [L760] 1 limit = _N + 1 VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L765] 2 int i, bound; [L766] 2 bound = limit [L767] 2 i = 0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=0, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=1, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=2, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=3, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=4, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=5, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=6, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=7, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=8, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=9, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=10, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=11, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=12, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=13, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=14, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=15, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=16, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=17, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=18, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=19, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=20, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=21, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=22, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=23, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=24, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=25, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=26, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=27, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=28, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=29, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=30, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=31, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=32, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=33, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=34, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=35, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=36, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=37, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=38, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=39, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=40, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=41, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=42, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=43, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=44, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=45, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=46, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=47, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=48, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=49, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=50, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=51, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=52, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=53, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=54, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=55, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=56, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=57, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=58, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=59, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=60, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=61, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=62, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=63, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=64, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=65, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=66, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=67, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=68, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=69, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=70, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=71, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=72, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=73, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=74, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=75, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=76, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=77, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=78, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=79, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=80, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=81, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=82, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=83, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=84, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=85, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=86, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=87, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=88, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=89, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=90, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=91, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=92, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=93, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=94, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=95, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=96, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=97, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=98, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=99, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=100, limit=101] [L767] COND TRUE 2 i < bound [L767] 2 i++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, _N=100, arg={0:0}, arg={0:0}, bound=101, i=101, limit=101] [L767] COND FALSE 2 !(i < bound) [L768] CALL 2 __VERIFIER_assert(i <= _N) [L753] COND TRUE 2 !expression [L753] CALL 2 reach_error() [L752] COND FALSE 2 !(0) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] [L752] 2 __assert_fail ("0", "generated/unwind1.h", 11, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, _N=100, arg={0:0}, limit=101] - UnprovableResult [Line: 771]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 43 locations, 5 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: 180.6s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 146.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13997 SdHoareTripleChecker+Valid, 33.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13966 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 28.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 90 mSDsCounter, 111 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39432 IncrementalHoareTripleChecker+Invalid, 39543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 111 mSolverCounterUnsat, 3 mSDtfsCounter, 39432 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13853 ImplicationChecksByTransitivity, 134.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1155occurred in iteration=10, InterpolantAutomatonStates: 363, 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.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 29.3s InterpolantComputationTime, 362 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 445 ConstructedInterpolants, 15 QuantifiedInterpolants, 2250 SizeOfPredicates, 28 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 175 ConjunctsInUnsatCore, 17 InterpolantComputations, 3 PerfectInterpolantSequences, 183/5307 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-13 16:24:28,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0ca84962-c9d1-49b8-8970-2c08a4ae2baa/bin/uautomizer-verify-qhAvR1uOyd/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: UNKNOWN: Overapproximated counterexample