./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:16:10,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:16:10,229 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:16:10,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:16:10,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:16:10,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:16:10,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:16:10,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:16:10,281 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:16:10,286 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:16:10,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:16:10,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:16:10,288 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:16:10,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:16:10,291 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:16:10,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:16:10,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:16:10,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:16:10,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:16:10,293 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:16:10,293 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:16:10,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:16:10,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:16:10,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:16:10,295 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:16:10,296 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:16:10,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:16:10,297 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:16:10,297 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:16:10,298 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:10,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:16:10,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:16:10,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:16:10,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:16:10,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:16:10,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:16:10,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:16:10,301 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:16:10,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb [2023-11-06 21:16:10,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:16:10,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:16:10,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:16:10,611 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:16:10,612 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:16:10,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2023-11-06 21:16:13,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:16:14,110 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:16:14,110 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2023-11-06 21:16:14,132 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/17d0dbd8e/f33a819384a045e0a908d5078bd0b155/FLAG4f00879f0 [2023-11-06 21:16:14,156 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/17d0dbd8e/f33a819384a045e0a908d5078bd0b155 [2023-11-06 21:16:14,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:16:14,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:16:14,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:14,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:16:14,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:16:14,176 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,177 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef2f31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14, skipping insertion in model container [2023-11-06 21:16:14,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:16:14,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:14,717 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:16:14,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:14,825 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:16:14,825 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:16:14,833 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:16:14,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14 WrapperNode [2023-11-06 21:16:14,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:14,835 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:14,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:16:14,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:16:14,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,863 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,892 INFO L138 Inliner]: procedures = 176, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2023-11-06 21:16:14,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:14,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:16:14,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:16:14,894 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:16:14,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,921 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,936 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:16:14,937 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:16:14,937 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:16:14,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:16:14,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (1/1) ... [2023-11-06 21:16:14,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:14,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:14,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:16:14,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:16:15,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:16:15,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:16:15,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:16:15,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:16:15,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:16:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:16:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:16:15,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:16:15,030 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:16:15,030 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:16:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:16:15,031 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:16:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:16:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:16:15,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:16:15,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:16:15,035 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:16:15,225 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:16:15,226 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:16:15,884 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:16:16,396 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:16:16,396 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:16:16,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:16 BoogieIcfgContainer [2023-11-06 21:16:16,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:16:16,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:16:16,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:16:16,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:16:16,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:14" (1/3) ... [2023-11-06 21:16:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7789ce73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:16, skipping insertion in model container [2023-11-06 21:16:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:14" (2/3) ... [2023-11-06 21:16:16,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7789ce73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:16, skipping insertion in model container [2023-11-06 21:16:16,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:16" (3/3) ... [2023-11-06 21:16:16,412 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2023-11-06 21:16:16,432 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:16:16,432 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-06 21:16:16,433 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:16:16,581 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:16:16,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 182 transitions, 376 flow [2023-11-06 21:16:16,761 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2023-11-06 21:16:16,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:16,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 3/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-11-06 21:16:16,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 182 transitions, 376 flow [2023-11-06 21:16:16,783 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 179 transitions, 367 flow [2023-11-06 21:16:16,786 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:16:16,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 179 transitions, 367 flow [2023-11-06 21:16:16,814 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 179 transitions, 367 flow [2023-11-06 21:16:16,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 179 transitions, 367 flow [2023-11-06 21:16:16,914 INFO L124 PetriNetUnfolderBase]: 3/179 cut-off events. [2023-11-06 21:16:16,914 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:16,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 3/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 278 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-11-06 21:16:16,921 INFO L119 LiptonReduction]: Number of co-enabled transitions 7658 [2023-11-06 21:16:28,571 INFO L134 LiptonReduction]: Checked pairs total: 38601 [2023-11-06 21:16:28,571 INFO L136 LiptonReduction]: Total number of compositions: 163 [2023-11-06 21:16:28,587 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:16:28,594 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7c398fed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:16:28,595 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-06 21:16:28,597 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:16:28,597 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 21:16:28,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:28,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:28,598 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:16:28,599 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:28,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1059, now seen corresponding path program 1 times [2023-11-06 21:16:28,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:28,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786683656] [2023-11-06 21:16:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:28,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:28,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:28,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:28,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786683656] [2023-11-06 21:16:28,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786683656] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:28,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:16:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677360743] [2023-11-06 21:16:28,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:28,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:16:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:28,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:16:28,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:16:28,776 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 345 [2023-11-06 21:16:28,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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) [2023-11-06 21:16:28,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:28,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 345 [2023-11-06 21:16:28,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:34,754 INFO L124 PetriNetUnfolderBase]: 23428/32747 cut-off events. [2023-11-06 21:16:34,754 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-06 21:16:34,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65513 conditions, 32747 events. 23428/32747 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2500. Compared 216123 event pairs, 23428 based on Foata normal form. 0/13673 useless extension candidates. Maximal degree in co-relation 65502. Up to 32628 conditions per place. [2023-11-06 21:16:35,044 INFO L140 encePairwiseOnDemand]: 317/345 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-06 21:16:35,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 191 flow [2023-11-06 21:16:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:16:35,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:16:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2023-11-06 21:16:35,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4855072463768116 [2023-11-06 21:16:35,068 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 335 transitions. [2023-11-06 21:16:35,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 335 transitions. [2023-11-06 21:16:35,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:35,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 335 transitions. [2023-11-06 21:16:35,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.5) internal successors, (335), 2 states have internal predecessors, (335), 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) [2023-11-06 21:16:35,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 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) [2023-11-06 21:16:35,088 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 345.0) internal successors, (1035), 3 states have internal predecessors, (1035), 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) [2023-11-06 21:16:35,090 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 2 states and 335 transitions. [2023-11-06 21:16:35,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 191 flow [2023-11-06 21:16:35,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:35,101 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-11-06 21:16:35,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-11-06 21:16:35,109 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -30 predicate places. [2023-11-06 21:16:35,109 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-11-06 21:16:35,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 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) [2023-11-06 21:16:35,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:35,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 21:16:35,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:16:35,111 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:35,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash 32438715, now seen corresponding path program 1 times [2023-11-06 21:16:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:35,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2820405] [2023-11-06 21:16:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:35,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:35,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2820405] [2023-11-06 21:16:35,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2820405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:35,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:35,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:16:35,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966487032] [2023-11-06 21:16:35,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:35,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:35,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:35,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:35,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:35,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 345 [2023-11-06 21:16:35,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2023-11-06 21:16:35,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:35,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 345 [2023-11-06 21:16:35,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:39,118 INFO L124 PetriNetUnfolderBase]: 14811/21847 cut-off events. [2023-11-06 21:16:39,118 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:39,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43469 conditions, 21847 events. 14811/21847 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 147805 event pairs, 9091 based on Foata normal form. 0/11757 useless extension candidates. Maximal degree in co-relation 43466. Up to 13032 conditions per place. [2023-11-06 21:16:39,262 INFO L140 encePairwiseOnDemand]: 326/345 looper letters, 52 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2023-11-06 21:16:39,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 256 flow [2023-11-06 21:16:39,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:39,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-06 21:16:39,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43091787439613527 [2023-11-06 21:16:39,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-06 21:16:39,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-06 21:16:39,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:39,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-06 21:16:39,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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) [2023-11-06 21:16:39,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:39,274 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:39,275 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 446 transitions. [2023-11-06 21:16:39,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 256 flow [2023-11-06 21:16:39,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:16:39,277 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 180 flow [2023-11-06 21:16:39,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-11-06 21:16:39,279 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -28 predicate places. [2023-11-06 21:16:39,279 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 180 flow [2023-11-06 21:16:39,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 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) [2023-11-06 21:16:39,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:39,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 21:16:39,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:16:39,281 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:39,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:39,282 INFO L85 PathProgramCache]: Analyzing trace with hash 32438716, now seen corresponding path program 1 times [2023-11-06 21:16:39,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:39,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455632096] [2023-11-06 21:16:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:39,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:39,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:39,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455632096] [2023-11-06 21:16:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455632096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:39,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:16:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354405611] [2023-11-06 21:16:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:39,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:39,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:39,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:39,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 345 [2023-11-06 21:16:39,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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) [2023-11-06 21:16:39,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:39,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 345 [2023-11-06 21:16:39,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:40,812 INFO L124 PetriNetUnfolderBase]: 4316/6765 cut-off events. [2023-11-06 21:16:40,812 INFO L125 PetriNetUnfolderBase]: For 2059/2059 co-relation queries the response was YES. [2023-11-06 21:16:40,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19195 conditions, 6765 events. 4316/6765 cut-off events. For 2059/2059 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 41760 event pairs, 3129 based on Foata normal form. 1935/7770 useless extension candidates. Maximal degree in co-relation 19190. Up to 6593 conditions per place. [2023-11-06 21:16:40,859 INFO L140 encePairwiseOnDemand]: 335/345 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-11-06 21:16:40,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 246 flow [2023-11-06 21:16:40,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:40,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-11-06 21:16:40,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41545893719806765 [2023-11-06 21:16:40,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-11-06 21:16:40,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-11-06 21:16:40,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:40,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-11-06 21:16:40,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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) [2023-11-06 21:16:40,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:40,868 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:40,869 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 180 flow. Second operand 3 states and 430 transitions. [2023-11-06 21:16:40,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 246 flow [2023-11-06 21:16:40,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:40,890 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 144 flow [2023-11-06 21:16:40,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-11-06 21:16:40,891 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -37 predicate places. [2023-11-06 21:16:40,891 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 144 flow [2023-11-06 21:16:40,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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) [2023-11-06 21:16:40,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:40,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:40,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:16:40,893 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:40,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:40,893 INFO L85 PathProgramCache]: Analyzing trace with hash -585857524, now seen corresponding path program 1 times [2023-11-06 21:16:40,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:40,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905265931] [2023-11-06 21:16:40,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:40,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:41,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:41,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905265931] [2023-11-06 21:16:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905265931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:16:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423353601] [2023-11-06 21:16:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:41,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:41,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-11-06 21:16:41,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-11-06 21:16:41,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:41,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-11-06 21:16:41,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:42,113 INFO L124 PetriNetUnfolderBase]: 4236/6701 cut-off events. [2023-11-06 21:16:42,114 INFO L125 PetriNetUnfolderBase]: For 827/827 co-relation queries the response was YES. [2023-11-06 21:16:42,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17552 conditions, 6701 events. 4236/6701 cut-off events. For 827/827 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 42103 event pairs, 1469 based on Foata normal form. 0/5063 useless extension candidates. Maximal degree in co-relation 17547. Up to 4987 conditions per place. [2023-11-06 21:16:42,147 INFO L140 encePairwiseOnDemand]: 341/345 looper letters, 63 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2023-11-06 21:16:42,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 67 transitions, 358 flow [2023-11-06 21:16:42,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-06 21:16:42,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4289855072463768 [2023-11-06 21:16:42,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-06 21:16:42,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-06 21:16:42,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:42,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-06 21:16:42,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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) [2023-11-06 21:16:42,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:42,161 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:42,162 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 144 flow. Second operand 3 states and 444 transitions. [2023-11-06 21:16:42,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 67 transitions, 358 flow [2023-11-06 21:16:42,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 67 transitions, 357 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:42,168 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 156 flow [2023-11-06 21:16:42,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2023-11-06 21:16:42,171 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -35 predicate places. [2023-11-06 21:16:42,171 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 156 flow [2023-11-06 21:16:42,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-11-06 21:16:42,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:42,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:42,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:16:42,173 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:42,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:42,173 INFO L85 PathProgramCache]: Analyzing trace with hash -585857301, now seen corresponding path program 1 times [2023-11-06 21:16:42,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:42,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731498399] [2023-11-06 21:16:42,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:42,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:42,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:42,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:42,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731498399] [2023-11-06 21:16:42,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731498399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:42,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:42,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:16:42,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882064641] [2023-11-06 21:16:42,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:42,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:42,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:42,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:42,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:42,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-11-06 21:16:42,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 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) [2023-11-06 21:16:42,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:42,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-11-06 21:16:42,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:43,739 INFO L124 PetriNetUnfolderBase]: 4196/6629 cut-off events. [2023-11-06 21:16:43,739 INFO L125 PetriNetUnfolderBase]: For 1239/1239 co-relation queries the response was YES. [2023-11-06 21:16:43,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18086 conditions, 6629 events. 4196/6629 cut-off events. For 1239/1239 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 41618 event pairs, 1477 based on Foata normal form. 0/5195 useless extension candidates. Maximal degree in co-relation 18080. Up to 4971 conditions per place. [2023-11-06 21:16:43,784 INFO L140 encePairwiseOnDemand]: 342/345 looper letters, 62 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-11-06 21:16:43,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 366 flow [2023-11-06 21:16:43,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:43,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:43,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-06 21:16:43,787 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4270531400966184 [2023-11-06 21:16:43,788 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-06 21:16:43,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-06 21:16:43,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:43,789 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-06 21:16:43,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 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) [2023-11-06 21:16:43,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:43,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:43,799 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 156 flow. Second operand 3 states and 442 transitions. [2023-11-06 21:16:43,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 366 flow [2023-11-06 21:16:43,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:43,806 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 161 flow [2023-11-06 21:16:43,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2023-11-06 21:16:43,809 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2023-11-06 21:16:43,810 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 161 flow [2023-11-06 21:16:43,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 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) [2023-11-06 21:16:43,810 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:43,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:43,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:16:43,811 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:43,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -981708244, now seen corresponding path program 1 times [2023-11-06 21:16:43,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:43,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333964023] [2023-11-06 21:16:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333964023] [2023-11-06 21:16:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333964023] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:16:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453889751] [2023-11-06 21:16:46,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:46,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:16:46,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:46,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:16:46,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:16:46,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 345 [2023-11-06 21:16:46,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 161 flow. Second operand has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 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) [2023-11-06 21:16:46,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:46,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 345 [2023-11-06 21:16:46,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:47,700 INFO L124 PetriNetUnfolderBase]: 4036/6389 cut-off events. [2023-11-06 21:16:47,700 INFO L125 PetriNetUnfolderBase]: For 1196/1196 co-relation queries the response was YES. [2023-11-06 21:16:47,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17749 conditions, 6389 events. 4036/6389 cut-off events. For 1196/1196 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 39807 event pairs, 1289 based on Foata normal form. 12/5100 useless extension candidates. Maximal degree in co-relation 17742. Up to 4914 conditions per place. [2023-11-06 21:16:47,740 INFO L140 encePairwiseOnDemand]: 335/345 looper letters, 97 selfloop transitions, 29 changer transitions 0/127 dead transitions. [2023-11-06 21:16:47,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 715 flow [2023-11-06 21:16:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:16:47,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 21:16:47,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1206 transitions. [2023-11-06 21:16:47,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34956521739130436 [2023-11-06 21:16:47,747 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1206 transitions. [2023-11-06 21:16:47,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1206 transitions. [2023-11-06 21:16:47,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:47,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1206 transitions. [2023-11-06 21:16:47,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 120.6) internal successors, (1206), 10 states have internal predecessors, (1206), 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) [2023-11-06 21:16:47,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 345.0) internal successors, (3795), 11 states have internal predecessors, (3795), 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) [2023-11-06 21:16:47,761 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 345.0) internal successors, (3795), 11 states have internal predecessors, (3795), 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) [2023-11-06 21:16:47,762 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 161 flow. Second operand 10 states and 1206 transitions. [2023-11-06 21:16:47,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 715 flow [2023-11-06 21:16:47,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:47,767 INFO L231 Difference]: Finished difference. Result has 61 places, 68 transitions, 366 flow [2023-11-06 21:16:47,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=366, PETRI_PLACES=61, PETRI_TRANSITIONS=68} [2023-11-06 21:16:47,768 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-06 21:16:47,768 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 68 transitions, 366 flow [2023-11-06 21:16:47,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.5) internal successors, (892), 8 states have internal predecessors, (892), 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) [2023-11-06 21:16:47,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:47,769 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:47,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:16:47,769 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:47,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:47,770 INFO L85 PathProgramCache]: Analyzing trace with hash -981708467, now seen corresponding path program 1 times [2023-11-06 21:16:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263113095] [2023-11-06 21:16:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263113095] [2023-11-06 21:16:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263113095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:16:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408854613] [2023-11-06 21:16:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:48,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:48,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:48,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:48,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 345 [2023-11-06 21:16:48,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 68 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2023-11-06 21:16:48,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:48,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 345 [2023-11-06 21:16:48,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:49,253 INFO L124 PetriNetUnfolderBase]: 3649/5790 cut-off events. [2023-11-06 21:16:49,254 INFO L125 PetriNetUnfolderBase]: For 2374/2374 co-relation queries the response was YES. [2023-11-06 21:16:49,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17672 conditions, 5790 events. 3649/5790 cut-off events. For 2374/2374 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 35211 event pairs, 1232 based on Foata normal form. 100/4958 useless extension candidates. Maximal degree in co-relation 17661. Up to 4131 conditions per place. [2023-11-06 21:16:49,292 INFO L140 encePairwiseOnDemand]: 341/345 looper letters, 78 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2023-11-06 21:16:49,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 87 transitions, 608 flow [2023-11-06 21:16:49,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:16:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:16:49,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 571 transitions. [2023-11-06 21:16:49,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.413768115942029 [2023-11-06 21:16:49,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 571 transitions. [2023-11-06 21:16:49,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 571 transitions. [2023-11-06 21:16:49,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:49,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 571 transitions. [2023-11-06 21:16:49,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 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) [2023-11-06 21:16:49,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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) [2023-11-06 21:16:49,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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) [2023-11-06 21:16:49,309 INFO L175 Difference]: Start difference. First operand has 61 places, 68 transitions, 366 flow. Second operand 4 states and 571 transitions. [2023-11-06 21:16:49,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 87 transitions, 608 flow [2023-11-06 21:16:49,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 87 transitions, 589 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:49,323 INFO L231 Difference]: Finished difference. Result has 59 places, 66 transitions, 351 flow [2023-11-06 21:16:49,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=351, PETRI_PLACES=59, PETRI_TRANSITIONS=66} [2023-11-06 21:16:49,325 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -25 predicate places. [2023-11-06 21:16:49,325 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 66 transitions, 351 flow [2023-11-06 21:16:49,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 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) [2023-11-06 21:16:49,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:49,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:49,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:16:49,328 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:49,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -981708468, now seen corresponding path program 1 times [2023-11-06 21:16:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048329991] [2023-11-06 21:16:49,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:49,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:49,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:49,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048329991] [2023-11-06 21:16:49,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048329991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:49,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:49,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:16:49,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575392555] [2023-11-06 21:16:49,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:49,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:49,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:49,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:49,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 345 [2023-11-06 21:16:49,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 66 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-11-06 21:16:49,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:49,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 345 [2023-11-06 21:16:49,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:50,657 INFO L124 PetriNetUnfolderBase]: 4072/6537 cut-off events. [2023-11-06 21:16:50,657 INFO L125 PetriNetUnfolderBase]: For 2745/2745 co-relation queries the response was YES. [2023-11-06 21:16:50,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19822 conditions, 6537 events. 4072/6537 cut-off events. For 2745/2745 co-relation queries the response was YES. Maximal size of possible extension queue 502. Compared 41235 event pairs, 1684 based on Foata normal form. 48/5560 useless extension candidates. Maximal degree in co-relation 19812. Up to 4655 conditions per place. [2023-11-06 21:16:50,697 INFO L140 encePairwiseOnDemand]: 339/345 looper letters, 68 selfloop transitions, 14 changer transitions 0/83 dead transitions. [2023-11-06 21:16:50,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 583 flow [2023-11-06 21:16:50,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-06 21:16:50,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41352657004830917 [2023-11-06 21:16:50,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-06 21:16:50,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-06 21:16:50,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:50,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-06 21:16:50,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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) [2023-11-06 21:16:50,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:50,707 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:50,707 INFO L175 Difference]: Start difference. First operand has 59 places, 66 transitions, 351 flow. Second operand 3 states and 428 transitions. [2023-11-06 21:16:50,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 583 flow [2023-11-06 21:16:50,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 566 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:50,720 INFO L231 Difference]: Finished difference. Result has 58 places, 71 transitions, 418 flow [2023-11-06 21:16:50,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=418, PETRI_PLACES=58, PETRI_TRANSITIONS=71} [2023-11-06 21:16:50,722 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -26 predicate places. [2023-11-06 21:16:50,722 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 71 transitions, 418 flow [2023-11-06 21:16:50,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 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) [2023-11-06 21:16:50,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:50,723 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:50,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:16:50,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:50,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:50,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1763983516, now seen corresponding path program 1 times [2023-11-06 21:16:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817684704] [2023-11-06 21:16:50,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:50,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:50,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817684704] [2023-11-06 21:16:50,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817684704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:50,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:50,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:16:50,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016801322] [2023-11-06 21:16:50,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:50,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:50,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:50,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:50,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 345 [2023-11-06 21:16:50,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 71 transitions, 418 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-11-06 21:16:50,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:50,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 345 [2023-11-06 21:16:50,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:51,520 INFO L124 PetriNetUnfolderBase]: 1314/2319 cut-off events. [2023-11-06 21:16:51,520 INFO L125 PetriNetUnfolderBase]: For 1629/1629 co-relation queries the response was YES. [2023-11-06 21:16:51,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7498 conditions, 2319 events. 1314/2319 cut-off events. For 1629/1629 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 13571 event pairs, 392 based on Foata normal form. 27/2000 useless extension candidates. Maximal degree in co-relation 7488. Up to 2133 conditions per place. [2023-11-06 21:16:51,532 INFO L140 encePairwiseOnDemand]: 340/345 looper letters, 79 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2023-11-06 21:16:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 626 flow [2023-11-06 21:16:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:51,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-11-06 21:16:51,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41352657004830917 [2023-11-06 21:16:51,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-11-06 21:16:51,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-11-06 21:16:51,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:51,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-11-06 21:16:51,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 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) [2023-11-06 21:16:51,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:51,540 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 345.0) internal successors, (1380), 4 states have internal predecessors, (1380), 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) [2023-11-06 21:16:51,540 INFO L175 Difference]: Start difference. First operand has 58 places, 71 transitions, 418 flow. Second operand 3 states and 428 transitions. [2023-11-06 21:16:51,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 626 flow [2023-11-06 21:16:51,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 84 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:51,553 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 386 flow [2023-11-06 21:16:51,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2023-11-06 21:16:51,554 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -24 predicate places. [2023-11-06 21:16:51,554 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 386 flow [2023-11-06 21:16:51,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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) [2023-11-06 21:16:51,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:51,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:16:51,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:51,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash 331172742, now seen corresponding path program 1 times [2023-11-06 21:16:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555170327] [2023-11-06 21:16:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:51,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:51,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:51,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555170327] [2023-11-06 21:16:51,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555170327] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:51,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:51,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913632090] [2023-11-06 21:16:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:51,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:51,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:51,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 345 [2023-11-06 21:16:51,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 386 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-11-06 21:16:51,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:51,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 345 [2023-11-06 21:16:51,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:52,088 INFO L124 PetriNetUnfolderBase]: 266/538 cut-off events. [2023-11-06 21:16:52,088 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-11-06 21:16:52,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 538 events. 266/538 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2208 event pairs, 84 based on Foata normal form. 27/524 useless extension candidates. Maximal degree in co-relation 1831. Up to 275 conditions per place. [2023-11-06 21:16:52,092 INFO L140 encePairwiseOnDemand]: 340/345 looper letters, 75 selfloop transitions, 7 changer transitions 0/83 dead transitions. [2023-11-06 21:16:52,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 589 flow [2023-11-06 21:16:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:16:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:16:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2023-11-06 21:16:52,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4108695652173913 [2023-11-06 21:16:52,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2023-11-06 21:16:52,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2023-11-06 21:16:52,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:52,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2023-11-06 21:16:52,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 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) [2023-11-06 21:16:52,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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) [2023-11-06 21:16:52,103 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 345.0) internal successors, (1725), 5 states have internal predecessors, (1725), 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) [2023-11-06 21:16:52,103 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 386 flow. Second operand 4 states and 567 transitions. [2023-11-06 21:16:52,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 589 flow [2023-11-06 21:16:52,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:52,108 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 328 flow [2023-11-06 21:16:52,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-06 21:16:52,109 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-06 21:16:52,110 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 328 flow [2023-11-06 21:16:52,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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) [2023-11-06 21:16:52,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:52,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:52,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:16:52,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:52,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1863280785, now seen corresponding path program 1 times [2023-11-06 21:16:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:52,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545317625] [2023-11-06 21:16:52,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:52,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:52,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545317625] [2023-11-06 21:16:52,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545317625] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:52,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:52,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:16:52,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572555318] [2023-11-06 21:16:52,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:52,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:52,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:52,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:52,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:52,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 345 [2023-11-06 21:16:52,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2023-11-06 21:16:52,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:52,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 345 [2023-11-06 21:16:52,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:52,734 INFO L124 PetriNetUnfolderBase]: 162/304 cut-off events. [2023-11-06 21:16:52,734 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2023-11-06 21:16:52,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1094 conditions, 304 events. 162/304 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1004 event pairs, 58 based on Foata normal form. 9/311 useless extension candidates. Maximal degree in co-relation 1082. Up to 134 conditions per place. [2023-11-06 21:16:52,737 INFO L140 encePairwiseOnDemand]: 340/345 looper letters, 49 selfloop transitions, 10 changer transitions 1/61 dead transitions. [2023-11-06 21:16:52,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 438 flow [2023-11-06 21:16:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:16:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:16:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-11-06 21:16:52,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3988405797101449 [2023-11-06 21:16:52,742 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-11-06 21:16:52,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-11-06 21:16:52,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:52,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-11-06 21:16:52,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 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) [2023-11-06 21:16:52,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 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) [2023-11-06 21:16:52,751 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 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) [2023-11-06 21:16:52,751 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 328 flow. Second operand 5 states and 688 transitions. [2023-11-06 21:16:52,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 438 flow [2023-11-06 21:16:52,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 61 transitions, 383 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-06 21:16:52,757 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 180 flow [2023-11-06 21:16:52,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2023-11-06 21:16:52,759 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -33 predicate places. [2023-11-06 21:16:52,759 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 180 flow [2023-11-06 21:16:52,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 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) [2023-11-06 21:16:52,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:52,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:52,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:16:52,761 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:52,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 210586574, now seen corresponding path program 1 times [2023-11-06 21:16:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548360370] [2023-11-06 21:16:52,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:52,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:53,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:53,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548360370] [2023-11-06 21:16:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548360370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:53,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:16:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601579192] [2023-11-06 21:16:53,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:53,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:53,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:53,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:53,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:53,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 345 [2023-11-06 21:16:53,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-11-06 21:16:53,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:53,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 345 [2023-11-06 21:16:53,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:53,666 INFO L124 PetriNetUnfolderBase]: 242/444 cut-off events. [2023-11-06 21:16:53,666 INFO L125 PetriNetUnfolderBase]: For 660/660 co-relation queries the response was YES. [2023-11-06 21:16:53,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 444 events. 242/444 cut-off events. For 660/660 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1754 event pairs, 14 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1560. Up to 265 conditions per place. [2023-11-06 21:16:53,669 INFO L140 encePairwiseOnDemand]: 341/345 looper letters, 77 selfloop transitions, 4 changer transitions 0/81 dead transitions. [2023-11-06 21:16:53,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 81 transitions, 595 flow [2023-11-06 21:16:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:16:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:16:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 688 transitions. [2023-11-06 21:16:53,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3988405797101449 [2023-11-06 21:16:53,674 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 688 transitions. [2023-11-06 21:16:53,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 688 transitions. [2023-11-06 21:16:53,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:53,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 688 transitions. [2023-11-06 21:16:53,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.6) internal successors, (688), 5 states have internal predecessors, (688), 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) [2023-11-06 21:16:53,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 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) [2023-11-06 21:16:53,683 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 345.0) internal successors, (2070), 6 states have internal predecessors, (2070), 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) [2023-11-06 21:16:53,683 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 180 flow. Second operand 5 states and 688 transitions. [2023-11-06 21:16:53,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 81 transitions, 595 flow [2023-11-06 21:16:53,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 533 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:53,688 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 193 flow [2023-11-06 21:16:53,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-11-06 21:16:53,690 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -30 predicate places. [2023-11-06 21:16:53,691 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 193 flow [2023-11-06 21:16:53,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 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) [2023-11-06 21:16:53,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:53,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:53,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:16:53,692 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:16:53,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:53,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1007093698, now seen corresponding path program 2 times [2023-11-06 21:16:53,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:53,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686011673] [2023-11-06 21:16:53,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:53,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:57,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686011673] [2023-11-06 21:16:57,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686011673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:57,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:57,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-06 21:16:57,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431650006] [2023-11-06 21:16:57,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:57,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:16:57,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:16:57,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:16:58,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 345 [2023-11-06 21:16:58,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 193 flow. Second operand has 13 states, 13 states have (on average 110.53846153846153) internal successors, (1437), 13 states have internal predecessors, (1437), 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) [2023-11-06 21:16:58,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:58,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 345 [2023-11-06 21:16:58,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:00,007 INFO L124 PetriNetUnfolderBase]: 282/571 cut-off events. [2023-11-06 21:17:00,008 INFO L125 PetriNetUnfolderBase]: For 691/697 co-relation queries the response was YES. [2023-11-06 21:17:00,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 571 events. 282/571 cut-off events. For 691/697 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2653 event pairs, 20 based on Foata normal form. 1/571 useless extension candidates. Maximal degree in co-relation 1976. Up to 256 conditions per place. [2023-11-06 21:17:00,011 INFO L140 encePairwiseOnDemand]: 337/345 looper letters, 76 selfloop transitions, 15 changer transitions 0/93 dead transitions. [2023-11-06 21:17:00,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 629 flow [2023-11-06 21:17:00,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:17:00,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-06 21:17:00,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1593 transitions. [2023-11-06 21:17:00,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3298136645962733 [2023-11-06 21:17:00,019 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1593 transitions. [2023-11-06 21:17:00,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1593 transitions. [2023-11-06 21:17:00,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:00,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1593 transitions. [2023-11-06 21:17:00,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 113.78571428571429) internal successors, (1593), 14 states have internal predecessors, (1593), 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) [2023-11-06 21:17:00,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 345.0) internal successors, (5175), 15 states have internal predecessors, (5175), 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) [2023-11-06 21:17:00,037 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 345.0) internal successors, (5175), 15 states have internal predecessors, (5175), 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) [2023-11-06 21:17:00,038 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 193 flow. Second operand 14 states and 1593 transitions. [2023-11-06 21:17:00,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 629 flow [2023-11-06 21:17:00,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 93 transitions, 624 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:17:00,044 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 246 flow [2023-11-06 21:17:00,044 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=345, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2023-11-06 21:17:00,045 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -16 predicate places. [2023-11-06 21:17:00,045 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 246 flow [2023-11-06 21:17:00,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.53846153846153) internal successors, (1437), 13 states have internal predecessors, (1437), 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) [2023-11-06 21:17:00,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:00,047 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:00,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:17:00,047 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:00,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:00,048 INFO L85 PathProgramCache]: Analyzing trace with hash -585888102, now seen corresponding path program 3 times [2023-11-06 21:17:00,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:17:00,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330208376] [2023-11-06 21:17:00,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:00,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:17:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:17:00,183 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:17:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:17:00,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:17:00,367 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:17:00,368 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-11-06 21:17:00,370 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-11-06 21:17:00,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-11-06 21:17:00,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-11-06 21:17:00,371 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-11-06 21:17:00,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-11-06 21:17:00,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-11-06 21:17:00,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-11-06 21:17:00,372 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-11-06 21:17:00,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-11-06 21:17:00,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-11-06 21:17:00,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-11-06 21:17:00,373 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-11-06 21:17:00,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-11-06 21:17:00,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-11-06 21:17:00,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-11-06 21:17:00,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-11-06 21:17:00,374 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-11-06 21:17:00,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-11-06 21:17:00,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-11-06 21:17:00,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-11-06 21:17:00,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-11-06 21:17:00,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-11-06 21:17:00,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-11-06 21:17:00,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-11-06 21:17:00,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-11-06 21:17:00,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-11-06 21:17:00,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-11-06 21:17:00,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-11-06 21:17:00,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-11-06 21:17:00,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-11-06 21:17:00,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-11-06 21:17:00,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-11-06 21:17:00,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-11-06 21:17:00,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-11-06 21:17:00,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-11-06 21:17:00,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-11-06 21:17:00,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-11-06 21:17:00,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-11-06 21:17:00,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-11-06 21:17:00,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-11-06 21:17:00,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-11-06 21:17:00,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-11-06 21:17:00,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-11-06 21:17:00,380 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-11-06 21:17:00,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-11-06 21:17:00,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-11-06 21:17:00,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-11-06 21:17:00,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-11-06 21:17:00,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-11-06 21:17:00,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-11-06 21:17:00,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-11-06 21:17:00,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-11-06 21:17:00,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-11-06 21:17:00,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-11-06 21:17:00,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-11-06 21:17:00,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-11-06 21:17:00,383 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-11-06 21:17:00,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-11-06 21:17:00,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-11-06 21:17:00,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-11-06 21:17:00,384 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-11-06 21:17:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-11-06 21:17:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-11-06 21:17:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-11-06 21:17:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-11-06 21:17:00,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-11-06 21:17:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-11-06 21:17:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-11-06 21:17:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-11-06 21:17:00,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-11-06 21:17:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-11-06 21:17:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-11-06 21:17:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-11-06 21:17:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-11-06 21:17:00,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-11-06 21:17:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-11-06 21:17:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-11-06 21:17:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-11-06 21:17:00,388 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-11-06 21:17:00,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-11-06 21:17:00,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-11-06 21:17:00,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-11-06 21:17:00,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-11-06 21:17:00,389 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-11-06 21:17:00,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:17:00,390 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:00,397 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:17:00,398 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:17:00,489 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:17:00 BasicIcfg [2023-11-06 21:17:00,489 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:17:00,489 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:17:00,490 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:17:00,490 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:17:00,490 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:16" (3/4) ... [2023-11-06 21:17:00,492 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:17:00,493 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:17:00,494 INFO L158 Benchmark]: Toolchain (without parser) took 46328.34ms. Allocated memory was 163.6MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 123.0MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-06 21:17:00,495 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 121.6MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:17:00,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 664.91ms. Allocated memory is still 163.6MB. Free memory was 122.6MB in the beginning and 98.2MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-06 21:17:00,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.46ms. Allocated memory is still 163.6MB. Free memory was 98.2MB in the beginning and 95.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:17:00,496 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 163.6MB. Free memory was 95.8MB in the beginning and 93.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:17:00,496 INFO L158 Benchmark]: RCFGBuilder took 1462.58ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 108.6MB in the end (delta: -15.3MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2023-11-06 21:17:00,497 INFO L158 Benchmark]: TraceAbstraction took 44085.83ms. Allocated memory was 163.6MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 107.5MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2023-11-06 21:17:00,497 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 6.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:17:00,499 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.26ms. Allocated memory is still 121.6MB. Free memory is still 76.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 664.91ms. Allocated memory is still 163.6MB. Free memory was 122.6MB in the beginning and 98.2MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.46ms. Allocated memory is still 163.6MB. Free memory was 98.2MB in the beginning and 95.8MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 163.6MB. Free memory was 95.8MB in the beginning and 93.3MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1462.58ms. Allocated memory is still 163.6MB. Free memory was 93.3MB in the beginning and 108.6MB in the end (delta: -15.3MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * TraceAbstraction took 44085.83ms. Allocated memory was 163.6MB in the beginning and 6.5GB in the end (delta: 6.3GB). Free memory was 107.5MB in the beginning and 4.2GB in the end (delta: -4.1GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 6.5GB. Free memory was 4.2GB in the beginning and 4.2GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8s, 186 PlacesBefore, 84 PlacesAfterwards, 179 TransitionsBefore, 76 TransitionsAfterwards, 7658 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 83 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 163 TotalNumberOfCompositions, 38601 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11437, independent: 10802, independent conditional: 0, independent unconditional: 10802, dependent: 635, dependent conditional: 0, dependent unconditional: 635, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3441, independent: 3358, independent conditional: 0, independent unconditional: 3358, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11437, independent: 7444, independent conditional: 0, independent unconditional: 7444, dependent: 552, dependent conditional: 0, dependent unconditional: 552, unknown: 3441, unknown conditional: 0, unknown unconditional: 3441] , Statistics on independence cache: Total cache size (in pairs): 555, Positive cache size: 508, Positive conditional cache size: 0, Positive unconditional cache size: 508, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461, ((void *)0), P0, ((void *)0))=-1, t2461={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462, ((void *)0), P1, ((void *)0))=0, t2461={7:0}, t2462={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t2463; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461={7:0}, t2462={8:0}, t2463={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463, ((void *)0), P2, ((void *)0))=1, t2461={7:0}, t2462={8:0}, t2463={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461={7:0}, t2462={8:0}, t2463={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 856]: 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 7 procedures, 239 locations, 85 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: 43.8s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1162 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 862 mSDsluCounter, 994 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 277 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2758 IncrementalHoareTripleChecker+Invalid, 3035 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 277 mSolverCounterUnsat, 61 mSDtfsCounter, 2758 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=418occurred in iteration=8, InterpolantAutomatonStates: 62, 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, 1.0s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 21:17:00,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:17:03,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:17:03,517 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 21:17:03,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:17:03,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:17:03,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:17:03,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:17:03,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:17:03,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:17:03,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:17:03,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:17:03,583 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:17:03,583 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:17:03,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:17:03,585 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:17:03,586 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:17:03,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:17:03,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:17:03,587 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:17:03,588 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:17:03,588 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:17:03,589 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:17:03,589 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:17:03,590 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:17:03,590 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:17:03,590 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:17:03,591 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:17:03,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:17:03,592 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:17:03,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:17:03,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:17:03,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:17:03,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:17:03,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:17:03,595 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:17:03,595 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:17:03,596 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:17:03,596 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:17:03,596 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:17:03,597 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:17:03,597 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:17:03,598 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> f2554c8e438e3af7ef33c0e1415937b85e1e4893b09cefba11e131adcc4208eb [2023-11-06 21:17:03,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:17:04,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:17:04,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:17:04,034 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:17:04,035 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:17:04,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2023-11-06 21:17:07,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:17:07,525 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:17:07,530 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/sv-benchmarks/c/pthread-wmm/safe028_rmo.i [2023-11-06 21:17:07,560 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/c25d26c7c/a8522e8e095a4022859222b071d91675/FLAG8ae1890e0 [2023-11-06 21:17:07,578 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/data/c25d26c7c/a8522e8e095a4022859222b071d91675 [2023-11-06 21:17:07,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:17:07,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:17:07,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:17:07,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:17:07,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:17:07,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:17:07" (1/1) ... [2023-11-06 21:17:07,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48911c87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:07, skipping insertion in model container [2023-11-06 21:17:07,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:17:07" (1/1) ... [2023-11-06 21:17:07,672 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:17:08,143 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:17:08,170 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:17:08,304 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:17:08,369 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:17:08,370 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:17:08,377 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:17:08,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08 WrapperNode [2023-11-06 21:17:08,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:17:08,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:17:08,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:17:08,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:17:08,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,477 INFO L138 Inliner]: procedures = 180, calls = 76, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-06 21:17:08,477 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:17:08,478 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:17:08,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:17:08,479 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:17:08,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,493 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,511 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,520 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,526 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:17:08,527 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:17:08,527 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:17:08,527 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:17:08,528 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (1/1) ... [2023-11-06 21:17:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:17:08,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:17:08,572 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:17:08,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:17:08,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:17:08,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:17:08,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:17:08,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:17:08,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:17:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:17:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:17:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:17:08,632 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:17:08,632 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:17:08,633 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:17:08,633 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:17:08,635 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:17:08,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:17:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:17:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:17:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:17:08,638 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:17:08,827 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:17:08,829 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:17:09,621 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:17:10,204 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:17:10,205 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:17:10,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:17:10 BoogieIcfgContainer [2023-11-06 21:17:10,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:17:10,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:17:10,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:17:10,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:17:10,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:17:07" (1/3) ... [2023-11-06 21:17:10,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15108bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:17:10, skipping insertion in model container [2023-11-06 21:17:10,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:17:08" (2/3) ... [2023-11-06 21:17:10,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15108bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:17:10, skipping insertion in model container [2023-11-06 21:17:10,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:17:10" (3/3) ... [2023-11-06 21:17:10,222 INFO L112 eAbstractionObserver]: Analyzing ICFG safe028_rmo.i [2023-11-06 21:17:10,242 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:17:10,242 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2023-11-06 21:17:10,243 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:17:10,443 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:17:10,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 183 transitions, 378 flow [2023-11-06 21:17:10,638 INFO L124 PetriNetUnfolderBase]: 3/180 cut-off events. [2023-11-06 21:17:10,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:17:10,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 3/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 283 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-11-06 21:17:10,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 183 transitions, 378 flow [2023-11-06 21:17:10,660 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 180 transitions, 369 flow [2023-11-06 21:17:10,664 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:17:10,689 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 180 transitions, 369 flow [2023-11-06 21:17:10,694 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 180 transitions, 369 flow [2023-11-06 21:17:10,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 180 transitions, 369 flow [2023-11-06 21:17:10,787 INFO L124 PetriNetUnfolderBase]: 3/180 cut-off events. [2023-11-06 21:17:10,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:17:10,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 180 events. 3/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 278 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-11-06 21:17:10,797 INFO L119 LiptonReduction]: Number of co-enabled transitions 7658 [2023-11-06 21:17:32,097 INFO L134 LiptonReduction]: Checked pairs total: 43423 [2023-11-06 21:17:32,097 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-11-06 21:17:32,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:17:32,121 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@55cce320, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:17:32,121 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2023-11-06 21:17:32,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:17:32,123 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:17:32,123 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:17:32,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:32,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:17:32,125 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:32,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1060, now seen corresponding path program 1 times [2023-11-06 21:17:32,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:32,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591251003] [2023-11-06 21:17:32,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:32,145 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:32,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:32,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:32,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 21:17:32,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:32,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:17:32,258 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:32,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:32,263 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:32,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:32,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591251003] [2023-11-06 21:17:32,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591251003] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:32,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:32,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:17:32,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173937605] [2023-11-06 21:17:32,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:32,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:17:32,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:32,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:17:32,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:17:32,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 344 [2023-11-06 21:17:32,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 161 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 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) [2023-11-06 21:17:32,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:32,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 344 [2023-11-06 21:17:32,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:38,069 INFO L124 PetriNetUnfolderBase]: 23428/32687 cut-off events. [2023-11-06 21:17:38,070 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-11-06 21:17:38,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65453 conditions, 32687 events. 23428/32687 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 215958 event pairs, 23428 based on Foata normal form. 0/13853 useless extension candidates. Maximal degree in co-relation 65442. Up to 32628 conditions per place. [2023-11-06 21:17:38,376 INFO L140 encePairwiseOnDemand]: 316/344 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2023-11-06 21:17:38,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 191 flow [2023-11-06 21:17:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:17:38,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:17:38,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-11-06 21:17:38,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4898255813953488 [2023-11-06 21:17:38,402 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-11-06 21:17:38,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-11-06 21:17:38,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:38,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-11-06 21:17:38,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 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) [2023-11-06 21:17:38,421 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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) [2023-11-06 21:17:38,422 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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) [2023-11-06 21:17:38,424 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 161 flow. Second operand 2 states and 337 transitions. [2023-11-06 21:17:38,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 191 flow [2023-11-06 21:17:38,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:17:38,435 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2023-11-06 21:17:38,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-11-06 21:17:38,442 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -30 predicate places. [2023-11-06 21:17:38,442 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2023-11-06 21:17:38,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 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) [2023-11-06 21:17:38,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:38,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 21:17:38,465 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:38,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:38,665 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:38,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:38,666 INFO L85 PathProgramCache]: Analyzing trace with hash 32410941, now seen corresponding path program 1 times [2023-11-06 21:17:38,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:38,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538757964] [2023-11-06 21:17:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:38,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:38,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:38,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:38,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 21:17:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:38,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:17:38,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:38,922 INFO L322 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-06 21:17:38,924 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-06 21:17:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:38,980 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:38,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:38,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538757964] [2023-11-06 21:17:38,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538757964] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:38,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:38,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:17:38,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478031739] [2023-11-06 21:17:38,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:38,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:17:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:17:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:17:39,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 344 [2023-11-06 21:17:39,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-11-06 21:17:39,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:39,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 344 [2023-11-06 21:17:39,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:41,873 INFO L124 PetriNetUnfolderBase]: 11451/16212 cut-off events. [2023-11-06 21:17:41,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:17:41,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32474 conditions, 16212 events. 11451/16212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 98544 event pairs, 6971 based on Foata normal form. 0/8272 useless extension candidates. Maximal degree in co-relation 32471. Up to 8366 conditions per place. [2023-11-06 21:17:41,997 INFO L140 encePairwiseOnDemand]: 333/344 looper letters, 57 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-06 21:17:41,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 60 transitions, 244 flow [2023-11-06 21:17:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:17:41,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:17:42,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-11-06 21:17:42,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.437984496124031 [2023-11-06 21:17:42,001 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-11-06 21:17:42,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-11-06 21:17:42,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:42,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-11-06 21:17:42,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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) [2023-11-06 21:17:42,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:42,009 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:42,009 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 452 transitions. [2023-11-06 21:17:42,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 60 transitions, 244 flow [2023-11-06 21:17:42,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:17:42,012 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 114 flow [2023-11-06 21:17:42,012 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-06 21:17:42,013 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2023-11-06 21:17:42,014 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 114 flow [2023-11-06 21:17:42,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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) [2023-11-06 21:17:42,014 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:42,015 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 21:17:42,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:42,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:42,232 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:42,232 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash 32410942, now seen corresponding path program 1 times [2023-11-06 21:17:42,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165762207] [2023-11-06 21:17:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:42,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:42,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:42,236 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:42,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 21:17:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:42,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:17:42,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:42,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:17:42,375 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:17:42,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:42,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:42,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:42,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165762207] [2023-11-06 21:17:42,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165762207] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:42,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:42,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:17:42,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726818464] [2023-11-06 21:17:42,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:42,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:17:42,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:42,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:17:42,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:17:42,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 344 [2023-11-06 21:17:42,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:42,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:42,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 344 [2023-11-06 21:17:42,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:43,396 INFO L124 PetriNetUnfolderBase]: 3309/4814 cut-off events. [2023-11-06 21:17:43,396 INFO L125 PetriNetUnfolderBase]: For 499/499 co-relation queries the response was YES. [2023-11-06 21:17:43,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10824 conditions, 4814 events. 3309/4814 cut-off events. For 499/499 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 24843 event pairs, 3309 based on Foata normal form. 0/4081 useless extension candidates. Maximal degree in co-relation 10819. Up to 4798 conditions per place. [2023-11-06 21:17:43,430 INFO L140 encePairwiseOnDemand]: 334/344 looper letters, 33 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-11-06 21:17:43,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 164 flow [2023-11-06 21:17:43,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:17:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:17:43,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2023-11-06 21:17:43,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42248062015503873 [2023-11-06 21:17:43,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2023-11-06 21:17:43,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2023-11-06 21:17:43,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:43,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2023-11-06 21:17:43,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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) [2023-11-06 21:17:43,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:43,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:43,440 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 114 flow. Second operand 3 states and 436 transitions. [2023-11-06 21:17:43,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 164 flow [2023-11-06 21:17:43,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:17:43,445 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 94 flow [2023-11-06 21:17:43,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-11-06 21:17:43,446 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -38 predicate places. [2023-11-06 21:17:43,446 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 94 flow [2023-11-06 21:17:43,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:17:43,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:43,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:43,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:43,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:43,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:43,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:43,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2107014091, now seen corresponding path program 1 times [2023-11-06 21:17:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:43,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058635922] [2023-11-06 21:17:43,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:43,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:43,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:43,662 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:43,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 21:17:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:43,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:17:43,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:43,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:43,839 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:43,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:43,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058635922] [2023-11-06 21:17:43,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058635922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:43,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:43,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:17:43,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154192761] [2023-11-06 21:17:43,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:43,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:17:43,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:43,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:17:43,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:17:43,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 344 [2023-11-06 21:17:43,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2023-11-06 21:17:43,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:43,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 344 [2023-11-06 21:17:43,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:44,315 INFO L124 PetriNetUnfolderBase]: 1212/1972 cut-off events. [2023-11-06 21:17:44,316 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-06 21:17:44,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1972 events. 1212/1972 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10038 event pairs, 461 based on Foata normal form. 27/1698 useless extension candidates. Maximal degree in co-relation 4331. Up to 1830 conditions per place. [2023-11-06 21:17:44,327 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 45 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2023-11-06 21:17:44,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 226 flow [2023-11-06 21:17:44,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:17:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:17:44,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2023-11-06 21:17:44,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42054263565891475 [2023-11-06 21:17:44,334 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2023-11-06 21:17:44,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2023-11-06 21:17:44,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:44,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2023-11-06 21:17:44,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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) [2023-11-06 21:17:44,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:44,346 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-11-06 21:17:44,346 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 94 flow. Second operand 3 states and 434 transitions. [2023-11-06 21:17:44,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 226 flow [2023-11-06 21:17:44,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:17:44,348 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 119 flow [2023-11-06 21:17:44,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 21:17:44,349 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -36 predicate places. [2023-11-06 21:17:44,349 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 119 flow [2023-11-06 21:17:44,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 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) [2023-11-06 21:17:44,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:44,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:44,368 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:44,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:44,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:44,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:44,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2065310356, now seen corresponding path program 1 times [2023-11-06 21:17:44,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:44,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144972156] [2023-11-06 21:17:44,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:44,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:44,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:44,567 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:44,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 21:17:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:44,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:17:44,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:44,762 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:44,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:44,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144972156] [2023-11-06 21:17:44,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144972156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:44,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:17:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054093047] [2023-11-06 21:17:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:44,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:17:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:17:44,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:17:44,775 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 344 [2023-11-06 21:17:44,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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) [2023-11-06 21:17:44,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:44,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 344 [2023-11-06 21:17:44,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:45,108 INFO L124 PetriNetUnfolderBase]: 273/535 cut-off events. [2023-11-06 21:17:45,108 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-06 21:17:45,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 535 events. 273/535 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2149 event pairs, 101 based on Foata normal form. 27/506 useless extension candidates. Maximal degree in co-relation 1306. Up to 276 conditions per place. [2023-11-06 21:17:45,112 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2023-11-06 21:17:45,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 301 flow [2023-11-06 21:17:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:17:45,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:17:45,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2023-11-06 21:17:45,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171511627906977 [2023-11-06 21:17:45,116 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2023-11-06 21:17:45,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2023-11-06 21:17:45,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:45,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2023-11-06 21:17:45,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 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) [2023-11-06 21:17:45,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-11-06 21:17:45,124 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-11-06 21:17:45,124 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 119 flow. Second operand 4 states and 574 transitions. [2023-11-06 21:17:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 301 flow [2023-11-06 21:17:45,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:17:45,127 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 155 flow [2023-11-06 21:17:45,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 21:17:45,128 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -33 predicate places. [2023-11-06 21:17:45,129 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 155 flow [2023-11-06 21:17:45,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 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) [2023-11-06 21:17:45,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:45,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:45,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:45,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:45,342 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:45,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:45,343 INFO L85 PathProgramCache]: Analyzing trace with hash -169240395, now seen corresponding path program 1 times [2023-11-06 21:17:45,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:45,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779677772] [2023-11-06 21:17:45,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:45,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:45,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:45,345 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:45,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 21:17:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:45,518 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:17:45,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:45,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:45,574 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:45,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:45,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779677772] [2023-11-06 21:17:45,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779677772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:45,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:45,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:17:45,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112895465] [2023-11-06 21:17:45,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:45,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:17:45,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:45,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:17:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:17:45,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 344 [2023-11-06 21:17:45,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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) [2023-11-06 21:17:45,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:45,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 344 [2023-11-06 21:17:45,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:45,982 INFO L124 PetriNetUnfolderBase]: 162/306 cut-off events. [2023-11-06 21:17:45,982 INFO L125 PetriNetUnfolderBase]: For 225/225 co-relation queries the response was YES. [2023-11-06 21:17:45,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 162/306 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1010 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 825. Up to 134 conditions per place. [2023-11-06 21:17:45,984 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2023-11-06 21:17:45,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 283 flow [2023-11-06 21:17:45,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:17:45,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:17:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2023-11-06 21:17:45,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40406976744186046 [2023-11-06 21:17:45,989 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2023-11-06 21:17:45,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2023-11-06 21:17:45,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:45,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2023-11-06 21:17:45,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 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) [2023-11-06 21:17:45,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:45,998 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:45,999 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 155 flow. Second operand 5 states and 695 transitions. [2023-11-06 21:17:45,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 283 flow [2023-11-06 21:17:46,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 21:17:46,003 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-11-06 21:17:46,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 21:17:46,004 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -38 predicate places. [2023-11-06 21:17:46,004 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-11-06 21:17:46,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 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) [2023-11-06 21:17:46,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:46,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:46,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-06 21:17:46,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:46,224 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:46,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:46,224 INFO L85 PathProgramCache]: Analyzing trace with hash 115369479, now seen corresponding path program 1 times [2023-11-06 21:17:46,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:46,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664431837] [2023-11-06 21:17:46,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:46,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:46,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:46,226 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:46,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 21:17:46,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:46,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 21:17:46,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:46,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:17:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:46,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:46,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:46,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664431837] [2023-11-06 21:17:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664431837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:17:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94536572] [2023-11-06 21:17:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:46,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:17:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:46,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:17:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:17:46,773 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 344 [2023-11-06 21:17:46,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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) [2023-11-06 21:17:46,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:46,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 344 [2023-11-06 21:17:46,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:47,209 INFO L124 PetriNetUnfolderBase]: 242/448 cut-off events. [2023-11-06 21:17:47,209 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2023-11-06 21:17:47,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1287 conditions, 448 events. 242/448 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1777 event pairs, 21 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1280. Up to 267 conditions per place. [2023-11-06 21:17:47,212 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 73 selfloop transitions, 4 changer transitions 0/77 dead transitions. [2023-11-06 21:17:47,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 77 transitions, 487 flow [2023-11-06 21:17:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:17:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:17:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2023-11-06 21:17:47,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3992248062015504 [2023-11-06 21:17:47,217 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 824 transitions. [2023-11-06 21:17:47,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 824 transitions. [2023-11-06 21:17:47,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:47,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 824 transitions. [2023-11-06 21:17:47,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.33333333333334) internal successors, (824), 6 states have internal predecessors, (824), 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) [2023-11-06 21:17:47,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 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) [2023-11-06 21:17:47,225 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 344.0) internal successors, (2408), 7 states have internal predecessors, (2408), 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) [2023-11-06 21:17:47,226 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 6 states and 824 transitions. [2023-11-06 21:17:47,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 77 transitions, 487 flow [2023-11-06 21:17:47,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 425 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 21:17:47,231 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 134 flow [2023-11-06 21:17:47,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-11-06 21:17:47,232 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -34 predicate places. [2023-11-06 21:17:47,232 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 134 flow [2023-11-06 21:17:47,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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) [2023-11-06 21:17:47,233 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:47,233 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:47,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:47,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:47,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:47,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:47,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1483011315, now seen corresponding path program 2 times [2023-11-06 21:17:47,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:47,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482107678] [2023-11-06 21:17:47,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:17:47,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:47,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:47,437 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:47,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 21:17:47,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:17:47,701 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:47,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-06 21:17:47,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:48,660 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 71 [2023-11-06 21:17:49,321 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:17:49,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 31 [2023-11-06 21:17:50,178 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-06 21:17:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:50,289 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:50,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:50,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482107678] [2023-11-06 21:17:50,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482107678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:50,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:50,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:17:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020042630] [2023-11-06 21:17:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:50,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:17:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:17:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:17:52,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 344 [2023-11-06 21:17:52,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 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) [2023-11-06 21:17:52,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:52,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 344 [2023-11-06 21:17:52,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:53,081 INFO L124 PetriNetUnfolderBase]: 292/582 cut-off events. [2023-11-06 21:17:53,081 INFO L125 PetriNetUnfolderBase]: For 471/471 co-relation queries the response was YES. [2023-11-06 21:17:53,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 582 events. 292/582 cut-off events. For 471/471 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2728 event pairs, 122 based on Foata normal form. 1/579 useless extension candidates. Maximal degree in co-relation 1678. Up to 343 conditions per place. [2023-11-06 21:17:53,085 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 59 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2023-11-06 21:17:53,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 69 transitions, 411 flow [2023-11-06 21:17:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:17:53,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:17:53,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-11-06 21:17:53,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37383720930232556 [2023-11-06 21:17:53,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-11-06 21:17:53,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-11-06 21:17:53,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:53,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-11-06 21:17:53,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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) [2023-11-06 21:17:53,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:53,101 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:53,101 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 134 flow. Second operand 5 states and 643 transitions. [2023-11-06 21:17:53,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 69 transitions, 411 flow [2023-11-06 21:17:53,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:17:53,108 INFO L231 Difference]: Finished difference. Result has 54 places, 40 transitions, 181 flow [2023-11-06 21:17:53,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=54, PETRI_TRANSITIONS=40} [2023-11-06 21:17:53,112 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -30 predicate places. [2023-11-06 21:17:53,112 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 40 transitions, 181 flow [2023-11-06 21:17:53,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 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) [2023-11-06 21:17:53,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:53,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:53,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:53,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:53,329 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:53,329 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash 622803651, now seen corresponding path program 1 times [2023-11-06 21:17:53,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:53,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048737362] [2023-11-06 21:17:53,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:53,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:53,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:53,332 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:53,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 21:17:53,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:53,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:17:53,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:53,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:53,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:53,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048737362] [2023-11-06 21:17:53,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048737362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:53,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:53,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:17:53,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85501428] [2023-11-06 21:17:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:53,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:17:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:53,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:17:53,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:17:54,004 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 344 [2023-11-06 21:17:54,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 40 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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) [2023-11-06 21:17:54,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:54,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 344 [2023-11-06 21:17:54,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:54,308 INFO L124 PetriNetUnfolderBase]: 292/580 cut-off events. [2023-11-06 21:17:54,309 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2023-11-06 21:17:54,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 580 events. 292/580 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2636 event pairs, 169 based on Foata normal form. 0/577 useless extension candidates. Maximal degree in co-relation 1858. Up to 388 conditions per place. [2023-11-06 21:17:54,314 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 38 selfloop transitions, 6 changer transitions 0/46 dead transitions. [2023-11-06 21:17:54,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 297 flow [2023-11-06 21:17:54,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:17:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:17:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-11-06 21:17:54,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38488372093023254 [2023-11-06 21:17:54,319 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-11-06 21:17:54,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-11-06 21:17:54,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:54,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-11-06 21:17:54,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 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) [2023-11-06 21:17:54,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:54,327 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 344.0) internal successors, (2064), 6 states have internal predecessors, (2064), 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) [2023-11-06 21:17:54,327 INFO L175 Difference]: Start difference. First operand has 54 places, 40 transitions, 181 flow. Second operand 5 states and 662 transitions. [2023-11-06 21:17:54,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 297 flow [2023-11-06 21:17:54,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:17:54,335 INFO L231 Difference]: Finished difference. Result has 56 places, 39 transitions, 186 flow [2023-11-06 21:17:54,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=56, PETRI_TRANSITIONS=39} [2023-11-06 21:17:54,338 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -28 predicate places. [2023-11-06 21:17:54,338 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 39 transitions, 186 flow [2023-11-06 21:17:54,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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) [2023-11-06 21:17:54,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:54,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:54,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:54,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:54,552 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:54,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2003141978, now seen corresponding path program 1 times [2023-11-06 21:17:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113691774] [2023-11-06 21:17:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:17:54,554 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:54,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:54,555 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:54,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 21:17:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:17:54,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:17:54,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:55,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:55,138 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:55,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:55,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113691774] [2023-11-06 21:17:55,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113691774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:55,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:55,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:17:55,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544200285] [2023-11-06 21:17:55,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:55,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:17:55,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:55,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:17:55,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:17:55,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 344 [2023-11-06 21:17:55,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 39 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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) [2023-11-06 21:17:55,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:55,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 344 [2023-11-06 21:17:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:55,593 INFO L124 PetriNetUnfolderBase]: 292/578 cut-off events. [2023-11-06 21:17:55,594 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2023-11-06 21:17:55,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1884 conditions, 578 events. 292/578 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2623 event pairs, 169 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 1872. Up to 395 conditions per place. [2023-11-06 21:17:55,597 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 40 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-11-06 21:17:55,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 45 transitions, 300 flow [2023-11-06 21:17:55,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:17:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:17:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2023-11-06 21:17:55,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39752906976744184 [2023-11-06 21:17:55,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2023-11-06 21:17:55,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2023-11-06 21:17:55,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:55,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2023-11-06 21:17:55,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 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) [2023-11-06 21:17:55,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-11-06 21:17:55,608 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-11-06 21:17:55,609 INFO L175 Difference]: Start difference. First operand has 56 places, 39 transitions, 186 flow. Second operand 4 states and 547 transitions. [2023-11-06 21:17:55,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 45 transitions, 300 flow [2023-11-06 21:17:55,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 291 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:17:55,615 INFO L231 Difference]: Finished difference. Result has 55 places, 38 transitions, 177 flow [2023-11-06 21:17:55,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=55, PETRI_TRANSITIONS=38} [2023-11-06 21:17:55,616 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -29 predicate places. [2023-11-06 21:17:55,616 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 38 transitions, 177 flow [2023-11-06 21:17:55,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 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) [2023-11-06 21:17:55,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:55,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:55,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-06 21:17:55,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:55,829 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:55,829 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:55,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1124082843, now seen corresponding path program 3 times [2023-11-06 21:17:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:55,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071845407] [2023-11-06 21:17:55,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:17:55,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:55,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:55,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:55,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 21:17:56,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 21:17:56,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:17:56,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 21:17:56,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:17:56,552 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-06 21:17:56,681 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 21:17:56,797 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 21:17:56,934 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-06 21:17:57,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:17:57,168 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:17:57,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:17:57,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071845407] [2023-11-06 21:17:57,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071845407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:17:57,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:17:57,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:17:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134145459] [2023-11-06 21:17:57,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:17:57,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:17:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:17:57,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:17:57,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:17:58,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 344 [2023-11-06 21:17:58,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 38 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 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) [2023-11-06 21:17:58,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:17:58,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 344 [2023-11-06 21:17:58,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:17:59,702 INFO L124 PetriNetUnfolderBase]: 324/652 cut-off events. [2023-11-06 21:17:59,702 INFO L125 PetriNetUnfolderBase]: For 721/721 co-relation queries the response was YES. [2023-11-06 21:17:59,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2120 conditions, 652 events. 324/652 cut-off events. For 721/721 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3206 event pairs, 118 based on Foata normal form. 1/653 useless extension candidates. Maximal degree in co-relation 2108. Up to 239 conditions per place. [2023-11-06 21:17:59,706 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 63 selfloop transitions, 9 changer transitions 0/74 dead transitions. [2023-11-06 21:17:59,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 74 transitions, 490 flow [2023-11-06 21:17:59,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:17:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:17:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-11-06 21:17:59,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3633720930232558 [2023-11-06 21:17:59,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-11-06 21:17:59,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-11-06 21:17:59,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:17:59,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-11-06 21:17:59,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2023-11-06 21:17:59,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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) [2023-11-06 21:17:59,722 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 344.0) internal successors, (2752), 8 states have internal predecessors, (2752), 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) [2023-11-06 21:17:59,722 INFO L175 Difference]: Start difference. First operand has 55 places, 38 transitions, 177 flow. Second operand 7 states and 875 transitions. [2023-11-06 21:17:59,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 74 transitions, 490 flow [2023-11-06 21:17:59,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 74 transitions, 486 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:17:59,728 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 218 flow [2023-11-06 21:17:59,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2023-11-06 21:17:59,730 INFO L281 CegarLoopForPetriNet]: 84 programPoint places, -23 predicate places. [2023-11-06 21:17:59,730 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 218 flow [2023-11-06 21:17:59,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 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) [2023-11-06 21:17:59,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:17:59,731 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:17:59,744 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:17:59,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:59,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2023-11-06 21:17:59,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:17:59,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1409250865, now seen corresponding path program 4 times [2023-11-06 21:17:59,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:17:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078384638] [2023-11-06 21:17:59,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:17:59,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:17:59,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:17:59,949 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:17:59,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 21:18:00,208 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:18:00,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 21:18:00,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:18:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:18:00,458 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 21:18:00,458 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:18:00,459 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2023-11-06 21:18:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2023-11-06 21:18:00,462 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2023-11-06 21:18:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2023-11-06 21:18:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2023-11-06 21:18:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2023-11-06 21:18:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2023-11-06 21:18:00,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2023-11-06 21:18:00,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2023-11-06 21:18:00,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2023-11-06 21:18:00,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2023-11-06 21:18:00,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2023-11-06 21:18:00,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2023-11-06 21:18:00,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2023-11-06 21:18:00,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2023-11-06 21:18:00,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2023-11-06 21:18:00,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2023-11-06 21:18:00,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2023-11-06 21:18:00,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2023-11-06 21:18:00,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2023-11-06 21:18:00,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2023-11-06 21:18:00,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2023-11-06 21:18:00,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2023-11-06 21:18:00,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2023-11-06 21:18:00,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2023-11-06 21:18:00,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2023-11-06 21:18:00,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2023-11-06 21:18:00,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2023-11-06 21:18:00,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2023-11-06 21:18:00,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2023-11-06 21:18:00,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2023-11-06 21:18:00,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2023-11-06 21:18:00,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2023-11-06 21:18:00,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2023-11-06 21:18:00,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2023-11-06 21:18:00,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2023-11-06 21:18:00,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2023-11-06 21:18:00,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2023-11-06 21:18:00,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2023-11-06 21:18:00,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2023-11-06 21:18:00,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2023-11-06 21:18:00,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2023-11-06 21:18:00,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2023-11-06 21:18:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2023-11-06 21:18:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2023-11-06 21:18:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2023-11-06 21:18:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2023-11-06 21:18:00,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2023-11-06 21:18:00,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2023-11-06 21:18:00,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2023-11-06 21:18:00,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2023-11-06 21:18:00,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2023-11-06 21:18:00,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2023-11-06 21:18:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2023-11-06 21:18:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2023-11-06 21:18:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2023-11-06 21:18:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2023-11-06 21:18:00,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2023-11-06 21:18:00,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2023-11-06 21:18:00,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2023-11-06 21:18:00,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2023-11-06 21:18:00,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2023-11-06 21:18:00,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2023-11-06 21:18:00,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2023-11-06 21:18:00,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2023-11-06 21:18:00,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2023-11-06 21:18:00,479 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2023-11-06 21:18:00,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2023-11-06 21:18:00,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2023-11-06 21:18:00,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2023-11-06 21:18:00,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2023-11-06 21:18:00,480 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2023-11-06 21:18:00,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2023-11-06 21:18:00,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2023-11-06 21:18:00,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2023-11-06 21:18:00,481 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2023-11-06 21:18:00,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2023-11-06 21:18:00,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2023-11-06 21:18:00,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2023-11-06 21:18:00,482 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2023-11-06 21:18:00,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2023-11-06 21:18:00,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2023-11-06 21:18:00,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2023-11-06 21:18:00,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2023-11-06 21:18:00,483 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2023-11-06 21:18:00,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:18:00,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:18:00,697 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:18:00,704 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:18:00,704 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:18:00,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:18:00 BasicIcfg [2023-11-06 21:18:00,823 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:18:00,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:18:00,824 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:18:00,824 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:18:00,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:17:10" (3/4) ... [2023-11-06 21:18:00,827 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:18:00,828 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:18:00,829 INFO L158 Benchmark]: Toolchain (without parser) took 53243.78ms. Allocated memory was 86.0MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 60.1MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 21:18:00,829 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 86.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:18:00,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 790.66ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 60.1MB in the beginning and 100.7MB in the end (delta: -40.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2023-11-06 21:18:00,830 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.17ms. Allocated memory is still 130.0MB. Free memory was 100.7MB in the beginning and 98.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:18:00,830 INFO L158 Benchmark]: Boogie Preprocessor took 47.84ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 95.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:18:00,831 INFO L158 Benchmark]: RCFGBuilder took 1682.00ms. Allocated memory is still 130.0MB. Free memory was 95.6MB in the beginning and 58.2MB in the end (delta: 37.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. [2023-11-06 21:18:00,831 INFO L158 Benchmark]: TraceAbstraction took 50611.42ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 57.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2023-11-06 21:18:00,831 INFO L158 Benchmark]: Witness Printer took 4.63ms. Allocated memory is still 3.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:18:00,834 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.24ms. Allocated memory is still 86.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 790.66ms. Allocated memory was 86.0MB in the beginning and 130.0MB in the end (delta: 44.0MB). Free memory was 60.1MB in the beginning and 100.7MB in the end (delta: -40.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.17ms. Allocated memory is still 130.0MB. Free memory was 100.7MB in the beginning and 98.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.84ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 95.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1682.00ms. Allocated memory is still 130.0MB. Free memory was 95.6MB in the beginning and 58.2MB in the end (delta: 37.4MB). Peak memory consumption was 44.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50611.42ms. Allocated memory was 130.0MB in the beginning and 3.4GB in the end (delta: 3.3GB). Free memory was 57.2MB in the beginning and 1.5GB in the end (delta: -1.5GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 4.63ms. Allocated memory is still 3.4GB. Free memory is still 1.5GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.4s, 187 PlacesBefore, 84 PlacesAfterwards, 180 TransitionsBefore, 76 TransitionsAfterwards, 7658 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 161 TotalNumberOfCompositions, 43423 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12540, independent: 11808, independent conditional: 0, independent unconditional: 11808, dependent: 732, dependent conditional: 0, dependent unconditional: 732, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3476, independent: 3393, independent conditional: 0, independent unconditional: 3393, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12540, independent: 8415, independent conditional: 0, independent unconditional: 8415, dependent: 649, dependent conditional: 0, dependent unconditional: 649, unknown: 3476, unknown conditional: 0, unknown unconditional: 3476] , Statistics on independence cache: Total cache size (in pairs): 551, Positive cache size: 504, Positive conditional cache size: 0, Positive unconditional cache size: 504, Negative cache size: 47, Negative conditional cache size: 0, Negative unconditional cache size: 47, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L851] 0 pthread_t t2461; [L852] FCALL, FORK 0 pthread_create(&t2461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2461, ((void *)0), P0, ((void *)0))=0, t2461={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L853] 0 pthread_t t2462; [L854] FCALL, FORK 0 pthread_create(&t2462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2462, ((void *)0), P1, ((void *)0))=1, t2461={-2147483642:0}, t2462={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] 0 pthread_t t2463; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2461={-2147483642:0}, t2462={15:0}, t2463={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] FCALL, FORK 0 pthread_create(&t2463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2463, ((void *)0), P2, ((void *)0))=2, t2461={-2147483642:0}, t2462={15:0}, t2463={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L808] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 3 x$flush_delayed = weak$$choice2 [L811] EXPR 3 \read(x) [L811] 3 x$mem_tmp = x [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] EXPR 3 \read(x) [L812] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L812] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L814] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L815] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L816] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L818] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L819] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L820] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L821] EXPR 3 \read(x) [L821] 3 __unbuffered_p2_EAX = x [L822] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L822] 3 x = x$flush_delayed ? x$mem_tmp : x [L823] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L826] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 \read(x) [L829] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L831] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L832] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L833] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L761] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 x$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(x) [L769] 1 x$mem_tmp = x [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] EXPR 1 \read(x) [L770] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L770] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L771] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L772] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L773] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L774] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L776] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L786] 1 return 0; [L791] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 \read(x) [L794] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L794] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L796] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L797] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L798] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L836] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 3 return 0; [L858] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L860] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L860] RET 0 assume_abort_if_not(main$tmp_guard0) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 \read(x) [L862] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L864] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L865] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L866] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2461={-2147483642:0}, t2462={15:0}, t2463={6:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L869] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L870] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L870] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe028_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 854]: 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: 852]: 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: 856]: 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 7 procedures, 240 locations, 85 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: 50.2s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 21.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 577 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2244 IncrementalHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 76 mSDtfsCounter, 2244 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 156 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=11, InterpolantAutomatonStates: 47, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 1879 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1635 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 21:18:00,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_13357567-3af1-42a2-8505-a75c22d61488/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample