./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.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_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:20,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:20,581 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:47:20,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:20,587 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:20,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:20,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:20,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:20,617 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:20,617 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:20,618 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:20,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:20,619 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:20,620 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:20,620 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:20,621 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:20,621 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:20,622 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:20,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:20,623 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:20,623 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:20,624 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:20,624 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:20,625 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:20,625 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:20,625 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:20,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:20,626 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:20,627 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:20,627 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:20,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:20,628 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:20,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:47:20,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:47:20,650 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:20,650 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:20,650 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:20,651 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:20,651 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_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2023-11-06 22:47:20,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:21,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:21,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:21,030 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:21,031 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:21,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-06 22:47:24,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:24,573 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:24,573 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-06 22:47:24,597 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/31249cf6a/297b749b5d47482b85ec7479a996aff7/FLAG31b46c87c [2023-11-06 22:47:24,618 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/31249cf6a/297b749b5d47482b85ec7479a996aff7 [2023-11-06 22:47:24,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:24,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:24,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:24,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:24,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:24,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:24" (1/1) ... [2023-11-06 22:47:24,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4102220a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:24, skipping insertion in model container [2023-11-06 22:47:24,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:24" (1/1) ... [2023-11-06 22:47:24,699 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:24,895 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:47:25,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:25,131 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:25,164 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:47:25,200 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:25,246 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:25,247 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:25,247 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:25,254 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:25,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25 WrapperNode [2023-11-06 22:47:25,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:25,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:25,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:25,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:25,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,302 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,328 INFO L138 Inliner]: procedures = 174, calls = 52, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 121 [2023-11-06 22:47:25,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:25,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:25,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:25,333 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:25,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,367 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:25,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:25,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:25,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:25,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (1/1) ... [2023-11-06 22:47:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:25,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:25,445 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:25,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:47:25,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:47:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-06 22:47:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-06 22:47:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:47:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:25,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:25,497 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-06 22:47:25,497 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-06 22:47:25,499 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 22:47:25,679 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:25,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:25,956 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:26,029 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:26,034 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:26,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:26 BoogieIcfgContainer [2023-11-06 22:47:26,038 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:26,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:26,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:26,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:26,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:24" (1/3) ... [2023-11-06 22:47:26,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79946eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:26, skipping insertion in model container [2023-11-06 22:47:26,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:25" (2/3) ... [2023-11-06 22:47:26,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79946eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:26, skipping insertion in model container [2023-11-06 22:47:26,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:26" (3/3) ... [2023-11-06 22:47:26,060 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-11-06 22:47:26,082 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:26,083 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-06 22:47:26,083 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:26,225 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:47:26,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 140 transitions, 308 flow [2023-11-06 22:47:26,437 INFO L124 PetriNetUnfolderBase]: 4/136 cut-off events. [2023-11-06 22:47:26,438 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:47:26,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 136 events. 4/136 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:26,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 140 transitions, 308 flow [2023-11-06 22:47:26,452 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 131 transitions, 286 flow [2023-11-06 22:47:26,456 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:26,467 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 131 transitions, 286 flow [2023-11-06 22:47:26,470 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 131 transitions, 286 flow [2023-11-06 22:47:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 131 transitions, 286 flow [2023-11-06 22:47:26,507 INFO L124 PetriNetUnfolderBase]: 4/131 cut-off events. [2023-11-06 22:47:26,507 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:47:26,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 131 events. 4/131 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 209 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:26,514 INFO L119 LiptonReduction]: Number of co-enabled transitions 4296 [2023-11-06 22:47:31,452 INFO L134 LiptonReduction]: Checked pairs total: 15517 [2023-11-06 22:47:31,452 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-06 22:47:31,482 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:47:31,491 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;@6520d987, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:47:31,491 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-06 22:47:31,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:47:31,494 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:47:31,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:47:31,494 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:31,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:47:31,496 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:31,501 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:31,502 INFO L85 PathProgramCache]: Analyzing trace with hash 494, now seen corresponding path program 1 times [2023-11-06 22:47:31,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468191409] [2023-11-06 22:47:31,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:31,661 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 22:47:31,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:31,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468191409] [2023-11-06 22:47:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468191409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:47:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482372086] [2023-11-06 22:47:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:31,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:31,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:31,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:31,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 265 [2023-11-06 22:47:31,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 144 flow. Second operand has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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 22:47:31,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:31,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 265 [2023-11-06 22:47:31,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:32,831 INFO L124 PetriNetUnfolderBase]: 5062/7356 cut-off events. [2023-11-06 22:47:32,831 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-06 22:47:32,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14733 conditions, 7356 events. 5062/7356 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 47138 event pairs, 5062 based on Foata normal form. 893/5862 useless extension candidates. Maximal degree in co-relation 11263. Up to 7110 conditions per place. [2023-11-06 22:47:32,927 INFO L140 encePairwiseOnDemand]: 260/265 looper letters, 45 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-11-06 22:47:32,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 224 flow [2023-11-06 22:47:32,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:32,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:47:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-11-06 22:47:32,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5622641509433962 [2023-11-06 22:47:32,951 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-11-06 22:47:32,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-11-06 22:47:32,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:32,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-11-06 22:47:32,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 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 22:47:32,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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 22:47:32,969 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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 22:47:32,972 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 144 flow. Second operand 2 states and 298 transitions. [2023-11-06 22:47:32,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 224 flow [2023-11-06 22:47:32,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 22:47:32,985 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-11-06 22:47:32,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-11-06 22:47:32,992 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2023-11-06 22:47:32,992 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-11-06 22:47:32,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 124.5) internal successors, (249), 2 states have internal predecessors, (249), 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 22:47:32,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:32,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:47:32,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:47:32,994 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:32,999 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:33,000 INFO L85 PathProgramCache]: Analyzing trace with hash 484450, now seen corresponding path program 1 times [2023-11-06 22:47:33,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:33,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014953306] [2023-11-06 22:47:33,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:33,428 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 22:47:33,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:33,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014953306] [2023-11-06 22:47:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014953306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:33,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:33,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893747980] [2023-11-06 22:47:33,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:33,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:33,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:33,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-11-06 22:47:33,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 22:47:33,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:33,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-11-06 22:47:33,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:34,313 INFO L124 PetriNetUnfolderBase]: 4816/7001 cut-off events. [2023-11-06 22:47:34,313 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:34,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13823 conditions, 7001 events. 4816/7001 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 44505 event pairs, 4816 based on Foata normal form. 0/4803 useless extension candidates. Maximal degree in co-relation 13820. Up to 6754 conditions per place. [2023-11-06 22:47:34,378 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 41 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-06 22:47:34,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 200 flow [2023-11-06 22:47:34,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-11-06 22:47:34,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47924528301886793 [2023-11-06 22:47:34,383 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-11-06 22:47:34,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-11-06 22:47:34,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:34,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-11-06 22:47:34,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 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 22:47:34,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:34,395 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:34,396 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 381 transitions. [2023-11-06 22:47:34,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 200 flow [2023-11-06 22:47:34,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:34,399 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-11-06 22:47:34,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-11-06 22:47:34,401 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -9 predicate places. [2023-11-06 22:47:34,402 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-11-06 22:47:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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 22:47:34,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:34,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:47:34,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:47:34,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:34,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:34,411 INFO L85 PathProgramCache]: Analyzing trace with hash 484448, now seen corresponding path program 1 times [2023-11-06 22:47:34,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:34,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136898313] [2023-11-06 22:47:34,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:34,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:34,661 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 22:47:34,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136898313] [2023-11-06 22:47:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136898313] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:34,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:34,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:34,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839223773] [2023-11-06 22:47:34,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:34,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:34,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:34,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:34,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 265 [2023-11-06 22:47:34,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 22:47:34,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:34,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 265 [2023-11-06 22:47:34,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:35,497 INFO L124 PetriNetUnfolderBase]: 4570/6646 cut-off events. [2023-11-06 22:47:35,497 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:35,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13117 conditions, 6646 events. 4570/6646 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 41993 event pairs, 4570 based on Foata normal form. 0/4637 useless extension candidates. Maximal degree in co-relation 13113. Up to 6400 conditions per place. [2023-11-06 22:47:35,540 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-06 22:47:35,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 196 flow [2023-11-06 22:47:35,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-06 22:47:35,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48050314465408805 [2023-11-06 22:47:35,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-06 22:47:35,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-06 22:47:35,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:35,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-06 22:47:35,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 22:47:35,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:35,548 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:35,548 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 382 transitions. [2023-11-06 22:47:35,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 196 flow [2023-11-06 22:47:35,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:35,551 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-11-06 22:47:35,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-11-06 22:47:35,552 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -11 predicate places. [2023-11-06 22:47:35,552 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-11-06 22:47:35,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 22:47:35,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:35,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:47:35,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:47:35,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:35,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:35,554 INFO L85 PathProgramCache]: Analyzing trace with hash 465566282, now seen corresponding path program 1 times [2023-11-06 22:47:35,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:35,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118065878] [2023-11-06 22:47:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:35,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,642 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 22:47:35,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118065878] [2023-11-06 22:47:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118065878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523860253] [2023-11-06 22:47:35,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:35,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:35,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:35,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:35,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-11-06 22:47:35,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 22:47:35,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:35,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-11-06 22:47:35,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:36,476 INFO L124 PetriNetUnfolderBase]: 4516/6544 cut-off events. [2023-11-06 22:47:36,476 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:36,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12925 conditions, 6544 events. 4516/6544 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 41140 event pairs, 4516 based on Foata normal form. 0/4580 useless extension candidates. Maximal degree in co-relation 12921. Up to 6310 conditions per place. [2023-11-06 22:47:36,518 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-06 22:47:36,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2023-11-06 22:47:36,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:36,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-11-06 22:47:36,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742138364779874 [2023-11-06 22:47:36,521 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-11-06 22:47:36,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-11-06 22:47:36,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:36,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-11-06 22:47:36,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 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 22:47:36,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:36,527 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:36,528 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 377 transitions. [2023-11-06 22:47:36,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2023-11-06 22:47:36,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:36,530 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-11-06 22:47:36,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:47:36,532 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -13 predicate places. [2023-11-06 22:47:36,532 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-11-06 22:47:36,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 22:47:36,533 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:36,533 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:47:36,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:47:36,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:36,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:36,534 INFO L85 PathProgramCache]: Analyzing trace with hash 465566284, now seen corresponding path program 1 times [2023-11-06 22:47:36,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:36,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130910971] [2023-11-06 22:47:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:36,643 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 22:47:36,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:36,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130910971] [2023-11-06 22:47:36,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130910971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:36,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:36,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:36,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597848218] [2023-11-06 22:47:36,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:36,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:36,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:36,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:36,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:36,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 265 [2023-11-06 22:47:36,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 22:47:36,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:36,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 265 [2023-11-06 22:47:36,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:37,564 INFO L124 PetriNetUnfolderBase]: 4462/6442 cut-off events. [2023-11-06 22:47:37,564 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:37,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12733 conditions, 6442 events. 4462/6442 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 40374 event pairs, 4462 based on Foata normal form. 0/4523 useless extension candidates. Maximal degree in co-relation 12729. Up to 6220 conditions per place. [2023-11-06 22:47:37,606 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-06 22:47:37,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2023-11-06 22:47:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-06 22:47:37,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49433962264150944 [2023-11-06 22:47:37,609 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-06 22:47:37,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-06 22:47:37,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:37,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-06 22:47:37,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 22:47:37,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:37,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:37,615 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 393 transitions. [2023-11-06 22:47:37,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2023-11-06 22:47:37,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:37,619 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-11-06 22:47:37,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-11-06 22:47:37,622 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -15 predicate places. [2023-11-06 22:47:37,623 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-11-06 22:47:37,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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 22:47:37,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:37,624 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:37,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:47:37,624 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:37,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:37,625 INFO L85 PathProgramCache]: Analyzing trace with hash 732609913, now seen corresponding path program 1 times [2023-11-06 22:47:37,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:37,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193358958] [2023-11-06 22:47:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:37,688 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 22:47:37,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:37,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193358958] [2023-11-06 22:47:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193358958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:37,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:37,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:37,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288292896] [2023-11-06 22:47:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:37,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:37,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:37,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:37,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 265 [2023-11-06 22:47:37,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 22:47:37,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:37,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 265 [2023-11-06 22:47:37,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:38,445 INFO L124 PetriNetUnfolderBase]: 4360/6288 cut-off events. [2023-11-06 22:47:38,446 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:38,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12425 conditions, 6288 events. 4360/6288 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 457. Compared 39181 event pairs, 4360 based on Foata normal form. 0/4453 useless extension candidates. Maximal degree in co-relation 12421. Up to 6066 conditions per place. [2023-11-06 22:47:38,486 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 22:47:38,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2023-11-06 22:47:38,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:38,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:38,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-11-06 22:47:38,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4691823899371069 [2023-11-06 22:47:38,489 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-11-06 22:47:38,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-11-06 22:47:38,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:38,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-11-06 22:47:38,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 22:47:38,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:38,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:38,495 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 373 transitions. [2023-11-06 22:47:38,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2023-11-06 22:47:38,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:38,498 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-11-06 22:47:38,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-11-06 22:47:38,502 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -17 predicate places. [2023-11-06 22:47:38,502 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-11-06 22:47:38,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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 22:47:38,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:38,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:38,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:47:38,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:38,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash 732609914, now seen corresponding path program 1 times [2023-11-06 22:47:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247501910] [2023-11-06 22:47:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:38,596 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 22:47:38,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:38,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247501910] [2023-11-06 22:47:38,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247501910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:38,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:38,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:38,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801759962] [2023-11-06 22:47:38,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:38,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:38,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:38,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:38,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:38,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 265 [2023-11-06 22:47:38,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 22:47:38,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:38,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 265 [2023-11-06 22:47:38,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:39,355 INFO L124 PetriNetUnfolderBase]: 4258/6134 cut-off events. [2023-11-06 22:47:39,356 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:39,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12117 conditions, 6134 events. 4258/6134 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 38163 event pairs, 4258 based on Foata normal form. 0/4383 useless extension candidates. Maximal degree in co-relation 12113. Up to 5912 conditions per place. [2023-11-06 22:47:39,403 INFO L140 encePairwiseOnDemand]: 261/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-06 22:47:39,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2023-11-06 22:47:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-11-06 22:47:39,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48930817610062893 [2023-11-06 22:47:39,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-11-06 22:47:39,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-11-06 22:47:39,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:39,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-11-06 22:47:39,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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 22:47:39,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:39,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:39,414 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 389 transitions. [2023-11-06 22:47:39,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2023-11-06 22:47:39,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:39,418 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-11-06 22:47:39,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-11-06 22:47:39,419 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -19 predicate places. [2023-11-06 22:47:39,419 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-11-06 22:47:39,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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 22:47:39,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:39,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:39,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:47:39,420 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:39,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:39,421 INFO L85 PathProgramCache]: Analyzing trace with hash -336497412, now seen corresponding path program 1 times [2023-11-06 22:47:39,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:39,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567476404] [2023-11-06 22:47:39,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:39,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:39,490 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 22:47:39,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:39,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567476404] [2023-11-06 22:47:39,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567476404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:39,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:39,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:47:39,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315619340] [2023-11-06 22:47:39,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:39,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:39,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:39,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:39,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 265 [2023-11-06 22:47:39,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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 22:47:39,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:39,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 265 [2023-11-06 22:47:39,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:39,988 INFO L124 PetriNetUnfolderBase]: 3316/4877 cut-off events. [2023-11-06 22:47:39,988 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:39,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9603 conditions, 4877 events. 3316/4877 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 30314 event pairs, 3316 based on Foata normal form. 0/3684 useless extension candidates. Maximal degree in co-relation 9599. Up to 4655 conditions per place. [2023-11-06 22:47:40,017 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-06 22:47:40,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 160 flow [2023-11-06 22:47:40,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:40,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-11-06 22:47:40,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4679245283018868 [2023-11-06 22:47:40,020 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-11-06 22:47:40,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-11-06 22:47:40,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:40,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-11-06 22:47:40,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 22:47:40,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:40,025 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:40,025 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 372 transitions. [2023-11-06 22:47:40,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 160 flow [2023-11-06 22:47:40,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:40,027 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 96 flow [2023-11-06 22:47:40,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-06 22:47:40,028 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -20 predicate places. [2023-11-06 22:47:40,028 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 96 flow [2023-11-06 22:47:40,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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 22:47:40,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:40,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:40,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:47:40,029 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:40,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash -336497413, now seen corresponding path program 1 times [2023-11-06 22:47:40,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:40,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15510559] [2023-11-06 22:47:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:40,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:40,187 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 22:47:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:40,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15510559] [2023-11-06 22:47:40,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15510559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:40,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:40,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:40,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598309580] [2023-11-06 22:47:40,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:40,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:47:40,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:40,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:47:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:47:40,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 265 [2023-11-06 22:47:40,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 22:47:40,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:40,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 265 [2023-11-06 22:47:40,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:40,689 INFO L124 PetriNetUnfolderBase]: 2374/3620 cut-off events. [2023-11-06 22:47:40,689 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-06 22:47:40,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7089 conditions, 3620 events. 2374/3620 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 22296 event pairs, 2374 based on Foata normal form. 0/2985 useless extension candidates. Maximal degree in co-relation 7085. Up to 3398 conditions per place. [2023-11-06 22:47:40,713 INFO L140 encePairwiseOnDemand]: 262/265 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-06 22:47:40,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2023-11-06 22:47:40,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:40,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:40,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 332 transitions. [2023-11-06 22:47:40,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4176100628930818 [2023-11-06 22:47:40,728 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 332 transitions. [2023-11-06 22:47:40,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 332 transitions. [2023-11-06 22:47:40,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:40,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 332 transitions. [2023-11-06 22:47:40,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 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 22:47:40,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:40,733 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:40,734 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 96 flow. Second operand 3 states and 332 transitions. [2023-11-06 22:47:40,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2023-11-06 22:47:40,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:40,739 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2023-11-06 22:47:40,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-06 22:47:40,741 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -21 predicate places. [2023-11-06 22:47:40,741 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2023-11-06 22:47:40,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 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 22:47:40,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:40,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:40,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:47:40,742 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:40,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -372375101, now seen corresponding path program 1 times [2023-11-06 22:47:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:40,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960684039] [2023-11-06 22:47:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:40,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:40,836 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 22:47:40,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:40,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960684039] [2023-11-06 22:47:40,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960684039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:40,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:40,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:40,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237982593] [2023-11-06 22:47:40,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:40,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:40,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:40,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:40,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:40,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 265 [2023-11-06 22:47:40,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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 22:47:40,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:40,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 265 [2023-11-06 22:47:40,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:42,907 INFO L124 PetriNetUnfolderBase]: 18529/26644 cut-off events. [2023-11-06 22:47:42,907 INFO L125 PetriNetUnfolderBase]: For 711/711 co-relation queries the response was YES. [2023-11-06 22:47:42,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52757 conditions, 26644 events. 18529/26644 cut-off events. For 711/711 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 170019 event pairs, 2939 based on Foata normal form. 0/24224 useless extension candidates. Maximal degree in co-relation 52753. Up to 11003 conditions per place. [2023-11-06 22:47:43,026 INFO L140 encePairwiseOnDemand]: 255/265 looper letters, 161 selfloop transitions, 27 changer transitions 4/195 dead transitions. [2023-11-06 22:47:43,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 195 transitions, 815 flow [2023-11-06 22:47:43,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:47:43,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:47:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1220 transitions. [2023-11-06 22:47:43,031 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5115303983228512 [2023-11-06 22:47:43,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1220 transitions. [2023-11-06 22:47:43,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1220 transitions. [2023-11-06 22:47:43,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:43,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1220 transitions. [2023-11-06 22:47:43,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.55555555555554) internal successors, (1220), 9 states have internal predecessors, (1220), 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 22:47:43,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:43,044 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:43,044 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 9 states and 1220 transitions. [2023-11-06 22:47:43,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 195 transitions, 815 flow [2023-11-06 22:47:43,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 195 transitions, 807 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:43,049 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 264 flow [2023-11-06 22:47:43,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=264, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2023-11-06 22:47:43,050 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -10 predicate places. [2023-11-06 22:47:43,051 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 264 flow [2023-11-06 22:47:43,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 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 22:47:43,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:43,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:43,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:47:43,052 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:43,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1202521096, now seen corresponding path program 1 times [2023-11-06 22:47:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:43,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266272811] [2023-11-06 22:47:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:43,117 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 22:47:43,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:43,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266272811] [2023-11-06 22:47:43,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266272811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:43,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:43,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:43,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464453996] [2023-11-06 22:47:43,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:43,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:47:43,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:43,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:47:43,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:47:43,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 265 [2023-11-06 22:47:43,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 22:47:43,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:43,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 265 [2023-11-06 22:47:43,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:43,999 INFO L124 PetriNetUnfolderBase]: 7691/12368 cut-off events. [2023-11-06 22:47:43,999 INFO L125 PetriNetUnfolderBase]: For 5272/5899 co-relation queries the response was YES. [2023-11-06 22:47:44,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28789 conditions, 12368 events. 7691/12368 cut-off events. For 5272/5899 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 93440 event pairs, 2370 based on Foata normal form. 1390/11962 useless extension candidates. Maximal degree in co-relation 28781. Up to 5597 conditions per place. [2023-11-06 22:47:44,077 INFO L140 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2023-11-06 22:47:44,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 434 flow [2023-11-06 22:47:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:47:44,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:47:44,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions. [2023-11-06 22:47:44,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5245283018867924 [2023-11-06 22:47:44,080 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions. [2023-11-06 22:47:44,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions. [2023-11-06 22:47:44,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:44,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions. [2023-11-06 22:47:44,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 22:47:44,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:44,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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 22:47:44,085 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 264 flow. Second operand 3 states and 417 transitions. [2023-11-06 22:47:44,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 434 flow [2023-11-06 22:47:44,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 89 transitions, 434 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:44,134 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 280 flow [2023-11-06 22:47:44,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-11-06 22:47:44,135 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -7 predicate places. [2023-11-06 22:47:44,135 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 280 flow [2023-11-06 22:47:44,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 22:47:44,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:44,136 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:44,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:47:44,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:44,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:44,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1548928418, now seen corresponding path program 2 times [2023-11-06 22:47:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:44,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070633870] [2023-11-06 22:47:44,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:44,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:44,183 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 22:47:44,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:44,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070633870] [2023-11-06 22:47:44,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070633870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:44,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:47:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558132837] [2023-11-06 22:47:44,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:44,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:44,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:44,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:44,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 265 [2023-11-06 22:47:44,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 22:47:44,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:44,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 265 [2023-11-06 22:47:44,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:44,698 INFO L124 PetriNetUnfolderBase]: 2245/4591 cut-off events. [2023-11-06 22:47:44,699 INFO L125 PetriNetUnfolderBase]: For 4536/4700 co-relation queries the response was YES. [2023-11-06 22:47:44,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 4591 events. 2245/4591 cut-off events. For 4536/4700 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 37583 event pairs, 597 based on Foata normal form. 587/4539 useless extension candidates. Maximal degree in co-relation 11296. Up to 1471 conditions per place. [2023-11-06 22:47:44,726 INFO L140 encePairwiseOnDemand]: 258/265 looper letters, 72 selfloop transitions, 9 changer transitions 2/117 dead transitions. [2023-11-06 22:47:44,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 597 flow [2023-11-06 22:47:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:44,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:47:44,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-06 22:47:44,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5330188679245284 [2023-11-06 22:47:44,729 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-06 22:47:44,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-06 22:47:44,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:44,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-06 22:47:44,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 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 22:47:44,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 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 22:47:44,735 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 265.0) internal successors, (1325), 5 states have internal predecessors, (1325), 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 22:47:44,735 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 280 flow. Second operand 4 states and 565 transitions. [2023-11-06 22:47:44,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 597 flow [2023-11-06 22:47:44,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 581 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:47:44,751 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 342 flow [2023-11-06 22:47:44,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=342, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2023-11-06 22:47:44,752 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2023-11-06 22:47:44,752 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 342 flow [2023-11-06 22:47:44,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 22:47:44,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:44,753 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:44,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:47:44,753 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:44,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash -40942318, now seen corresponding path program 1 times [2023-11-06 22:47:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36404989] [2023-11-06 22:47:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:44,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:44,816 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 22:47:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36404989] [2023-11-06 22:47:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36404989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:44,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:44,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587801642] [2023-11-06 22:47:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:44,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:44,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:44,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:44,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 265 [2023-11-06 22:47:44,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 342 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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 22:47:44,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:44,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 265 [2023-11-06 22:47:44,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:45,659 INFO L124 PetriNetUnfolderBase]: 3522/6562 cut-off events. [2023-11-06 22:47:45,659 INFO L125 PetriNetUnfolderBase]: For 7436/7634 co-relation queries the response was YES. [2023-11-06 22:47:45,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18692 conditions, 6562 events. 3522/6562 cut-off events. For 7436/7634 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 48340 event pairs, 733 based on Foata normal form. 420/6790 useless extension candidates. Maximal degree in co-relation 18680. Up to 3002 conditions per place. [2023-11-06 22:47:45,762 INFO L140 encePairwiseOnDemand]: 254/265 looper letters, 177 selfloop transitions, 47 changer transitions 4/236 dead transitions. [2023-11-06 22:47:45,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 236 transitions, 1499 flow [2023-11-06 22:47:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:47:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:47:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1197 transitions. [2023-11-06 22:47:45,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5018867924528302 [2023-11-06 22:47:45,774 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1197 transitions. [2023-11-06 22:47:45,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1197 transitions. [2023-11-06 22:47:45,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:45,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1197 transitions. [2023-11-06 22:47:45,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.0) internal successors, (1197), 9 states have internal predecessors, (1197), 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 22:47:45,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:45,790 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:45,790 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 342 flow. Second operand 9 states and 1197 transitions. [2023-11-06 22:47:45,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 236 transitions, 1499 flow [2023-11-06 22:47:45,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 236 transitions, 1499 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:45,823 INFO L231 Difference]: Finished difference. Result has 81 places, 112 transitions, 709 flow [2023-11-06 22:47:45,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=709, PETRI_PLACES=81, PETRI_TRANSITIONS=112} [2023-11-06 22:47:45,824 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 11 predicate places. [2023-11-06 22:47:45,825 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 112 transitions, 709 flow [2023-11-06 22:47:45,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 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 22:47:45,825 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:45,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:45,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:47:45,826 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:45,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:45,827 INFO L85 PathProgramCache]: Analyzing trace with hash -187266380, now seen corresponding path program 1 times [2023-11-06 22:47:45,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:45,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694153959] [2023-11-06 22:47:45,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:45,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:45,907 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 22:47:45,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:45,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694153959] [2023-11-06 22:47:45,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694153959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:45,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:45,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:45,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746463597] [2023-11-06 22:47:45,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:45,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:45,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:45,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 265 [2023-11-06 22:47:45,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 112 transitions, 709 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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 22:47:45,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:45,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 265 [2023-11-06 22:47:45,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:47,032 INFO L124 PetriNetUnfolderBase]: 3132/6032 cut-off events. [2023-11-06 22:47:47,032 INFO L125 PetriNetUnfolderBase]: For 9812/9858 co-relation queries the response was YES. [2023-11-06 22:47:47,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20127 conditions, 6032 events. 3132/6032 cut-off events. For 9812/9858 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 44746 event pairs, 470 based on Foata normal form. 92/6097 useless extension candidates. Maximal degree in co-relation 20108. Up to 2386 conditions per place. [2023-11-06 22:47:47,071 INFO L140 encePairwiseOnDemand]: 255/265 looper letters, 171 selfloop transitions, 66 changer transitions 0/245 dead transitions. [2023-11-06 22:47:47,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 245 transitions, 1764 flow [2023-11-06 22:47:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:47:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:47:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1198 transitions. [2023-11-06 22:47:47,077 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023060796645702 [2023-11-06 22:47:47,077 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1198 transitions. [2023-11-06 22:47:47,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1198 transitions. [2023-11-06 22:47:47,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:47,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1198 transitions. [2023-11-06 22:47:47,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 133.11111111111111) internal successors, (1198), 9 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:47:47,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:47,091 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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 22:47:47,091 INFO L175 Difference]: Start difference. First operand has 81 places, 112 transitions, 709 flow. Second operand 9 states and 1198 transitions. [2023-11-06 22:47:47,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 245 transitions, 1764 flow [2023-11-06 22:47:47,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 245 transitions, 1762 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:47,137 INFO L231 Difference]: Finished difference. Result has 90 places, 130 transitions, 1014 flow [2023-11-06 22:47:47,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1014, PETRI_PLACES=90, PETRI_TRANSITIONS=130} [2023-11-06 22:47:47,138 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 20 predicate places. [2023-11-06 22:47:47,138 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 130 transitions, 1014 flow [2023-11-06 22:47:47,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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 22:47:47,139 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:47,139 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:47,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:47:47,139 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:47,140 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash 384404304, now seen corresponding path program 1 times [2023-11-06 22:47:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693482750] [2023-11-06 22:47:47,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:47,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:47,209 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 22:47:47,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:47,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693482750] [2023-11-06 22:47:47,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693482750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:47,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:47,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:47,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565127853] [2023-11-06 22:47:47,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:47,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:47,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:47,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:47,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:47,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 265 [2023-11-06 22:47:47,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 130 transitions, 1014 flow. Second operand has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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 22:47:47,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:47:47,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 265 [2023-11-06 22:47:47,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:47:48,480 INFO L124 PetriNetUnfolderBase]: 3447/6367 cut-off events. [2023-11-06 22:47:48,480 INFO L125 PetriNetUnfolderBase]: For 15820/15953 co-relation queries the response was YES. [2023-11-06 22:47:48,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23191 conditions, 6367 events. 3447/6367 cut-off events. For 15820/15953 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 45409 event pairs, 726 based on Foata normal form. 195/6507 useless extension candidates. Maximal degree in co-relation 23168. Up to 3212 conditions per place. [2023-11-06 22:47:48,527 INFO L140 encePairwiseOnDemand]: 256/265 looper letters, 165 selfloop transitions, 61 changer transitions 0/234 dead transitions. [2023-11-06 22:47:48,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 234 transitions, 1987 flow [2023-11-06 22:47:48,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:47:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:47:48,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 934 transitions. [2023-11-06 22:47:48,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5035040431266846 [2023-11-06 22:47:48,533 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 934 transitions. [2023-11-06 22:47:48,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 934 transitions. [2023-11-06 22:47:48,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:47:48,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 934 transitions. [2023-11-06 22:47:48,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 133.42857142857142) internal successors, (934), 7 states have internal predecessors, (934), 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 22:47:48,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 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 22:47:48,544 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 265.0) internal successors, (2120), 8 states have internal predecessors, (2120), 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 22:47:48,544 INFO L175 Difference]: Start difference. First operand has 90 places, 130 transitions, 1014 flow. Second operand 7 states and 934 transitions. [2023-11-06 22:47:48,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 234 transitions, 1987 flow [2023-11-06 22:47:48,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 234 transitions, 1987 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:47:48,642 INFO L231 Difference]: Finished difference. Result has 98 places, 143 transitions, 1267 flow [2023-11-06 22:47:48,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1267, PETRI_PLACES=98, PETRI_TRANSITIONS=143} [2023-11-06 22:47:48,643 INFO L281 CegarLoopForPetriNet]: 70 programPoint places, 28 predicate places. [2023-11-06 22:47:48,643 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 143 transitions, 1267 flow [2023-11-06 22:47:48,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 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 22:47:48,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:47:48,644 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, 1] [2023-11-06 22:47:48,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:47:48,645 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:47:48,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:48,646 INFO L85 PathProgramCache]: Analyzing trace with hash -649511866, now seen corresponding path program 1 times [2023-11-06 22:47:48,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:48,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597615420] [2023-11-06 22:47:48,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:48,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:48,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:47:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:47:48,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:47:48,768 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:47:48,770 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-06 22:47:48,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-11-06 22:47:48,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-06 22:47:48,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-06 22:47:48,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-06 22:47:48,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-06 22:47:48,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-06 22:47:48,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-06 22:47:48,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-06 22:47:48,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-06 22:47:48,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-06 22:47:48,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-06 22:47:48,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-06 22:47:48,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-06 22:47:48,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-06 22:47:48,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-06 22:47:48,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-06 22:47:48,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-11-06 22:47:48,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-11-06 22:47:48,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-06 22:47:48,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-06 22:47:48,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-06 22:47:48,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-11-06 22:47:48,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-06 22:47:48,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 22:47:48,778 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:47:48,785 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:47:48,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:47:48,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:47:48 BasicIcfg [2023-11-06 22:47:48,836 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:47:48,837 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:47:48,837 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:47:48,838 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:47:48,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:26" (3/4) ... [2023-11-06 22:47:48,840 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:47:48,841 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:47:48,842 INFO L158 Benchmark]: Toolchain (without parser) took 24214.89ms. Allocated memory was 157.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 119.7MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 983.4MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,842 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 125.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:47:48,843 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.64ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 99.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,843 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.24ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,844 INFO L158 Benchmark]: Boogie Preprocessor took 58.71ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 95.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,844 INFO L158 Benchmark]: RCFGBuilder took 647.25ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 76.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,845 INFO L158 Benchmark]: TraceAbstraction took 22792.95ms. Allocated memory was 157.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 76.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 937.3MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,845 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 3.2GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:47:48,847 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.22ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 125.4MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.64ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 99.5MB in the end (delta: 19.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.24ms. Allocated memory is still 157.3MB. Free memory was 99.5MB in the beginning and 97.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.71ms. Allocated memory is still 157.3MB. Free memory was 97.0MB in the beginning and 95.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 647.25ms. Allocated memory is still 157.3MB. Free memory was 95.3MB in the beginning and 76.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 22792.95ms. Allocated memory was 157.3MB in the beginning and 3.2GB in the end (delta: 3.0GB). Free memory was 76.0MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 937.3MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 3.2GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 140 PlacesBefore, 70 PlacesAfterwards, 131 TransitionsBefore, 60 TransitionsAfterwards, 4296 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 72 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 15517 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8116, independent: 7821, independent conditional: 0, independent unconditional: 7821, dependent: 295, dependent conditional: 0, dependent unconditional: 295, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2482, independent: 2436, independent conditional: 0, independent unconditional: 2436, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8116, independent: 5385, independent conditional: 0, independent unconditional: 5385, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 2482, unknown conditional: 0, unknown unconditional: 2482] , Statistics on independence cache: Total cache size (in pairs): 418, Positive cache size: 394, Positive conditional cache size: 0, Positive unconditional cache size: 394, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=-3, r=0, t1={7:0}, t2={8:0}, t3={6:0}, t4={5:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=-2, r=0, t1={7:0}, t2={8:0}, t3={6:0}, t4={5:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=-1, r=1, t1={7:0}, t2={8:0}, t3={6:0}, t4={5:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=0, r=1, t1={7:0}, t2={8:0}, t3={6:0}, t4={5:0}, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L743] 2 r = l [L745] 2 return 0; [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L727] 4 l = x VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - 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: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: 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: 749]: 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: 750]: 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: 751]: 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, 167 locations, 24 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: 22.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1724 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1192 mSDsluCounter, 220 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 98 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2415 IncrementalHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 98 mSolverCounterUnsat, 116 mSDtfsCounter, 2415 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1267occurred in iteration=15, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 110 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 22:47:48,875 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/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 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:47:51,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:47:51,752 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:47:51,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:47:51,763 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:47:51,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:47:51,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:47:51,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:47:51,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:47:51,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:47:51,834 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:47:51,835 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:47:51,835 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:47:51,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:47:51,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:47:51,838 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:47:51,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:47:51,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:47:51,839 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:47:51,840 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:47:51,841 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:47:51,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:47:51,842 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:47:51,842 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:47:51,842 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:47:51,843 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:47:51,843 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:47:51,844 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:47:51,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:47:51,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:47:51,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:47:51,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:51,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:47:51,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:47:51,848 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:47:51,848 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:47:51,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:47:51,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:47:51,849 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:47:51,849 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:47:51,850 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:47:51,850 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_3a90ce01-6b00-4368-a33d-06b199e5519c/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_3a90ce01-6b00-4368-a33d-06b199e5519c/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 -> 3e2f466b16db44ce2fec1aabf9e70b4ab734ef2801c32e66d10c5bcbcceb5301 [2023-11-06 22:47:52,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:47:52,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:47:52,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:47:52,373 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:47:52,374 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:47:52,376 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-06 22:47:55,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:47:55,871 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:47:55,872 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/sv-benchmarks/c/pthread-atomic/read_write_lock-2.i [2023-11-06 22:47:55,898 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/cb547d69c/9b979c2897d14317ac733a1ea0334e73/FLAG007e4fc6d [2023-11-06 22:47:55,917 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/data/cb547d69c/9b979c2897d14317ac733a1ea0334e73 [2023-11-06 22:47:55,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:47:55,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:47:55,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:55,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:47:55,933 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:47:55,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:55" (1/1) ... [2023-11-06 22:47:55,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a97ff27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:55, skipping insertion in model container [2023-11-06 22:47:55,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:47:55" (1/1) ... [2023-11-06 22:47:56,017 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:47:56,269 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:47:56,510 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:56,528 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:47:56,561 WARN L635 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-11-06 22:47:56,610 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:47:56,667 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:56,668 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:56,668 WARN L672 CHandler]: The function __builtin_bswap16 is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:47:56,676 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:47:56,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56 WrapperNode [2023-11-06 22:47:56,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:47:56,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:56,680 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:47:56,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:47:56,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,727 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,768 INFO L138 Inliner]: procedures = 177, calls = 52, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 122 [2023-11-06 22:47:56,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:47:56,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:47:56,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:47:56,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:47:56,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,820 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,831 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:47:56,836 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:47:56,836 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:47:56,836 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:47:56,837 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (1/1) ... [2023-11-06 22:47:56,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:47:56,860 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:47:56,875 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:47:56,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:47:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:47:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:47:56,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:47:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure reader [2023-11-06 22:47:56,926 INFO L138 BoogieDeclarations]: Found implementation of procedure reader [2023-11-06 22:47:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:47:56,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:47:56,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:47:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:47:56,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:47:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:47:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:47:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure writer [2023-11-06 22:47:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure writer [2023-11-06 22:47:56,932 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 22:47:57,144 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:47:57,147 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:47:57,491 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:47:57,558 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:47:57,559 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:47:57,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:57 BoogieIcfgContainer [2023-11-06 22:47:57,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:47:57,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:47:57,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:47:57,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:47:57,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:47:55" (1/3) ... [2023-11-06 22:47:57,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57498923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:57, skipping insertion in model container [2023-11-06 22:47:57,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:47:56" (2/3) ... [2023-11-06 22:47:57,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57498923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:47:57, skipping insertion in model container [2023-11-06 22:47:57,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:57" (3/3) ... [2023-11-06 22:47:57,575 INFO L112 eAbstractionObserver]: Analyzing ICFG read_write_lock-2.i [2023-11-06 22:47:57,594 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:47:57,595 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-11-06 22:47:57,595 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:47:57,724 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:47:57,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 141 transitions, 310 flow [2023-11-06 22:47:57,895 INFO L124 PetriNetUnfolderBase]: 4/137 cut-off events. [2023-11-06 22:47:57,896 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:47:57,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 137 events. 4/137 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:57,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 141 transitions, 310 flow [2023-11-06 22:47:57,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 132 transitions, 288 flow [2023-11-06 22:47:57,918 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:47:57,936 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 132 transitions, 288 flow [2023-11-06 22:47:57,940 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 132 transitions, 288 flow [2023-11-06 22:47:57,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 132 transitions, 288 flow [2023-11-06 22:47:58,002 INFO L124 PetriNetUnfolderBase]: 4/132 cut-off events. [2023-11-06 22:47:58,003 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:47:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 132 events. 4/132 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-11-06 22:47:58,011 INFO L119 LiptonReduction]: Number of co-enabled transitions 4296 [2023-11-06 22:48:12,710 INFO L134 LiptonReduction]: Checked pairs total: 15781 [2023-11-06 22:48:12,711 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-11-06 22:48:12,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:48:12,734 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;@223a1e93, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:48:12,734 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-06 22:48:12,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:48:12,737 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:48:12,737 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:48:12,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:12,738 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:48:12,738 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:12,743 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 488, now seen corresponding path program 1 times [2023-11-06 22:48:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:12,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221151011] [2023-11-06 22:48:12,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:12,758 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 22:48:12,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:12,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:12,777 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:12,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:48:12,850 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:12,853 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 22:48:12,854 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:12,854 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:12,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221151011] [2023-11-06 22:48:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221151011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:48:12,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880707812] [2023-11-06 22:48:12,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:12,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:48:12,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:48:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:48:12,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 258 [2023-11-06 22:48:12,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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 22:48:12,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:12,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 258 [2023-11-06 22:48:12,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:14,521 INFO L124 PetriNetUnfolderBase]: 5285/7752 cut-off events. [2023-11-06 22:48:14,522 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2023-11-06 22:48:14,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15455 conditions, 7752 events. 5285/7752 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 51137 event pairs, 5285 based on Foata normal form. 782/5976 useless extension candidates. Maximal degree in co-relation 11978. Up to 7413 conditions per place. [2023-11-06 22:48:14,641 INFO L140 encePairwiseOnDemand]: 253/258 looper letters, 45 selfloop transitions, 0 changer transitions 0/55 dead transitions. [2023-11-06 22:48:14,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 224 flow [2023-11-06 22:48:14,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:48:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:48:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 300 transitions. [2023-11-06 22:48:14,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2023-11-06 22:48:14,716 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 300 transitions. [2023-11-06 22:48:14,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 300 transitions. [2023-11-06 22:48:14,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:14,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 300 transitions. [2023-11-06 22:48:14,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 150.0) internal successors, (300), 2 states have internal predecessors, (300), 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 22:48:14,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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 22:48:14,730 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 258.0) internal successors, (774), 3 states have internal predecessors, (774), 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 22:48:14,732 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 146 flow. Second operand 2 states and 300 transitions. [2023-11-06 22:48:14,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 224 flow [2023-11-06 22:48:14,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-06 22:48:14,786 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 118 flow [2023-11-06 22:48:14,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-11-06 22:48:14,803 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2023-11-06 22:48:14,804 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 118 flow [2023-11-06 22:48:14,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 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 22:48:14,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:14,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:48:14,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:15,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:15,016 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:15,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:15,017 INFO L85 PathProgramCache]: Analyzing trace with hash 480667, now seen corresponding path program 1 times [2023-11-06 22:48:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259966582] [2023-11-06 22:48:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:15,018 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 22:48:15,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:15,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:15,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:15,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:48:15,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:15,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:48:15,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-06 22:48:15,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,352 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:15,353 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-11-06 22:48:15,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-06 22:48:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,444 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:15,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:48:15,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-06 22:48:15,479 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 22:48:15,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,507 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 22:48:15,515 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 10 treesize of output 8 [2023-11-06 22:48:15,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,558 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:15,559 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:48:15,569 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-06 22:48:15,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,614 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:15,615 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 11 [2023-11-06 22:48:15,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:15,642 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-11-06 22:48:15,827 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 22:48:15,827 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:15,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259966582] [2023-11-06 22:48:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259966582] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:15,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:15,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:15,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295993921] [2023-11-06 22:48:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:15,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:15,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:15,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:15,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:16,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 258 [2023-11-06 22:48:16,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 22:48:16,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:16,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 258 [2023-11-06 22:48:16,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:17,073 INFO L124 PetriNetUnfolderBase]: 5031/7386 cut-off events. [2023-11-06 22:48:17,073 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:17,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14512 conditions, 7386 events. 5031/7386 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 48321 event pairs, 5031 based on Foata normal form. 0/5029 useless extension candidates. Maximal degree in co-relation 14509. Up to 7046 conditions per place. [2023-11-06 22:48:17,150 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 41 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-06 22:48:17,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 53 transitions, 200 flow [2023-11-06 22:48:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:17,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-11-06 22:48:17,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5193798449612403 [2023-11-06 22:48:17,158 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-11-06 22:48:17,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-11-06 22:48:17,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:17,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-11-06 22:48:17,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 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 22:48:17,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:17,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:17,168 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 118 flow. Second operand 3 states and 402 transitions. [2023-11-06 22:48:17,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 53 transitions, 200 flow [2023-11-06 22:48:17,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:17,170 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 118 flow [2023-11-06 22:48:17,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2023-11-06 22:48:17,172 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -10 predicate places. [2023-11-06 22:48:17,172 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 118 flow [2023-11-06 22:48:17,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 22:48:17,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:17,173 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:48:17,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:17,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:17,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:17,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:17,387 INFO L85 PathProgramCache]: Analyzing trace with hash 480665, now seen corresponding path program 1 times [2023-11-06 22:48:17,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:17,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120349926] [2023-11-06 22:48:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:17,388 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 22:48:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:17,389 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:17,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:17,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:17,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:17,553 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:17,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-06 22:48:17,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:17,594 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:48:17,595 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:48:17,627 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:17,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-06 22:48:17,680 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:48:17,681 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:48:17,725 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:48:17,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2023-11-06 22:48:17,749 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:17,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 17 treesize of output 22 [2023-11-06 22:48:17,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:17,800 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:17,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:48:17,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:17,861 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:48:17,862 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 22 [2023-11-06 22:48:18,024 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 22:48:18,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:18,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:18,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120349926] [2023-11-06 22:48:18,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120349926] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:18,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:18,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:18,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578551860] [2023-11-06 22:48:18,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:18,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:18,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:18,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2023-11-06 22:48:18,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 22:48:18,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:18,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2023-11-06 22:48:18,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:19,132 INFO L124 PetriNetUnfolderBase]: 4777/7020 cut-off events. [2023-11-06 22:48:19,132 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:19,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13784 conditions, 7020 events. 4777/7020 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 45652 event pairs, 4777 based on Foata normal form. 0/4864 useless extension candidates. Maximal degree in co-relation 13780. Up to 6681 conditions per place. [2023-11-06 22:48:19,190 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 39 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-06 22:48:19,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 51 transitions, 196 flow [2023-11-06 22:48:19,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:19,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:19,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-11-06 22:48:19,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935400516795866 [2023-11-06 22:48:19,194 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-11-06 22:48:19,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-11-06 22:48:19,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:19,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-11-06 22:48:19,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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 22:48:19,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:19,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:19,200 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 118 flow. Second operand 3 states and 382 transitions. [2023-11-06 22:48:19,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 51 transitions, 196 flow [2023-11-06 22:48:19,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 51 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:19,204 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 114 flow [2023-11-06 22:48:19,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2023-11-06 22:48:19,206 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -12 predicate places. [2023-11-06 22:48:19,210 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 114 flow [2023-11-06 22:48:19,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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 22:48:19,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:19,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:48:19,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:19,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:19,420 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:19,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 461930878, now seen corresponding path program 1 times [2023-11-06 22:48:19,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:19,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699900280] [2023-11-06 22:48:19,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:19,422 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 22:48:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:19,423 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:19,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:19,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:19,528 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 10 treesize of output 8 [2023-11-06 22:48:19,571 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 22:48:19,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,589 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,602 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,640 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:19,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:19,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:19,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,698 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:19,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,720 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:48:19,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:19,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:19,756 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 22:48:19,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:19,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:19,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699900280] [2023-11-06 22:48:19,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699900280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:19,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:19,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:19,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803832138] [2023-11-06 22:48:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:19,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:19,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:19,865 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 258 [2023-11-06 22:48:19,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 22:48:19,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:19,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 258 [2023-11-06 22:48:19,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:20,557 INFO L124 PetriNetUnfolderBase]: 4723/6918 cut-off events. [2023-11-06 22:48:20,557 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:20,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13592 conditions, 6918 events. 4723/6918 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 44903 event pairs, 4723 based on Foata normal form. 0/4807 useless extension candidates. Maximal degree in co-relation 13588. Up to 6591 conditions per place. [2023-11-06 22:48:20,605 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 37 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-11-06 22:48:20,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 49 transitions, 188 flow [2023-11-06 22:48:20,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:20,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-11-06 22:48:20,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5142118863049095 [2023-11-06 22:48:20,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-11-06 22:48:20,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-11-06 22:48:20,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:20,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-11-06 22:48:20,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 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 22:48:20,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:20,614 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:20,614 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 114 flow. Second operand 3 states and 398 transitions. [2023-11-06 22:48:20,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 49 transitions, 188 flow [2023-11-06 22:48:20,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 49 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:20,616 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 110 flow [2023-11-06 22:48:20,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:48:20,617 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2023-11-06 22:48:20,618 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 110 flow [2023-11-06 22:48:20,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 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 22:48:20,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:20,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:48:20,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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)] Ended with exit code 0 [2023-11-06 22:48:20,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:20,830 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:20,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 461930877, now seen corresponding path program 1 times [2023-11-06 22:48:20,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:20,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434205472] [2023-11-06 22:48:20,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:20,831 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 22:48:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:20,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:20,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:20,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:48:20,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:20,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:20,959 INFO L322 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-11-06 22:48:20,960 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:48:20,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:20,981 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:20,981 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 22:48:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:20,993 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:20,994 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:48:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,013 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:48:21,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,024 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,024 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:48:21,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,058 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 22:48:21,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,091 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,095 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-11-06 22:48:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,107 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,108 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 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 22:48:21,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,121 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,122 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2023-11-06 22:48:21,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,153 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2023-11-06 22:48:21,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,198 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,199 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 1 [2023-11-06 22:48:21,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:21,227 INFO L322 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-11-06 22:48:21,227 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2023-11-06 22:48:21,240 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 22:48:21,240 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:21,240 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:21,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434205472] [2023-11-06 22:48:21,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434205472] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:21,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:21,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:21,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973908172] [2023-11-06 22:48:21,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:21,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:21,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:21,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:21,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:21,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2023-11-06 22:48:21,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 22:48:21,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:21,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2023-11-06 22:48:21,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:22,099 INFO L124 PetriNetUnfolderBase]: 4669/6816 cut-off events. [2023-11-06 22:48:22,099 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:22,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13400 conditions, 6816 events. 4669/6816 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 44024 event pairs, 4669 based on Foata normal form. 0/4750 useless extension candidates. Maximal degree in co-relation 13396. Up to 6501 conditions per place. [2023-11-06 22:48:22,153 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 35 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-06 22:48:22,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 180 flow [2023-11-06 22:48:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:22,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-11-06 22:48:22,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2023-11-06 22:48:22,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-11-06 22:48:22,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-11-06 22:48:22,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:22,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-11-06 22:48:22,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 22:48:22,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:22,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:22,163 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 110 flow. Second operand 3 states and 378 transitions. [2023-11-06 22:48:22,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 180 flow [2023-11-06 22:48:22,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:22,167 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 106 flow [2023-11-06 22:48:22,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2023-11-06 22:48:22,171 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2023-11-06 22:48:22,172 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 106 flow [2023-11-06 22:48:22,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 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 22:48:22,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:22,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:22,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:22,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:22,384 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:22,385 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:22,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1533954024, now seen corresponding path program 1 times [2023-11-06 22:48:22,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:22,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779129261] [2023-11-06 22:48:22,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:22,386 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 22:48:22,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:22,388 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:22,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:22,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:48:22,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:22,518 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 22:48:22,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,544 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,551 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,568 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,600 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:22,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,611 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,617 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,627 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,633 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,647 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,683 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:22,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,695 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,702 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:22,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,731 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:22,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,762 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 22:48:22,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,819 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:22,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:22,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:22,878 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 22:48:22,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:22,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:22,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779129261] [2023-11-06 22:48:22,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779129261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:22,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:22,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:22,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549180776] [2023-11-06 22:48:22,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:22,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:22,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:22,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:23,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 258 [2023-11-06 22:48:23,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 22:48:23,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:23,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 258 [2023-11-06 22:48:23,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:23,786 INFO L124 PetriNetUnfolderBase]: 4547/6616 cut-off events. [2023-11-06 22:48:23,786 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:23,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13018 conditions, 6616 events. 4547/6616 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 42578 event pairs, 4547 based on Foata normal form. 0/4635 useless extension candidates. Maximal degree in co-relation 13014. Up to 6319 conditions per place. [2023-11-06 22:48:23,843 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 33 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 22:48:23,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 172 flow [2023-11-06 22:48:23,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:23,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:23,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-11-06 22:48:23,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090439276485789 [2023-11-06 22:48:23,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-11-06 22:48:23,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-11-06 22:48:23,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:23,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-11-06 22:48:23,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 22:48:23,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:23,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:23,852 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 106 flow. Second operand 3 states and 394 transitions. [2023-11-06 22:48:23,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 172 flow [2023-11-06 22:48:23,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:23,854 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 102 flow [2023-11-06 22:48:23,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-11-06 22:48:23,855 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2023-11-06 22:48:23,855 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 102 flow [2023-11-06 22:48:23,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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 22:48:23,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:23,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:23,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:24,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:24,067 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:24,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1533954025, now seen corresponding path program 1 times [2023-11-06 22:48:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:24,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [774598898] [2023-11-06 22:48:24,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:24,068 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 22:48:24,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:24,070 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:24,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:24,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:48:24,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:24,182 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 7 [2023-11-06 22:48:24,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,201 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:24,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,224 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,232 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-06 22:48:24,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,290 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,309 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,332 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,360 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,378 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,388 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:24,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:24,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:24,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,421 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:48:24,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:48:24,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:24,458 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-06 22:48:24,474 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 22:48:24,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:24,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:24,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [774598898] [2023-11-06 22:48:24,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [774598898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:24,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:24,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291557927] [2023-11-06 22:48:24,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:24,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:24,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:24,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:24,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:24,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 258 [2023-11-06 22:48:24,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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 22:48:24,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:24,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 258 [2023-11-06 22:48:24,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:25,090 INFO L124 PetriNetUnfolderBase]: 4425/6416 cut-off events. [2023-11-06 22:48:25,091 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:25,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12636 conditions, 6416 events. 4425/6416 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 40975 event pairs, 4425 based on Foata normal form. 0/4520 useless extension candidates. Maximal degree in co-relation 12632. Up to 6137 conditions per place. [2023-11-06 22:48:25,135 INFO L140 encePairwiseOnDemand]: 254/258 looper letters, 31 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-06 22:48:25,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 43 transitions, 164 flow [2023-11-06 22:48:25,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-06 22:48:25,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48320413436692505 [2023-11-06 22:48:25,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-06 22:48:25,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-06 22:48:25,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:25,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-06 22:48:25,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 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 22:48:25,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:25,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:25,143 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 102 flow. Second operand 3 states and 374 transitions. [2023-11-06 22:48:25,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 43 transitions, 164 flow [2023-11-06 22:48:25,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 43 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:25,145 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 98 flow [2023-11-06 22:48:25,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-11-06 22:48:25,146 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2023-11-06 22:48:25,147 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 98 flow [2023-11-06 22:48:25,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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 22:48:25,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:25,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:25,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:25,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:25,359 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:25,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:25,360 INFO L85 PathProgramCache]: Analyzing trace with hash 956044457, now seen corresponding path program 1 times [2023-11-06 22:48:25,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:25,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1052301122] [2023-11-06 22:48:25,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:25,360 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 22:48:25,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:25,361 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:25,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:25,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:48:25,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:25,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,548 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:25,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2023-11-06 22:48:25,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,567 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2023-11-06 22:48:25,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,634 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-06 22:48:25,634 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2023-11-06 22:48:25,646 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 17 treesize of output 15 [2023-11-06 22:48:25,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:48:25,687 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2023-11-06 22:48:25,705 INFO L322 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-06 22:48:25,705 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-06 22:48:26,416 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 22:48:26,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:26,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:26,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1052301122] [2023-11-06 22:48:26,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1052301122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:26,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:26,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:48:26,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075222607] [2023-11-06 22:48:26,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:26,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:26,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:26,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:26,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:26,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 258 [2023-11-06 22:48:26,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 22:48:26,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:26,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 258 [2023-11-06 22:48:26,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:27,211 INFO L124 PetriNetUnfolderBase]: 3453/5120 cut-off events. [2023-11-06 22:48:27,211 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:27,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10044 conditions, 5120 events. 3453/5120 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 32539 event pairs, 3453 based on Foata normal form. 0/3818 useless extension candidates. Maximal degree in co-relation 10040. Up to 4841 conditions per place. [2023-11-06 22:48:27,239 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 30 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-06 22:48:27,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 160 flow [2023-11-06 22:48:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 393 transitions. [2023-11-06 22:48:27,241 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5077519379844961 [2023-11-06 22:48:27,241 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 393 transitions. [2023-11-06 22:48:27,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 393 transitions. [2023-11-06 22:48:27,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:27,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 393 transitions. [2023-11-06 22:48:27,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 22:48:27,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:27,245 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:27,245 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 98 flow. Second operand 3 states and 393 transitions. [2023-11-06 22:48:27,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 160 flow [2023-11-06 22:48:27,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 42 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:27,248 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 96 flow [2023-11-06 22:48:27,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-11-06 22:48:27,248 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2023-11-06 22:48:27,249 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 96 flow [2023-11-06 22:48:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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 22:48:27,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:27,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:27,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:27,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:27,450 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:27,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:27,450 INFO L85 PathProgramCache]: Analyzing trace with hash 956044458, now seen corresponding path program 1 times [2023-11-06 22:48:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767199324] [2023-11-06 22:48:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:27,451 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 22:48:27,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:27,453 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:27,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:27,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:27,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:27,603 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:48:27,603 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 22:48:27,651 INFO L322 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-06 22:48:27,651 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2023-11-06 22:48:27,737 INFO L322 Elim1Store]: treesize reduction 53, result has 20.9 percent of original size [2023-11-06 22:48:27,737 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-06 22:48:27,802 INFO L322 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-06 22:48:27,803 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2023-11-06 22:48:27,861 INFO L322 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2023-11-06 22:48:27,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 19 [2023-11-06 22:48:27,891 INFO L322 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-06 22:48:27,891 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 9 treesize of output 1 [2023-11-06 22:48:28,485 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 22:48:28,486 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:28,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:28,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767199324] [2023-11-06 22:48:28,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767199324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:28,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:28,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:28,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273609944] [2023-11-06 22:48:28,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:28,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:28,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:28,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:29,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 258 [2023-11-06 22:48:29,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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 22:48:29,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:29,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 258 [2023-11-06 22:48:29,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:29,387 INFO L124 PetriNetUnfolderBase]: 2481/3824 cut-off events. [2023-11-06 22:48:29,387 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-06 22:48:29,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7452 conditions, 3824 events. 2481/3824 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 24380 event pairs, 2481 based on Foata normal form. 0/3116 useless extension candidates. Maximal degree in co-relation 7448. Up to 3545 conditions per place. [2023-11-06 22:48:29,403 INFO L140 encePairwiseOnDemand]: 255/258 looper letters, 29 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-06 22:48:29,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 41 transitions, 156 flow [2023-11-06 22:48:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:29,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:29,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-11-06 22:48:29,406 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4483204134366925 [2023-11-06 22:48:29,406 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-11-06 22:48:29,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-11-06 22:48:29,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:29,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-11-06 22:48:29,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 22:48:29,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:29,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:29,411 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 96 flow. Second operand 3 states and 347 transitions. [2023-11-06 22:48:29,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 41 transitions, 156 flow [2023-11-06 22:48:29,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 41 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:29,413 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 94 flow [2023-11-06 22:48:29,413 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-06 22:48:29,414 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-11-06 22:48:29,414 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 94 flow [2023-11-06 22:48:29,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.8) internal successors, (534), 5 states have internal predecessors, (534), 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 22:48:29,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:29,415 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:29,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:29,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:29,616 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:29,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:29,616 INFO L85 PathProgramCache]: Analyzing trace with hash 925715583, now seen corresponding path program 1 times [2023-11-06 22:48:29,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:29,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982325456] [2023-11-06 22:48:29,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:29,617 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 22:48:29,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:29,618 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:29,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:29,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:29,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:29,767 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 22:48:29,767 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:29,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982325456] [2023-11-06 22:48:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982325456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:29,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561774701] [2023-11-06 22:48:29,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:29,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:29,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:29,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:29,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:29,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:29,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 94 flow. Second operand has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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 22:48:29,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:29,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:29,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:31,001 INFO L124 PetriNetUnfolderBase]: 9165/13214 cut-off events. [2023-11-06 22:48:31,001 INFO L125 PetriNetUnfolderBase]: For 276/276 co-relation queries the response was YES. [2023-11-06 22:48:31,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26043 conditions, 13214 events. 9165/13214 cut-off events. For 276/276 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 73582 event pairs, 3553 based on Foata normal form. 0/12102 useless extension candidates. Maximal degree in co-relation 26039. Up to 9899 conditions per place. [2023-11-06 22:48:31,057 INFO L140 encePairwiseOnDemand]: 247/258 looper letters, 119 selfloop transitions, 28 changer transitions 2/152 dead transitions. [2023-11-06 22:48:31,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 152 transitions, 623 flow [2023-11-06 22:48:31,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:48:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1303 transitions. [2023-11-06 22:48:31,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050387596899225 [2023-11-06 22:48:31,064 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1303 transitions. [2023-11-06 22:48:31,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1303 transitions. [2023-11-06 22:48:31,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:31,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1303 transitions. [2023-11-06 22:48:31,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 130.3) internal successors, (1303), 10 states have internal predecessors, (1303), 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 22:48:31,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:31,078 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:31,078 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 94 flow. Second operand 10 states and 1303 transitions. [2023-11-06 22:48:31,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 152 transitions, 623 flow [2023-11-06 22:48:31,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 152 transitions, 619 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:31,082 INFO L231 Difference]: Finished difference. Result has 60 places, 68 transitions, 246 flow [2023-11-06 22:48:31,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=246, PETRI_PLACES=60, PETRI_TRANSITIONS=68} [2023-11-06 22:48:31,084 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -11 predicate places. [2023-11-06 22:48:31,084 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 68 transitions, 246 flow [2023-11-06 22:48:31,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 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 22:48:31,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:31,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:31,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:31,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:31,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:31,296 INFO L85 PathProgramCache]: Analyzing trace with hash -100814988, now seen corresponding path program 1 times [2023-11-06 22:48:31,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473312355] [2023-11-06 22:48:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:31,297 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 22:48:31,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:31,298 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:31,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:31,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-06 22:48:31,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:31,393 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 22:48:31,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:31,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:31,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473312355] [2023-11-06 22:48:31,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473312355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:31,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:31,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:31,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399485793] [2023-11-06 22:48:31,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:31,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:48:31,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:31,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:48:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:48:31,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258 [2023-11-06 22:48:31,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 68 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 22:48:31,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:31,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258 [2023-11-06 22:48:31,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:32,025 INFO L124 PetriNetUnfolderBase]: 4009/6435 cut-off events. [2023-11-06 22:48:32,025 INFO L125 PetriNetUnfolderBase]: For 1726/1900 co-relation queries the response was YES. [2023-11-06 22:48:32,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14873 conditions, 6435 events. 4009/6435 cut-off events. For 1726/1900 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 44488 event pairs, 1220 based on Foata normal form. 667/6031 useless extension candidates. Maximal degree in co-relation 14865. Up to 2679 conditions per place. [2023-11-06 22:48:32,073 INFO L140 encePairwiseOnDemand]: 252/258 looper letters, 48 selfloop transitions, 4 changer transitions 0/88 dead transitions. [2023-11-06 22:48:32,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 88 transitions, 409 flow [2023-11-06 22:48:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:48:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:48:32,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-11-06 22:48:32,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5426356589147286 [2023-11-06 22:48:32,076 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-11-06 22:48:32,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-11-06 22:48:32,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:32,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-11-06 22:48:32,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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 22:48:32,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:32,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 258.0) internal successors, (1032), 4 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 22:48:32,081 INFO L175 Difference]: Start difference. First operand has 60 places, 68 transitions, 246 flow. Second operand 3 states and 420 transitions. [2023-11-06 22:48:32,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 88 transitions, 409 flow [2023-11-06 22:48:32,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:32,107 INFO L231 Difference]: Finished difference. Result has 63 places, 68 transitions, 262 flow [2023-11-06 22:48:32,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2023-11-06 22:48:32,108 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -8 predicate places. [2023-11-06 22:48:32,108 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 262 flow [2023-11-06 22:48:32,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 22:48:32,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:32,109 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:32,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:32,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:32,325 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:32,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:32,326 INFO L85 PathProgramCache]: Analyzing trace with hash -785458240, now seen corresponding path program 2 times [2023-11-06 22:48:32,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:32,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626076663] [2023-11-06 22:48:32,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:48:32,326 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 22:48:32,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:32,328 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:32,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:32,426 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:48:32,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:48:32,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:48:32,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:32,452 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 22:48:32,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:32,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626076663] [2023-11-06 22:48:32,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626076663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:32,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:48:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238699177] [2023-11-06 22:48:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:32,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:48:32,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:32,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:48:32,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:48:32,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258 [2023-11-06 22:48:32,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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 22:48:32,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:32,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258 [2023-11-06 22:48:32,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:32,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,896 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,896 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,896 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,897 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,897 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,897 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,897 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 310#true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,898 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,898 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,899 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,899 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,899 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 119#L16true, 310#true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,899 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,899 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,899 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,900 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 310#true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,900 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,900 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,900 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,901 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 22:48:32,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 112#L753-1true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,964 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 112#L753-1true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,964 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,964 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 112#L753-1true, 12#L16-2true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,965 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,965 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,965 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,965 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 310#true, 112#L753-1true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,966 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 119#L16true, 310#true, 112#L753-1true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,966 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,966 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,967 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 310#true, 112#L753-1true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:32,967 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,967 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,967 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,967 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,969 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,969 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,969 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,969 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,969 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,970 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,970 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 134#L738-2true, 153#true, 310#true, 353#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,984 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,984 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,984 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,984 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 153#true, 119#L16true, 310#true, 353#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,985 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 353#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:32,985 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:32,985 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 22:48:33,031 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 12#L16-2true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,031 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 12#L16-2true, 93#L753-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true]) [2023-11-06 22:48:33,032 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,032 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 12#L16-2true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 93#L753-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,033 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,033 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,033 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,033 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue]) [2023-11-06 22:48:33,034 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,034 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,034 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,034 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 93#L753-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 119#L16true]) [2023-11-06 22:48:33,035 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,035 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,035 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,035 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 93#L753-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue]) [2023-11-06 22:48:33,036 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,036 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,036 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,036 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,037 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 112#L753-1true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,037 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,037 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,037 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,038 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 112#L753-1true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,038 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,038 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,038 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,039 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 112#L753-1true, 143#L741true, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,039 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,039 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,039 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,039 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,040 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,041 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,041 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,041 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,041 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true, 23#L752-4true]) [2023-11-06 22:48:33,042 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,042 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,042 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,042 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true, 23#L752-4true]) [2023-11-06 22:48:33,043 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,043 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,043 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,043 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,044 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,044 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,044 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,044 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,045 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,045 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,045 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,045 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,046 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,046 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,046 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,046 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,046 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 134#L738-2true, 153#true, 310#true, 353#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,056 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,057 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,057 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,057 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,057 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 153#true, 119#L16true, 310#true, 353#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,057 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,058 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,058 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,058 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,058 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 353#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,058 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,058 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,059 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,059 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 22:48:33,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 143#L741true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,105 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 143#L741true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true]) [2023-11-06 22:48:33,105 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,105 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 143#L741true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,106 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,106 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,106 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,106 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,106 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 12#L16-2true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, 393#(= ~r~0 (_ bv0 32)), Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,106 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 12#L16-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 119#L16true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,107 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,107 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,108 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 12#L16-2true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,108 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,108 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,108 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,108 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,109 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,109 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,109 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,110 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,110 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,110 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true, 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue]) [2023-11-06 22:48:33,110 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,110 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,111 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,111 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,111 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 10#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue]) [2023-11-06 22:48:33,111 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,111 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,111 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,112 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,112 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,113 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,113 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,113 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,113 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,113 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,113 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,114 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,114 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,114 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,114 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,114 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,115 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,115 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,115 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 134#L738-2true, 153#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,115 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,116 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,116 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,116 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,116 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 153#true, 119#L16true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,116 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,117 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,117 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,117 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,117 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,117 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,117 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,118 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,118 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,124 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 134#L738-2true, 153#true, 310#true, 353#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,124 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,125 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,125 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,125 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,125 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 153#true, 119#L16true, 310#true, 353#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,126 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,126 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,126 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,126 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 310#true, 353#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,127 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,127 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,127 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,127 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 22:48:33,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 134#L738-2true, 153#true, 353#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,165 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,165 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,166 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 153#true, 119#L16true, 353#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,166 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,166 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,166 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,166 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,167 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 353#true, 310#true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 23#L752-4true]) [2023-11-06 22:48:33,167 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,167 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,167 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,167 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 143#L741true, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,180 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,180 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,181 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,181 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 143#L741true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true]) [2023-11-06 22:48:33,181 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,181 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,182 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,182 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 143#L741true, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,182 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,182 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,183 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,183 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,183 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,184 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,184 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,184 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,184 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true, 388#true]) [2023-11-06 22:48:33,184 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,185 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,185 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,186 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,186 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,186 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,187 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,187 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,187 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true]) [2023-11-06 22:48:33,188 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,188 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,188 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 101#readerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 93#L753-2true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,189 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,189 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,189 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,189 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,194 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 134#L738-2true, 153#true, 17#L754-1true, 310#true, 353#true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,194 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,195 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,195 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 153#true, 119#L16true, 17#L754-1true, 310#true, 353#true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,195 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,196 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 17#L754-1true, 310#true, 353#true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 142#$Ultimate##0true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,196 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,197 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,197 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,197 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 22:48:33,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 134#L738-2true, 153#true, 353#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,232 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,232 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,232 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,232 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,232 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 153#true, 119#L16true, 353#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,232 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 353#true, 310#true, 112#L753-1true, 101#readerEXITtrue, 103#writerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,233 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,233 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 101#readerEXITtrue, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,239 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,239 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,239 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,239 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 101#readerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true, 388#true]) [2023-11-06 22:48:33,240 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 17#L754-1true, 310#true, 101#readerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,240 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,240 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][50], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 17#L754-1true, 101#readerEXITtrue, 134#L738-2true, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,241 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,241 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,241 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,241 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,241 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][81], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 17#L754-1true, 101#readerEXITtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 119#L16true]) [2023-11-06 22:48:33,241 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][82], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 310#true, 17#L754-1true, 101#readerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 367#(= ~w~0 (_ bv1 32)), 45#L714-1true, 153#true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 393#(= ~r~0 (_ bv0 32)), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,242 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,242 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-06 22:48:33,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 134#L738-2true, 153#true, 353#true, 310#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,338 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 153#true, 119#L16true, 353#true, 310#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,338 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 353#true, 310#true, 101#readerEXITtrue, 93#L753-2true, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,339 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-06 22:48:33,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([392] L734-->L738-2: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_11| v_~x~0_5) (= |v_readerThread1of1ForFork2_~lx~0#1_11| |v_readerThread1of1ForFork2_~ly~0#1_11|)) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, ~x~0=v_~x~0_5} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_11|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_11|, ~x~0=v_~x~0_5} AuxVars[] AssignedVars[readerThread1of1ForFork2_~lx~0#1][51], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 134#L738-2true, 153#true, 353#true, 310#true, 17#L754-1true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), 388#true]) [2023-11-06 22:48:33,361 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,361 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,361 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,361 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L734-->L16: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_13| v_~x~0_11) (not (= |v_readerThread1of1ForFork2_~lx~0#1_13| |v_readerThread1of1ForFork2_~ly~0#1_13|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, ~x~0=v_~x~0_11} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_17|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_13|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_17|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][83], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 153#true, 119#L16true, 353#true, 310#true, 17#L754-1true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,361 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,361 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,362 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,362 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([442] L734-->readerErr0ASSERT_VIOLATIONMEMORY_LEAK: Formula: (and (= |v_readerThread1of1ForFork2_~lx~0#1_15| v_~x~0_17) (not (= |v_readerThread1of1ForFork2_~lx~0#1_15| |v_readerThread1of1ForFork2_~ly~0#1_15|))) InVars {readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, ~x~0=v_~x~0_17} OutVars{readerThread1of1ForFork2_~ly~0#1=|v_readerThread1of1ForFork2_~ly~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset_27|, readerThread1of1ForFork2_~lx~0#1=|v_readerThread1of1ForFork2_~lx~0#1_15|, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base=|v_readerThread1of1ForFork2_reach_error_#t~nondet0#1.base_27|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[readerThread1of1ForFork2_reach_error_#t~nondet0#1.offset, readerThread1of1ForFork2_~lx~0#1, readerThread1of1ForFork2_reach_error_#t~nondet0#1.base][84], [Black: 343#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32))), Black: 367#(= ~w~0 (_ bv1 32)), 107#writerEXITtrue, 102#readerErr0ASSERT_VIOLATIONMEMORY_LEAKtrue, 153#true, 353#true, 310#true, 17#L754-1true, 101#readerEXITtrue, Black: 347#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~ly~0#1| (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), Black: 331#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32))), 388#true, Black: 341#(and (= ~x~0 (_ bv0 32)) (= |readerThread1of1ForFork2_~l~0#1| (_ bv0 32)) (= ~y~0 (_ bv0 32)))]) [2023-11-06 22:48:33,362 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,362 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,362 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,363 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-06 22:48:33,397 INFO L124 PetriNetUnfolderBase]: 4537/7569 cut-off events. [2023-11-06 22:48:33,397 INFO L125 PetriNetUnfolderBase]: For 5319/5522 co-relation queries the response was YES. [2023-11-06 22:48:33,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19612 conditions, 7569 events. 4537/7569 cut-off events. For 5319/5522 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 56271 event pairs, 1470 based on Foata normal form. 214/6336 useless extension candidates. Maximal degree in co-relation 19602. Up to 4032 conditions per place. [2023-11-06 22:48:33,443 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 70 selfloop transitions, 11 changer transitions 0/117 dead transitions. [2023-11-06 22:48:33,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 117 transitions, 577 flow [2023-11-06 22:48:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:48:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:48:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 22:48:33,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5513565891472868 [2023-11-06 22:48:33,447 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 22:48:33,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 22:48:33,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:33,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 22:48:33,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 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 22:48:33,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 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 22:48:33,455 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 258.0) internal successors, (1290), 5 states have internal predecessors, (1290), 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 22:48:33,455 INFO L175 Difference]: Start difference. First operand has 63 places, 68 transitions, 262 flow. Second operand 4 states and 569 transitions. [2023-11-06 22:48:33,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 117 transitions, 577 flow [2023-11-06 22:48:33,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 117 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:33,490 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 337 flow [2023-11-06 22:48:33,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2023-11-06 22:48:33,491 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2023-11-06 22:48:33,491 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 337 flow [2023-11-06 22:48:33,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 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 22:48:33,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:33,492 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:33,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:33,703 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:33,704 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1781091317, now seen corresponding path program 1 times [2023-11-06 22:48:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:33,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327341730] [2023-11-06 22:48:33,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:33,705 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 22:48:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:33,706 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:33,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (14)] Waiting until timeout for monitored process [2023-11-06 22:48:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:33,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:33,799 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:33,864 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 22:48:33,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:33,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:33,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327341730] [2023-11-06 22:48:33,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327341730] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:33,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:33,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:33,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398789202] [2023-11-06 22:48:33,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:33,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:33,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:33,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:33,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:33,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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 22:48:33,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:33,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:33,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:36,220 INFO L124 PetriNetUnfolderBase]: 12925/20286 cut-off events. [2023-11-06 22:48:36,220 INFO L125 PetriNetUnfolderBase]: For 16595/16607 co-relation queries the response was YES. [2023-11-06 22:48:36,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55374 conditions, 20286 events. 12925/20286 cut-off events. For 16595/16607 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 149764 event pairs, 3531 based on Foata normal form. 446/19127 useless extension candidates. Maximal degree in co-relation 55363. Up to 6513 conditions per place. [2023-11-06 22:48:36,322 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 225 selfloop transitions, 26 changer transitions 5/259 dead transitions. [2023-11-06 22:48:36,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 259 transitions, 1567 flow [2023-11-06 22:48:36,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1231 transitions. [2023-11-06 22:48:36,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5301464254952627 [2023-11-06 22:48:36,328 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1231 transitions. [2023-11-06 22:48:36,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1231 transitions. [2023-11-06 22:48:36,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:36,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1231 transitions. [2023-11-06 22:48:36,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 136.77777777777777) internal successors, (1231), 9 states have internal predecessors, (1231), 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 22:48:36,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 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 22:48:36,339 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 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 22:48:36,339 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 337 flow. Second operand 9 states and 1231 transitions. [2023-11-06 22:48:36,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 259 transitions, 1567 flow [2023-11-06 22:48:36,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 259 transitions, 1551 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:36,517 INFO L231 Difference]: Finished difference. Result has 80 places, 87 transitions, 480 flow [2023-11-06 22:48:36,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=480, PETRI_PLACES=80, PETRI_TRANSITIONS=87} [2023-11-06 22:48:36,518 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2023-11-06 22:48:36,518 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 87 transitions, 480 flow [2023-11-06 22:48:36,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 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 22:48:36,519 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:36,519 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:36,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:36,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:36,730 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:36,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:36,731 INFO L85 PathProgramCache]: Analyzing trace with hash 2146538704, now seen corresponding path program 1 times [2023-11-06 22:48:36,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528262945] [2023-11-06 22:48:36,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:36,732 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 22:48:36,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:36,734 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:36,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (15)] Waiting until timeout for monitored process [2023-11-06 22:48:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:36,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:36,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:36,856 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 22:48:36,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:36,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:36,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528262945] [2023-11-06 22:48:36,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528262945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:36,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:36,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605095403] [2023-11-06 22:48:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:36,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:36,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:36,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:36,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 87 transitions, 480 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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 22:48:36,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:36,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:36,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:40,984 INFO L124 PetriNetUnfolderBase]: 22114/35258 cut-off events. [2023-11-06 22:48:40,984 INFO L125 PetriNetUnfolderBase]: For 61122/62029 co-relation queries the response was YES. [2023-11-06 22:48:41,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110613 conditions, 35258 events. 22114/35258 cut-off events. For 61122/62029 co-relation queries the response was YES. Maximal size of possible extension queue 2139. Compared 287189 event pairs, 5411 based on Foata normal form. 1782/34614 useless extension candidates. Maximal degree in co-relation 110595. Up to 18329 conditions per place. [2023-11-06 22:48:41,276 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 209 selfloop transitions, 86 changer transitions 2/309 dead transitions. [2023-11-06 22:48:41,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 309 transitions, 2270 flow [2023-11-06 22:48:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:48:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:48:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1216 transitions. [2023-11-06 22:48:41,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236864771748493 [2023-11-06 22:48:41,282 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1216 transitions. [2023-11-06 22:48:41,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1216 transitions. [2023-11-06 22:48:41,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:41,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1216 transitions. [2023-11-06 22:48:41,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.11111111111111) internal successors, (1216), 9 states have internal predecessors, (1216), 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 22:48:41,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 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 22:48:41,294 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 258.0) internal successors, (2580), 10 states have internal predecessors, (2580), 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 22:48:41,294 INFO L175 Difference]: Start difference. First operand has 80 places, 87 transitions, 480 flow. Second operand 9 states and 1216 transitions. [2023-11-06 22:48:41,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 309 transitions, 2270 flow [2023-11-06 22:48:42,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 309 transitions, 2194 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-11-06 22:48:42,094 INFO L231 Difference]: Finished difference. Result has 91 places, 160 transitions, 1176 flow [2023-11-06 22:48:42,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1176, PETRI_PLACES=91, PETRI_TRANSITIONS=160} [2023-11-06 22:48:42,095 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 20 predicate places. [2023-11-06 22:48:42,095 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 160 transitions, 1176 flow [2023-11-06 22:48:42,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 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 22:48:42,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:42,095 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:42,104 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:42,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:42,296 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:42,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash -572390540, now seen corresponding path program 1 times [2023-11-06 22:48:42,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:42,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537897873] [2023-11-06 22:48:42,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:42,297 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 22:48:42,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:42,298 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:42,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (16)] Waiting until timeout for monitored process [2023-11-06 22:48:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:42,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:48:42,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:42,454 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 22:48:42,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:42,454 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:42,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537897873] [2023-11-06 22:48:42,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537897873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:42,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:42,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:42,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505763888] [2023-11-06 22:48:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:42,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:42,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:42,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:42,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 258 [2023-11-06 22:48:42,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 160 transitions, 1176 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:42,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:42,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 258 [2023-11-06 22:48:42,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:43,517 INFO L124 PetriNetUnfolderBase]: 2538/5333 cut-off events. [2023-11-06 22:48:43,517 INFO L125 PetriNetUnfolderBase]: For 9173/9472 co-relation queries the response was YES. [2023-11-06 22:48:43,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17449 conditions, 5333 events. 2538/5333 cut-off events. For 9173/9472 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 45153 event pairs, 777 based on Foata normal form. 446/5336 useless extension candidates. Maximal degree in co-relation 17427. Up to 2220 conditions per place. [2023-11-06 22:48:43,557 INFO L140 encePairwiseOnDemand]: 251/258 looper letters, 82 selfloop transitions, 13 changer transitions 5/182 dead transitions. [2023-11-06 22:48:43,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 182 transitions, 1305 flow [2023-11-06 22:48:43,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:48:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:48:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2023-11-06 22:48:43,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5410852713178295 [2023-11-06 22:48:43,560 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2023-11-06 22:48:43,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2023-11-06 22:48:43,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:43,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2023-11-06 22:48:43,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 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 22:48:43,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 22:48:43,565 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 258.0) internal successors, (1548), 6 states have internal predecessors, (1548), 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 22:48:43,565 INFO L175 Difference]: Start difference. First operand has 91 places, 160 transitions, 1176 flow. Second operand 5 states and 698 transitions. [2023-11-06 22:48:43,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 182 transitions, 1305 flow [2023-11-06 22:48:43,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 182 transitions, 1301 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:43,620 INFO L231 Difference]: Finished difference. Result has 96 places, 130 transitions, 906 flow [2023-11-06 22:48:43,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=906, PETRI_PLACES=96, PETRI_TRANSITIONS=130} [2023-11-06 22:48:43,621 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 25 predicate places. [2023-11-06 22:48:43,621 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 130 transitions, 906 flow [2023-11-06 22:48:43,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:48:43,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:43,622 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:43,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:43,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:43,822 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:43,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 788935710, now seen corresponding path program 1 times [2023-11-06 22:48:43,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:43,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356295337] [2023-11-06 22:48:43,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:43,823 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 22:48:43,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:43,824 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:43,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (17)] Waiting until timeout for monitored process [2023-11-06 22:48:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:43,932 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:43,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:44,002 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 22:48:44,002 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:44,003 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356295337] [2023-11-06 22:48:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356295337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:44,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664197666] [2023-11-06 22:48:44,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:44,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:44,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:44,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:44,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:44,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 130 transitions, 906 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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 22:48:44,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:44,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:44,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:45,374 INFO L124 PetriNetUnfolderBase]: 3825/7200 cut-off events. [2023-11-06 22:48:45,374 INFO L125 PetriNetUnfolderBase]: For 14845/14989 co-relation queries the response was YES. [2023-11-06 22:48:45,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25729 conditions, 7200 events. 3825/7200 cut-off events. For 14845/14989 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 54241 event pairs, 1809 based on Foata normal form. 112/7067 useless extension candidates. Maximal degree in co-relation 25705. Up to 6002 conditions per place. [2023-11-06 22:48:45,426 INFO L140 encePairwiseOnDemand]: 248/258 looper letters, 145 selfloop transitions, 63 changer transitions 3/222 dead transitions. [2023-11-06 22:48:45,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 222 transitions, 1890 flow [2023-11-06 22:48:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:48:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1273 transitions. [2023-11-06 22:48:45,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4934108527131783 [2023-11-06 22:48:45,432 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1273 transitions. [2023-11-06 22:48:45,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1273 transitions. [2023-11-06 22:48:45,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:45,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1273 transitions. [2023-11-06 22:48:45,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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 22:48:45,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:45,443 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:45,443 INFO L175 Difference]: Start difference. First operand has 96 places, 130 transitions, 906 flow. Second operand 10 states and 1273 transitions. [2023-11-06 22:48:45,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 222 transitions, 1890 flow [2023-11-06 22:48:45,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 222 transitions, 1830 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-11-06 22:48:45,542 INFO L231 Difference]: Finished difference. Result has 104 places, 152 transitions, 1209 flow [2023-11-06 22:48:45,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1209, PETRI_PLACES=104, PETRI_TRANSITIONS=152} [2023-11-06 22:48:45,543 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 33 predicate places. [2023-11-06 22:48:45,543 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 152 transitions, 1209 flow [2023-11-06 22:48:45,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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 22:48:45,544 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:45,544 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:45,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (17)] Ended with exit code 0 [2023-11-06 22:48:45,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:45,755 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:45,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash 860255807, now seen corresponding path program 1 times [2023-11-06 22:48:45,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:45,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729493613] [2023-11-06 22:48:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:45,756 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 22:48:45,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:45,757 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:45,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (18)] Waiting until timeout for monitored process [2023-11-06 22:48:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:45,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:48:45,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:45,884 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 22:48:45,884 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:45,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:45,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729493613] [2023-11-06 22:48:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729493613] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:45,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:45,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:48:45,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25767071] [2023-11-06 22:48:45,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:45,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:48:45,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:45,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:48:45,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:48:45,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:45,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 152 transitions, 1209 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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 22:48:45,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:45,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:45,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:47,476 INFO L124 PetriNetUnfolderBase]: 3920/7298 cut-off events. [2023-11-06 22:48:47,476 INFO L125 PetriNetUnfolderBase]: For 18929/19130 co-relation queries the response was YES. [2023-11-06 22:48:47,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26669 conditions, 7298 events. 3920/7298 cut-off events. For 18929/19130 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 54252 event pairs, 1016 based on Foata normal form. 251/7459 useless extension candidates. Maximal degree in co-relation 26642. Up to 4041 conditions per place. [2023-11-06 22:48:47,544 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 187 selfloop transitions, 85 changer transitions 0/282 dead transitions. [2023-11-06 22:48:47,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 282 transitions, 2462 flow [2023-11-06 22:48:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:48:47,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:48:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 942 transitions. [2023-11-06 22:48:47,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521594684385382 [2023-11-06 22:48:47,548 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 942 transitions. [2023-11-06 22:48:47,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 942 transitions. [2023-11-06 22:48:47,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:47,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 942 transitions. [2023-11-06 22:48:47,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 134.57142857142858) internal successors, (942), 7 states have internal predecessors, (942), 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 22:48:47,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 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 22:48:47,558 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 258.0) internal successors, (2064), 8 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 22:48:47,558 INFO L175 Difference]: Start difference. First operand has 104 places, 152 transitions, 1209 flow. Second operand 7 states and 942 transitions. [2023-11-06 22:48:47,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 282 transitions, 2462 flow [2023-11-06 22:48:47,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 282 transitions, 2422 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:47,697 INFO L231 Difference]: Finished difference. Result has 113 places, 182 transitions, 1664 flow [2023-11-06 22:48:47,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=1181, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1664, PETRI_PLACES=113, PETRI_TRANSITIONS=182} [2023-11-06 22:48:47,699 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 42 predicate places. [2023-11-06 22:48:47,699 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 182 transitions, 1664 flow [2023-11-06 22:48:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 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 22:48:47,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:47,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:47,716 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (18)] Ended with exit code 0 [2023-11-06 22:48:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:47,911 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:47,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1687526702, now seen corresponding path program 1 times [2023-11-06 22:48:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:47,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1339569303] [2023-11-06 22:48:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:47,912 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 22:48:47,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:47,913 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:47,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (19)] Waiting until timeout for monitored process [2023-11-06 22:48:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:48:48,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:48:48,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:48:48,077 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 22:48:48,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:48:48,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:48:48,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1339569303] [2023-11-06 22:48:48,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1339569303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:48:48,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:48:48,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:48:48,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476441691] [2023-11-06 22:48:48,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:48:48,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:48:48,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:48:48,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:48:48,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:48:48,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 258 [2023-11-06 22:48:48,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 182 transitions, 1664 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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 22:48:48,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:48:48,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 258 [2023-11-06 22:48:48,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:48:49,801 INFO L124 PetriNetUnfolderBase]: 3720/7291 cut-off events. [2023-11-06 22:48:49,801 INFO L125 PetriNetUnfolderBase]: For 20490/20764 co-relation queries the response was YES. [2023-11-06 22:48:49,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27706 conditions, 7291 events. 3720/7291 cut-off events. For 20490/20764 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 56255 event pairs, 810 based on Foata normal form. 206/7458 useless extension candidates. Maximal degree in co-relation 27674. Up to 2108 conditions per place. [2023-11-06 22:48:49,865 INFO L140 encePairwiseOnDemand]: 249/258 looper letters, 265 selfloop transitions, 73 changer transitions 0/355 dead transitions. [2023-11-06 22:48:49,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 355 transitions, 3212 flow [2023-11-06 22:48:49,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:48:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-06 22:48:49,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1341 transitions. [2023-11-06 22:48:49,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197674418604651 [2023-11-06 22:48:49,871 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1341 transitions. [2023-11-06 22:48:49,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1341 transitions. [2023-11-06 22:48:49,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:48:49,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1341 transitions. [2023-11-06 22:48:49,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 134.1) internal successors, (1341), 10 states have internal predecessors, (1341), 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 22:48:49,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:49,883 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 258.0) internal successors, (2838), 11 states have internal predecessors, (2838), 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 22:48:49,884 INFO L175 Difference]: Start difference. First operand has 113 places, 182 transitions, 1664 flow. Second operand 10 states and 1341 transitions. [2023-11-06 22:48:49,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 355 transitions, 3212 flow [2023-11-06 22:48:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 355 transitions, 3212 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:48:49,990 INFO L231 Difference]: Finished difference. Result has 126 places, 198 transitions, 1983 flow [2023-11-06 22:48:49,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=258, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1983, PETRI_PLACES=126, PETRI_TRANSITIONS=198} [2023-11-06 22:48:49,991 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 55 predicate places. [2023-11-06 22:48:49,992 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 198 transitions, 1983 flow [2023-11-06 22:48:49,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 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 22:48:49,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:48:49,992 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, 1] [2023-11-06 22:48:50,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (19)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:50,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:50,204 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting readerErr0ASSERT_VIOLATIONMEMORY_LEAK === [readerErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-11-06 22:48:50,204 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:48:50,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1321266619, now seen corresponding path program 1 times [2023-11-06 22:48:50,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:48:50,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691389165] [2023-11-06 22:48:50,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:48:50,205 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 22:48:50,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:48:50,206 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:50,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (20)] Waiting until timeout for monitored process [2023-11-06 22:48:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:50,353 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:48:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:48:50,469 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:48:50,470 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:48:50,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (23 of 24 remaining) [2023-11-06 22:48:50,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (22 of 24 remaining) [2023-11-06 22:48:50,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-11-06 22:48:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-11-06 22:48:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-11-06 22:48:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-11-06 22:48:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-11-06 22:48:50,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-11-06 22:48:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-11-06 22:48:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 24 remaining) [2023-11-06 22:48:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 24 remaining) [2023-11-06 22:48:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-11-06 22:48:50,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-11-06 22:48:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 24 remaining) [2023-11-06 22:48:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 24 remaining) [2023-11-06 22:48:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-11-06 22:48:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-11-06 22:48:50,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 24 remaining) [2023-11-06 22:48:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK (5 of 24 remaining) [2023-11-06 22:48:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 24 remaining) [2023-11-06 22:48:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 24 remaining) [2023-11-06 22:48:50,477 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 24 remaining) [2023-11-06 22:48:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 24 remaining) [2023-11-06 22:48:50,478 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location readerErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 24 remaining) [2023-11-06 22:48:50,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:48:50,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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 22:48:50,692 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:48:50,700 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:48:50,700 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:48:50,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:48:50 BasicIcfg [2023-11-06 22:48:50,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:48:50,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:48:50,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:48:50,779 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:48:50,780 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:47:57" (3/4) ... [2023-11-06 22:48:50,782 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:48:50,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:48:50,784 INFO L158 Benchmark]: Toolchain (without parser) took 54858.86ms. Allocated memory was 69.2MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 45.0MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 712.8MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,785 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:50,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 751.63ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.9MB in the beginning and 54.3MB in the end (delta: -9.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,786 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.26ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 52.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,786 INFO L158 Benchmark]: Boogie Preprocessor took 65.90ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 50.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,786 INFO L158 Benchmark]: RCFGBuilder took 726.16ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 53.8MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,787 INFO L158 Benchmark]: TraceAbstraction took 53212.43ms. Allocated memory was 83.9MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 52.9MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 705.8MB. Max. memory is 16.1GB. [2023-11-06 22:48:50,787 INFO L158 Benchmark]: Witness Printer took 6.22ms. Allocated memory is still 4.3GB. Free memory is still 3.5GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:48:50,797 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.34ms. Allocated memory is still 69.2MB. Free memory was 45.9MB in the beginning and 45.8MB in the end (delta: 94.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 751.63ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 44.9MB in the beginning and 54.3MB in the end (delta: -9.4MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.26ms. Allocated memory is still 83.9MB. Free memory was 54.3MB in the beginning and 52.0MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.90ms. Allocated memory is still 83.9MB. Free memory was 52.0MB in the beginning and 50.2MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 726.16ms. Allocated memory is still 83.9MB. Free memory was 50.2MB in the beginning and 53.8MB in the end (delta: -3.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 53212.43ms. Allocated memory was 83.9MB in the beginning and 4.3GB in the end (delta: 4.2GB). Free memory was 52.9MB in the beginning and 3.5GB in the end (delta: -3.5GB). Peak memory consumption was 705.8MB. Max. memory is 16.1GB. * Witness Printer took 6.22ms. Allocated memory is still 4.3GB. Free memory is still 3.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: 14.8s, 141 PlacesBefore, 71 PlacesAfterwards, 132 TransitionsBefore, 61 TransitionsAfterwards, 4296 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 1 ChoiceCompositions, 117 TotalNumberOfCompositions, 15781 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8247, independent: 7940, independent conditional: 0, independent unconditional: 7940, dependent: 307, dependent conditional: 0, dependent unconditional: 307, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2386, independent: 2342, independent conditional: 0, independent unconditional: 2342, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8247, independent: 5598, independent conditional: 0, independent unconditional: 5598, dependent: 263, dependent conditional: 0, dependent unconditional: 263, unknown: 2386, unknown conditional: 0, unknown unconditional: 2386] , Statistics on independence cache: Total cache size (in pairs): 420, Positive cache size: 395, Positive conditional cache size: 0, Positive unconditional cache size: 395, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 16]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 16. Possible FailurePath: [L704] 0 int w=0, r=0, x, y; [L748] 0 pthread_t t1, t2, t3, t4; [L749] FCALL, FORK 0 pthread_create(&t1, 0, writer, 0) VAL [pthread_create(&t1, 0, writer, 0)=0, r=0, t1={3:0}, t2={-2:0}, t3={-6:0}, t4={-10:0}, w=0, x=0, y=0] [L750] FCALL, FORK 0 pthread_create(&t2, 0, reader, 0) VAL [pthread_create(&t2, 0, reader, 0)=1, r=0, t1={3:0}, t2={-2:0}, t3={-6:0}, t4={-10:0}, w=0, x=0, y=0] [L724] 2 int l; [L725] CALL 2 __VERIFIER_atomic_take_read_lock() [L710] CALL 2 assume_abort_if_not(w==0) [L3] COND FALSE 2 !(!cond) [L710] RET 2 assume_abort_if_not(w==0) [L711] 2 r = r+1 [L725] RET 2 __VERIFIER_atomic_take_read_lock() [L727] 2 l = x VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L730] 2 y = l VAL [arg={0:0}, arg={0:0}, l=0, r=1, w=0, x=0, y=0] [L751] FCALL, FORK 0 pthread_create(&t3, 0, writer, 0) VAL [pthread_create(&t3, 0, writer, 0)=2, r=1, t1={3:0}, t2={-2:0}, t3={-6:0}, t4={-10:0}, w=0, x=0, y=0] [L752] FCALL, FORK 0 pthread_create(&t4, 0, reader, 0) VAL [pthread_create(&t4, 0, reader, 0)=3, r=1, t1={3:0}, t2={-2:0}, t3={-6:0}, t4={-10:0}, w=0, x=0, y=0] [L733] 2 int ly = y; VAL [arg={0:0}, arg={0:0}, l=0, ly=0, r=1, w=0, x=0, y=0] [L736] 2 int lx = x; [L738] COND FALSE 2 !(!(ly == lx)) VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L740] 2 l = r-1 VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=1, w=0, x=0, y=0] [L724] 4 int l; [L725] CALL 4 __VERIFIER_atomic_take_read_lock() [L710] CALL 4 assume_abort_if_not(w==0) [L3] COND FALSE 4 !(!cond) [L710] RET 4 assume_abort_if_not(w==0) [L711] 4 r = r+1 [L725] RET 4 __VERIFIER_atomic_take_read_lock() [L727] 4 l = x VAL [arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=2, w=0, x=0, y=0] [L743] 2 r = l [L745] 2 return 0; [L714] CALL 1 __VERIFIER_atomic_take_write_lock() [L706] CALL 1 assume_abort_if_not(w==0 && r==0) [L3] COND FALSE 1 !(!cond) [L706] RET 1 assume_abort_if_not(w==0 && r==0) [L707] 1 w = 1 [L714] RET 1 __VERIFIER_atomic_take_write_lock() [L730] 4 y = l VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L733] 4 int ly = y; VAL [\result={0:0}, arg={0:0}, arg={0:0}, l=0, lx=0, ly=0, r=0, w=1, x=0, y=0] [L716] 1 x = 3 VAL [arg={0:0}, arg={0:0}, r=0, w=1, x=3, y=0] [L736] 4 int lx = x; [L738] COND TRUE 4 !(ly == lx) [L738] CALL 4 reach_error() [L16] COND FALSE 4 !(0) [L16] 4 __assert_fail ("0", "read_write_lock-2.c", 7, __extension__ __PRETTY_FUNCTION__) VAL [r=0, w=1, x=3, y=0] - 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: 747]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 752]: 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: 749]: 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: 750]: 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: 751]: 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, 168 locations, 24 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: 52.9s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 27.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2054 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1465 mSDsluCounter, 287 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3364 IncrementalHoareTripleChecker+Invalid, 3492 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 115 mSDtfsCounter, 3364 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1983occurred in iteration=18, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 154 ConstructedInterpolants, 20 QuantifiedInterpolants, 1936 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1382 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 22:48:50,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a90ce01-6b00-4368-a33d-06b199e5519c/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