./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:11,440 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:11,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:03:11,514 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:11,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:11,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:11,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:11,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:11,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:11,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:11,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:11,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:11,562 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:11,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:11,563 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:11,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:11,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:11,565 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:11,565 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:03:11,566 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:03:11,566 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:03:11,567 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:11,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:03:11,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:03:11,568 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:11,569 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:11,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:11,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:11,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:11,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:11,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:11,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:11,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:11,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:11,583 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:11,583 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:11,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:11,584 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:11,584 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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2023-11-06 23:03:11,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:11,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:11,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:11,939 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:11,940 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:11,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-06 23:03:15,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:15,525 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:15,530 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-06 23:03:15,566 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/6e6671e0e/d84935fe54c94bf689e82331a64412ea/FLAG6c19db89f [2023-11-06 23:03:15,587 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/6e6671e0e/d84935fe54c94bf689e82331a64412ea [2023-11-06 23:03:15,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:15,600 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:15,606 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:15,606 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:15,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:15,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:15" (1/1) ... [2023-11-06 23:03:15,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1eb3e8e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:15, skipping insertion in model container [2023-11-06 23:03:15,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:15" (1/1) ... [2023-11-06 23:03:15,690 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:16,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:16,130 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:16,205 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:16,247 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:16,248 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:16,256 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:16,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16 WrapperNode [2023-11-06 23:03:16,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:16,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:16,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:16,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:16,267 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,316 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,363 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-06 23:03:16,364 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:16,365 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:16,365 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:16,365 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:16,375 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,380 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,384 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,420 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:16,429 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:16,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:16,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:16,430 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (1/1) ... [2023-11-06 23:03:16,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:16,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:16,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:16,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:03:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:03:16,519 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:03:16,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:03:16,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:03:16,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:03:16,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:03:16,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:03:16,522 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:03:16,522 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:03:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:16,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:03:16,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:16,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:16,527 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 23:03:16,756 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:16,759 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:17,172 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:17,389 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:17,389 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:03:17,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:17 BoogieIcfgContainer [2023-11-06 23:03:17,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:17,398 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:17,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:17,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:17,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:15" (1/3) ... [2023-11-06 23:03:17,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f33039f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:17, skipping insertion in model container [2023-11-06 23:03:17,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:16" (2/3) ... [2023-11-06 23:03:17,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f33039f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:17, skipping insertion in model container [2023-11-06 23:03:17,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:17" (3/3) ... [2023-11-06 23:03:17,408 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-11-06 23:03:17,429 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:17,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 23:03:17,430 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:03:17,522 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:03:17,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 23:03:17,658 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 23:03:17,658 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:17,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 23:03:17,665 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 23:03:17,671 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 23:03:17,675 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:03:17,685 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 23:03:17,688 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 23:03:17,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 23:03:17,726 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 23:03:17,726 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:17,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 23:03:17,732 INFO L119 LiptonReduction]: Number of co-enabled transitions 3860 [2023-11-06 23:03:23,693 INFO L134 LiptonReduction]: Checked pairs total: 9954 [2023-11-06 23:03:23,693 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 23:03:23,722 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:23,735 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;@768fc672, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:23,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 23:03:23,737 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:03:23,738 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:03:23,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:23,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:23,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:03:23,739 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:23,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 641, now seen corresponding path program 1 times [2023-11-06 23:03:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:23,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160631807] [2023-11-06 23:03:23,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:23,893 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 23:03:23,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:23,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160631807] [2023-11-06 23:03:23,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160631807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:23,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:23,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:03:23,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745837875] [2023-11-06 23:03:23,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:23,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:23,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:23,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:23,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:23,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-06 23:03:23,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:23,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:23,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-06 23:03:23,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:25,847 INFO L124 PetriNetUnfolderBase]: 6949/9556 cut-off events. [2023-11-06 23:03:25,848 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 23:03:25,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19170 conditions, 9556 events. 6949/9556 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 49685 event pairs, 6949 based on Foata normal form. 0/8247 useless extension candidates. Maximal degree in co-relation 19158. Up to 9399 conditions per place. [2023-11-06 23:03:25,940 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 27 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-06 23:03:25,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 128 flow [2023-11-06 23:03:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:03:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-11-06 23:03:25,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257731958762887 [2023-11-06 23:03:25,957 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-11-06 23:03:25,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-11-06 23:03:25,959 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:25,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-11-06 23:03:25,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:25,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:25,973 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:25,975 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 306 transitions. [2023-11-06 23:03:25,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 128 flow [2023-11-06 23:03:25,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:03:25,983 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-06 23:03:25,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-06 23:03:25,990 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-06 23:03:25,991 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-06 23:03:25,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:25,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:25,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:03:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:25,992 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:25,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 608384640, now seen corresponding path program 1 times [2023-11-06 23:03:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733686456] [2023-11-06 23:03:25,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:25,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:26,445 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 23:03:26,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:26,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733686456] [2023-11-06 23:03:26,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733686456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:26,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:26,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:26,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936715977] [2023-11-06 23:03:26,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:26,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:26,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:26,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:26,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:26,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 291 [2023-11-06 23:03:26,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:26,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:26,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 291 [2023-11-06 23:03:26,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:27,805 INFO L124 PetriNetUnfolderBase]: 5463/7720 cut-off events. [2023-11-06 23:03:27,806 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:27,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15317 conditions, 7720 events. 5463/7720 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 41524 event pairs, 1453 based on Foata normal form. 0/7156 useless extension candidates. Maximal degree in co-relation 15314. Up to 5923 conditions per place. [2023-11-06 23:03:27,875 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 41 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-11-06 23:03:27,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 49 transitions, 200 flow [2023-11-06 23:03:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:27,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-11-06 23:03:27,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131729667812142 [2023-11-06 23:03:27,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-11-06 23:03:27,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-11-06 23:03:27,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:27,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-11-06 23:03:27,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,890 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 448 transitions. [2023-11-06 23:03:27,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 49 transitions, 200 flow [2023-11-06 23:03:27,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 200 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:27,892 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-06 23:03:27,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 23:03:27,894 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-06 23:03:27,894 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-06 23:03:27,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:27,895 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:27,895 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:27,896 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:27,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:27,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1245356569, now seen corresponding path program 1 times [2023-11-06 23:03:27,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:27,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937398629] [2023-11-06 23:03:27,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:28,332 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 23:03:28,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:28,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937398629] [2023-11-06 23:03:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937398629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:28,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:28,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:28,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851818109] [2023-11-06 23:03:28,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:28,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:28,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:28,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-06 23:03:28,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:28,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:28,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-06 23:03:28,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:32,578 INFO L124 PetriNetUnfolderBase]: 20389/27330 cut-off events. [2023-11-06 23:03:32,578 INFO L125 PetriNetUnfolderBase]: For 1340/1340 co-relation queries the response was YES. [2023-11-06 23:03:32,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56353 conditions, 27330 events. 20389/27330 cut-off events. For 1340/1340 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 142608 event pairs, 6269 based on Foata normal form. 0/26402 useless extension candidates. Maximal degree in co-relation 56349. Up to 16507 conditions per place. [2023-11-06 23:03:32,744 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 74 selfloop transitions, 16 changer transitions 0/90 dead transitions. [2023-11-06 23:03:32,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 384 flow [2023-11-06 23:03:32,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:32,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 23:03:32,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47903780068728524 [2023-11-06 23:03:32,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 23:03:32,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 23:03:32,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:32,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 23:03:32,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:32,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:32,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:32,760 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 697 transitions. [2023-11-06 23:03:32,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 384 flow [2023-11-06 23:03:32,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:32,766 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 194 flow [2023-11-06 23:03:32,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=194, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-11-06 23:03:32,768 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-11-06 23:03:32,769 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 194 flow [2023-11-06 23:03:32,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:32,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:32,770 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:32,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:03:32,775 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:32,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1245356513, now seen corresponding path program 1 times [2023-11-06 23:03:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:32,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134162411] [2023-11-06 23:03:32,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:32,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:32,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:33,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:03:33,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:33,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134162411] [2023-11-06 23:03:33,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134162411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:33,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:33,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471916171] [2023-11-06 23:03:33,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:33,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:33,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:33,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:33,804 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 291 [2023-11-06 23:03:33,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 194 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 23:03:33,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:33,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 291 [2023-11-06 23:03:33,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:35,304 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,305 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,305 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,305 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,305 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,306 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,306 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,306 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,307 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 23:03:35,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,575 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,575 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,575 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,575 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,576 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,576 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,576 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,577 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,757 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,758 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,758 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,758 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,758 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 123#L822true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,759 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,760 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,760 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,761 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,762 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:35,764 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,765 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,765 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:35,768 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 23:03:36,017 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,018 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,018 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 123#L822true, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,019 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,019 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,019 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,020 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 31#L838true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,021 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,021 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,021 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,021 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,022 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,022 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,022 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,022 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,023 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [P0Thread1of1ForFork2InUse, 111#L19-1true, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 92#P0EXITtrue, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,039 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,040 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,040 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,040 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), 109#$Ultimate##0true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 92#P0EXITtrue, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,041 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,041 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,041 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,041 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:36,273 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][49], [111#L19-1true, P0Thread1of1ForFork2InUse, 170#true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 31#L838true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,274 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,274 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,274 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,275 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,275 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, 170#true, 110#L845true, 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, 58#L792true, P3Thread1of1ForFork1InUse, 163#true, 92#P0EXITtrue, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:36,276 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,276 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:36,703 INFO L124 PetriNetUnfolderBase]: 12157/17492 cut-off events. [2023-11-06 23:03:36,703 INFO L125 PetriNetUnfolderBase]: For 10551/11048 co-relation queries the response was YES. [2023-11-06 23:03:36,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44981 conditions, 17492 events. 12157/17492 cut-off events. For 10551/11048 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 106390 event pairs, 3250 based on Foata normal form. 872/17747 useless extension candidates. Maximal degree in co-relation 44974. Up to 15269 conditions per place. [2023-11-06 23:03:36,841 INFO L140 encePairwiseOnDemand]: 286/291 looper letters, 42 selfloop transitions, 4 changer transitions 7/61 dead transitions. [2023-11-06 23:03:36,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 334 flow [2023-11-06 23:03:36,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 733 transitions. [2023-11-06 23:03:36,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4198167239404353 [2023-11-06 23:03:36,846 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 733 transitions. [2023-11-06 23:03:36,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 733 transitions. [2023-11-06 23:03:36,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:36,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 733 transitions. [2023-11-06 23:03:36,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,857 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:36,857 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 194 flow. Second operand 6 states and 733 transitions. [2023-11-06 23:03:36,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 334 flow [2023-11-06 23:03:36,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 61 transitions, 334 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:36,892 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 142 flow [2023-11-06 23:03:36,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2023-11-06 23:03:36,895 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -1 predicate places. [2023-11-06 23:03:36,895 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 142 flow [2023-11-06 23:03:36,896 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 23:03:36,896 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:36,896 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:36,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:03:36,897 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:36,897 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:36,898 INFO L85 PathProgramCache]: Analyzing trace with hash -37190235, now seen corresponding path program 1 times [2023-11-06 23:03:36,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:36,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303787691] [2023-11-06 23:03:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:36,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:37,174 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 23:03:37,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:37,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303787691] [2023-11-06 23:03:37,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303787691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:37,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551419759] [2023-11-06 23:03:37,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:37,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:37,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:37,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:37,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-06 23:03:37,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:37,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:37,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-06 23:03:37,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:40,049 INFO L124 PetriNetUnfolderBase]: 14489/19886 cut-off events. [2023-11-06 23:03:40,050 INFO L125 PetriNetUnfolderBase]: For 12217/12217 co-relation queries the response was YES. [2023-11-06 23:03:40,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52609 conditions, 19886 events. 14489/19886 cut-off events. For 12217/12217 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 103135 event pairs, 3175 based on Foata normal form. 928/20814 useless extension candidates. Maximal degree in co-relation 52601. Up to 8721 conditions per place. [2023-11-06 23:03:40,203 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 54 selfloop transitions, 7 changer transitions 44/105 dead transitions. [2023-11-06 23:03:40,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 584 flow [2023-11-06 23:03:40,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:40,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-11-06 23:03:40,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4644084437898871 [2023-11-06 23:03:40,212 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-11-06 23:03:40,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-11-06 23:03:40,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:40,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-11-06 23:03:40,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,229 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,229 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 142 flow. Second operand 7 states and 946 transitions. [2023-11-06 23:03:40,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 584 flow [2023-11-06 23:03:40,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 105 transitions, 535 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-06 23:03:40,364 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 179 flow [2023-11-06 23:03:40,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2023-11-06 23:03:40,365 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2023-11-06 23:03:40,366 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 179 flow [2023-11-06 23:03:40,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:40,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:40,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:03:40,367 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:40,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1153001047, now seen corresponding path program 1 times [2023-11-06 23:03:40,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387980650] [2023-11-06 23:03:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:40,598 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 23:03:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:40,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387980650] [2023-11-06 23:03:40,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387980650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:40,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038566594] [2023-11-06 23:03:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:40,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:40,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:40,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-06 23:03:40,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:40,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:40,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-06 23:03:40,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:41,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 90#L873-1true, 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,678 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-06 23:03:41,679 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:41,679 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:41,679 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 23:03:41,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 90#L873-1true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,776 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,776 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,776 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,776 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,778 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,778 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,778 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,778 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [111#L19-1true, P0Thread1of1ForFork2InUse, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 39#L770true, 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 204#true, 163#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,779 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,779 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,779 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,779 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 23:03:41,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([460] L838-->L845: Formula: (let ((.cse5 (not (= (mod v_~x$r_buff0_thd4~0_28 256) 0))) (.cse3 (not (= (mod v_~x$w_buff0_used~0_115 256) 0))) (.cse4 (not (= (mod v_~x$r_buff1_thd4~0_24 256) 0)))) (let ((.cse2 (and .cse4 (not (= (mod v_~x$w_buff1_used~0_105 256) 0)))) (.cse0 (and .cse5 .cse3)) (.cse1 (and .cse5 (not (= (mod v_~x$w_buff0_used~0_116 256) 0))))) (and (= (ite .cse0 0 v_~x$r_buff0_thd4~0_28) v_~x$r_buff0_thd4~0_27) (= (ite .cse1 v_~x$w_buff0~0_39 (ite .cse2 v_~x$w_buff1~0_38 v_~x~0_55)) v_~x~0_54) (= v_~x$w_buff1_used~0_104 (ite (or .cse2 .cse0) 0 v_~x$w_buff1_used~0_105)) (= v_~x$r_buff1_thd4~0_23 (ite (or (and .cse3 (not (= (mod v_~x$r_buff0_thd4~0_27 256) 0))) (and .cse4 (not (= (mod v_~x$w_buff1_used~0_104 256) 0)))) 0 v_~x$r_buff1_thd4~0_24)) (= (ite .cse1 0 v_~x$w_buff0_used~0_116) v_~x$w_buff0_used~0_115)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_105, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_28, ~x~0=v_~x~0_55, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_24, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_116} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_39, ~x$w_buff1~0=v_~x$w_buff1~0_38, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_104, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_27, ~x~0=v_~x~0_54, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_23, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_115} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][51], [P0Thread1of1ForFork2InUse, 42#L880true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), 110#L845true, Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,893 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,893 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,893 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,893 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,893 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([567] L880-->L19-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|) (= (mod v_~main$tmp_guard1~0_8 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|) (= v_~main$tmp_guard1~0_8 (ite (= (ite (not (and (= 0 v_~__unbuffered_p3_EBX~0_10) (= v_~z~0_14 2) (= 2 v_~__unbuffered_p3_EAX~0_10) (= v_~__unbuffered_p1_EAX~0_10 0) (= v_~__unbuffered_p0_EAX~0_16 0))) 1 0) 0) 0 1))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_30|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_12|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z~0=v_~z~0_14, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~main$tmp_guard1~0][54], [P0Thread1of1ForFork2InUse, 111#L19-1true, Black: 194#(and (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0))), Black: 190#(= ~__unbuffered_p3_EAX~0 0), Black: 192#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), Black: 191#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), 186#(and (not (= |ULTIMATE.start_main_~#t686~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t685~0#1.base|)) (not (= |ULTIMATE.start_main_~#t688~0#1.base| |ULTIMATE.start_main_~#t687~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t685~0#1.base| 0) |ULTIMATE.start_main_~#t687~0#1.base| 0) |ULTIMATE.start_main_~#t686~0#1.base| 0) |ULTIMATE.start_main_~#t688~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t687~0#1.base| |ULTIMATE.start_main_~#t686~0#1.base|))), Black: 196#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), 38#L795true, Black: 172#(or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))), Black: 175#(and (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)))), Black: 173#(or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)), 76#P2EXITtrue, 31#L838true, P1Thread1of1ForFork0InUse, P3Thread1of1ForFork1InUse, 188#true, 163#true, 92#P0EXITtrue, 204#true, P2Thread1of1ForFork3InUse]) [2023-11-06 23:03:41,894 INFO L294 olderBase$Statistics]: this new event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,894 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,894 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:41,894 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 23:03:42,004 INFO L124 PetriNetUnfolderBase]: 5846/8624 cut-off events. [2023-11-06 23:03:42,004 INFO L125 PetriNetUnfolderBase]: For 7424/7794 co-relation queries the response was YES. [2023-11-06 23:03:42,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22669 conditions, 8624 events. 5846/8624 cut-off events. For 7424/7794 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 49250 event pairs, 1389 based on Foata normal form. 280/8619 useless extension candidates. Maximal degree in co-relation 22657. Up to 7271 conditions per place. [2023-11-06 23:03:42,086 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 43 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-11-06 23:03:42,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 58 transitions, 346 flow [2023-11-06 23:03:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-11-06 23:03:42,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4959908361970218 [2023-11-06 23:03:42,090 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-11-06 23:03:42,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-11-06 23:03:42,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:42,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-11-06 23:03:42,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,095 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 179 flow. Second operand 3 states and 433 transitions. [2023-11-06 23:03:42,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 58 transitions, 346 flow [2023-11-06 23:03:42,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 58 transitions, 335 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:42,140 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 201 flow [2023-11-06 23:03:42,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=201, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-11-06 23:03:42,141 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-06 23:03:42,141 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 201 flow [2023-11-06 23:03:42,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:42,142 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:42,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:03:42,143 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:42,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash 827802098, now seen corresponding path program 1 times [2023-11-06 23:03:42,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:42,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621445882] [2023-11-06 23:03:42,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:42,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:42,310 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 23:03:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621445882] [2023-11-06 23:03:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621445882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:42,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:42,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:03:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677083895] [2023-11-06 23:03:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:42,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:42,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:42,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:42,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-06 23:03:42,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:42,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-06 23:03:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:42,920 INFO L124 PetriNetUnfolderBase]: 2913/4604 cut-off events. [2023-11-06 23:03:42,921 INFO L125 PetriNetUnfolderBase]: For 2836/2948 co-relation queries the response was YES. [2023-11-06 23:03:42,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13495 conditions, 4604 events. 2913/4604 cut-off events. For 2836/2948 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 25812 event pairs, 589 based on Foata normal form. 304/4802 useless extension candidates. Maximal degree in co-relation 13483. Up to 2234 conditions per place. [2023-11-06 23:03:42,956 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 58 selfloop transitions, 9 changer transitions 0/77 dead transitions. [2023-11-06 23:03:42,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 77 transitions, 471 flow [2023-11-06 23:03:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:42,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-11-06 23:03:42,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49742268041237114 [2023-11-06 23:03:42,960 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-11-06 23:03:42,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-11-06 23:03:42,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:42,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-11-06 23:03:42,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 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 23:03:42,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,967 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,967 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 201 flow. Second operand 4 states and 579 transitions. [2023-11-06 23:03:42,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 77 transitions, 471 flow [2023-11-06 23:03:42,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 77 transitions, 456 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:42,979 INFO L231 Difference]: Finished difference. Result has 53 places, 45 transitions, 242 flow [2023-11-06 23:03:42,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, 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=4, PETRI_FLOW=242, PETRI_PLACES=53, PETRI_TRANSITIONS=45} [2023-11-06 23:03:42,980 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-11-06 23:03:42,980 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 45 transitions, 242 flow [2023-11-06 23:03:42,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:42,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:42,981 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] [2023-11-06 23:03:42,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:03:42,982 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:42,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:42,982 INFO L85 PathProgramCache]: Analyzing trace with hash 408037007, now seen corresponding path program 1 times [2023-11-06 23:03:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148672093] [2023-11-06 23:03:42,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:42,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:43,238 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 23:03:43,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:43,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148672093] [2023-11-06 23:03:43,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148672093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:43,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:43,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:43,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971202129] [2023-11-06 23:03:43,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:43,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:43,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:43,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:43,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:43,286 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-11-06 23:03:43,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 45 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:43,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:43,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-11-06 23:03:43,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:44,477 INFO L124 PetriNetUnfolderBase]: 4764/7245 cut-off events. [2023-11-06 23:03:44,477 INFO L125 PetriNetUnfolderBase]: For 9914/9914 co-relation queries the response was YES. [2023-11-06 23:03:44,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24547 conditions, 7245 events. 4764/7245 cut-off events. For 9914/9914 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 39307 event pairs, 515 based on Foata normal form. 129/7374 useless extension candidates. Maximal degree in co-relation 24536. Up to 3346 conditions per place. [2023-11-06 23:03:44,523 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 111 selfloop transitions, 21 changer transitions 27/159 dead transitions. [2023-11-06 23:03:44,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 159 transitions, 1113 flow [2023-11-06 23:03:44,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:44,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2023-11-06 23:03:44,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693176239567992 [2023-11-06 23:03:44,528 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2023-11-06 23:03:44,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2023-11-06 23:03:44,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:44,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2023-11-06 23:03:44,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.57142857142858) internal successors, (956), 7 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,538 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,538 INFO L175 Difference]: Start difference. First operand has 53 places, 45 transitions, 242 flow. Second operand 7 states and 956 transitions. [2023-11-06 23:03:44,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 159 transitions, 1113 flow [2023-11-06 23:03:44,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 159 transitions, 1055 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:44,562 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 394 flow [2023-11-06 23:03:44,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=394, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2023-11-06 23:03:44,563 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 10 predicate places. [2023-11-06 23:03:44,563 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 394 flow [2023-11-06 23:03:44,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:44,564 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] [2023-11-06 23:03:44,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:03:44,564 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:44,565 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:44,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1719952025, now seen corresponding path program 2 times [2023-11-06 23:03:44,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:44,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896001821] [2023-11-06 23:03:44,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:44,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:44,809 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 23:03:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:44,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896001821] [2023-11-06 23:03:44,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896001821] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:44,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:44,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:44,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535836275] [2023-11-06 23:03:44,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:44,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:44,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:44,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:44,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:44,867 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 291 [2023-11-06 23:03:44,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 394 flow. Second operand has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:44,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:44,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 291 [2023-11-06 23:03:44,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:46,335 INFO L124 PetriNetUnfolderBase]: 5766/8800 cut-off events. [2023-11-06 23:03:46,335 INFO L125 PetriNetUnfolderBase]: For 20690/20690 co-relation queries the response was YES. [2023-11-06 23:03:46,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33014 conditions, 8800 events. 5766/8800 cut-off events. For 20690/20690 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 49637 event pairs, 707 based on Foata normal form. 90/8890 useless extension candidates. Maximal degree in co-relation 32998. Up to 3174 conditions per place. [2023-11-06 23:03:46,395 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 122 selfloop transitions, 20 changer transitions 30/172 dead transitions. [2023-11-06 23:03:46,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 172 transitions, 1308 flow [2023-11-06 23:03:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:46,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:46,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 958 transitions. [2023-11-06 23:03:46,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47029945999018163 [2023-11-06 23:03:46,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 958 transitions. [2023-11-06 23:03:46,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 958 transitions. [2023-11-06 23:03:46,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:46,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 958 transitions. [2023-11-06 23:03:46,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.85714285714286) internal successors, (958), 7 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,411 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,411 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 394 flow. Second operand 7 states and 958 transitions. [2023-11-06 23:03:46,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 172 transitions, 1308 flow [2023-11-06 23:03:46,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 172 transitions, 1274 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:46,526 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 432 flow [2023-11-06 23:03:46,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=432, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-11-06 23:03:46,527 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 14 predicate places. [2023-11-06 23:03:46,527 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 432 flow [2023-11-06 23:03:46,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.33333333333333) internal successors, (734), 6 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:46,528 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] [2023-11-06 23:03:46,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:03:46,529 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:46,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:46,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1990863497, now seen corresponding path program 3 times [2023-11-06 23:03:46,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:46,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609197673] [2023-11-06 23:03:46,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:46,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:46,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:46,737 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 23:03:46,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:46,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609197673] [2023-11-06 23:03:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609197673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:46,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:46,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:46,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411372759] [2023-11-06 23:03:46,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:46,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:46,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:46,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-06 23:03:46,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:46,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:46,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-06 23:03:46,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:47,654 INFO L124 PetriNetUnfolderBase]: 2990/4790 cut-off events. [2023-11-06 23:03:47,654 INFO L125 PetriNetUnfolderBase]: For 9519/9628 co-relation queries the response was YES. [2023-11-06 23:03:47,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 4790 events. 2990/4790 cut-off events. For 9519/9628 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 28066 event pairs, 559 based on Foata normal form. 298/4987 useless extension candidates. Maximal degree in co-relation 16525. Up to 1768 conditions per place. [2023-11-06 23:03:47,693 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 79 selfloop transitions, 13 changer transitions 2/113 dead transitions. [2023-11-06 23:03:47,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 113 transitions, 944 flow [2023-11-06 23:03:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:47,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-11-06 23:03:47,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49690721649484537 [2023-11-06 23:03:47,697 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-11-06 23:03:47,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-11-06 23:03:47,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:47,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-11-06 23:03:47,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,704 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,704 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 432 flow. Second operand 5 states and 723 transitions. [2023-11-06 23:03:47,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 113 transitions, 944 flow [2023-11-06 23:03:47,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 113 transitions, 872 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-06 23:03:47,728 INFO L231 Difference]: Finished difference. Result has 65 places, 61 transitions, 457 flow [2023-11-06 23:03:47,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=457, PETRI_PLACES=65, PETRI_TRANSITIONS=61} [2023-11-06 23:03:47,729 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 13 predicate places. [2023-11-06 23:03:47,729 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 61 transitions, 457 flow [2023-11-06 23:03:47,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:47,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:47,730 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, 1, 1] [2023-11-06 23:03:47,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:03:47,731 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:47,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash -650373562, now seen corresponding path program 1 times [2023-11-06 23:03:47,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:47,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275586615] [2023-11-06 23:03:47,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,983 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 23:03:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275586615] [2023-11-06 23:03:47,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275586615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794107320] [2023-11-06 23:03:47,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:47,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:48,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-06 23:03:48,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 61 transitions, 457 flow. Second operand has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:48,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:48,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-06 23:03:48,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:49,075 INFO L124 PetriNetUnfolderBase]: 4931/7587 cut-off events. [2023-11-06 23:03:49,075 INFO L125 PetriNetUnfolderBase]: For 21051/21051 co-relation queries the response was YES. [2023-11-06 23:03:49,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29796 conditions, 7587 events. 4931/7587 cut-off events. For 21051/21051 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 42447 event pairs, 1151 based on Foata normal form. 16/7603 useless extension candidates. Maximal degree in co-relation 29780. Up to 4138 conditions per place. [2023-11-06 23:03:49,116 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 73 selfloop transitions, 12 changer transitions 37/122 dead transitions. [2023-11-06 23:03:49,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1089 flow [2023-11-06 23:03:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:49,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:49,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2023-11-06 23:03:49,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-11-06 23:03:49,119 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 679 transitions. [2023-11-06 23:03:49,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 679 transitions. [2023-11-06 23:03:49,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:49,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 679 transitions. [2023-11-06 23:03:49,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,126 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,126 INFO L175 Difference]: Start difference. First operand has 65 places, 61 transitions, 457 flow. Second operand 5 states and 679 transitions. [2023-11-06 23:03:49,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1089 flow [2023-11-06 23:03:49,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 122 transitions, 1023 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:49,305 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 398 flow [2023-11-06 23:03:49,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=398, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-11-06 23:03:49,307 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 17 predicate places. [2023-11-06 23:03:49,307 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 398 flow [2023-11-06 23:03:49,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.8) internal successors, (629), 5 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:49,308 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, 1, 1] [2023-11-06 23:03:49,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:03:49,308 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:49,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1904930227, now seen corresponding path program 1 times [2023-11-06 23:03:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:49,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580534789] [2023-11-06 23:03:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,828 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 23:03:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580534789] [2023-11-06 23:03:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580534789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916453979] [2023-11-06 23:03:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:49,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:49,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:49,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-06 23:03:49,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 398 flow. Second operand has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:49,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-06 23:03:49,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:51,349 INFO L124 PetriNetUnfolderBase]: 4229/7193 cut-off events. [2023-11-06 23:03:51,350 INFO L125 PetriNetUnfolderBase]: For 13997/14172 co-relation queries the response was YES. [2023-11-06 23:03:51,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25509 conditions, 7193 events. 4229/7193 cut-off events. For 13997/14172 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 49031 event pairs, 938 based on Foata normal form. 49/7048 useless extension candidates. Maximal degree in co-relation 25490. Up to 3814 conditions per place. [2023-11-06 23:03:51,418 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 95 selfloop transitions, 11 changer transitions 64/182 dead transitions. [2023-11-06 23:03:51,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 182 transitions, 1485 flow [2023-11-06 23:03:51,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:03:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:03:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 977 transitions. [2023-11-06 23:03:51,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4796269023073147 [2023-11-06 23:03:51,423 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 977 transitions. [2023-11-06 23:03:51,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 977 transitions. [2023-11-06 23:03:51,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:51,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 977 transitions. [2023-11-06 23:03:51,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.57142857142858) internal successors, (977), 7 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,434 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 398 flow. Second operand 7 states and 977 transitions. [2023-11-06 23:03:51,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 182 transitions, 1485 flow [2023-11-06 23:03:51,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 182 transitions, 1440 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:51,633 INFO L231 Difference]: Finished difference. Result has 75 places, 65 transitions, 475 flow [2023-11-06 23:03:51,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=475, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2023-11-06 23:03:51,634 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-11-06 23:03:51,635 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 475 flow [2023-11-06 23:03:51,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:51,636 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, 1, 1] [2023-11-06 23:03:51,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:03:51,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:51,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1248463581, now seen corresponding path program 2 times [2023-11-06 23:03:51,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:51,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690024481] [2023-11-06 23:03:51,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:51,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:52,628 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 23:03:52,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:52,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690024481] [2023-11-06 23:03:52,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690024481] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:52,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:52,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627856839] [2023-11-06 23:03:52,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:52,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:52,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:52,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:52,740 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2023-11-06 23:03:52,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 475 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:52,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:52,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2023-11-06 23:03:52,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:54,706 INFO L124 PetriNetUnfolderBase]: 5544/8946 cut-off events. [2023-11-06 23:03:54,706 INFO L125 PetriNetUnfolderBase]: For 24130/24130 co-relation queries the response was YES. [2023-11-06 23:03:54,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36839 conditions, 8946 events. 5544/8946 cut-off events. For 24130/24130 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 56722 event pairs, 579 based on Foata normal form. 11/8957 useless extension candidates. Maximal degree in co-relation 36817. Up to 2559 conditions per place. [2023-11-06 23:03:54,771 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 137 selfloop transitions, 43 changer transitions 53/233 dead transitions. [2023-11-06 23:03:54,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 233 transitions, 1983 flow [2023-11-06 23:03:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:03:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:03:54,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1179 transitions. [2023-11-06 23:03:54,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45017182130584193 [2023-11-06 23:03:54,777 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1179 transitions. [2023-11-06 23:03:54,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1179 transitions. [2023-11-06 23:03:54,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:54,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1179 transitions. [2023-11-06 23:03:54,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.0) internal successors, (1179), 9 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,787 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,788 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 475 flow. Second operand 9 states and 1179 transitions. [2023-11-06 23:03:54,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 233 transitions, 1983 flow [2023-11-06 23:03:55,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 233 transitions, 1936 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 23:03:55,096 INFO L231 Difference]: Finished difference. Result has 83 places, 88 transitions, 784 flow [2023-11-06 23:03:55,097 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=784, PETRI_PLACES=83, PETRI_TRANSITIONS=88} [2023-11-06 23:03:55,098 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-11-06 23:03:55,098 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 88 transitions, 784 flow [2023-11-06 23:03:55,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:55,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:55,099 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, 1, 1] [2023-11-06 23:03:55,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:03:55,099 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:55,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:55,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1709957279, now seen corresponding path program 3 times [2023-11-06 23:03:55,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:55,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479918897] [2023-11-06 23:03:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:55,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:55,324 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 23:03:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479918897] [2023-11-06 23:03:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479918897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:55,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:55,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540950775] [2023-11-06 23:03:55,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:55,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:03:55,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:55,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:03:55,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:03:55,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 291 [2023-11-06 23:03:55,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 88 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:55,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:55,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 291 [2023-11-06 23:03:55,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:56,397 INFO L124 PetriNetUnfolderBase]: 3479/5807 cut-off events. [2023-11-06 23:03:56,398 INFO L125 PetriNetUnfolderBase]: For 20290/20621 co-relation queries the response was YES. [2023-11-06 23:03:56,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25530 conditions, 5807 events. 3479/5807 cut-off events. For 20290/20621 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 38474 event pairs, 356 based on Foata normal form. 182/5838 useless extension candidates. Maximal degree in co-relation 25503. Up to 2293 conditions per place. [2023-11-06 23:03:56,435 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 93 selfloop transitions, 17 changer transitions 58/177 dead transitions. [2023-11-06 23:03:56,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 177 transitions, 1812 flow [2023-11-06 23:03:56,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:03:56,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:03:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 853 transitions. [2023-11-06 23:03:56,438 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.488545246277205 [2023-11-06 23:03:56,439 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 853 transitions. [2023-11-06 23:03:56,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 853 transitions. [2023-11-06 23:03:56,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:56,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 853 transitions. [2023-11-06 23:03:56,442 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.16666666666666) internal successors, (853), 6 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,446 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 291.0) internal successors, (2037), 7 states have internal predecessors, (2037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,447 INFO L175 Difference]: Start difference. First operand has 83 places, 88 transitions, 784 flow. Second operand 6 states and 853 transitions. [2023-11-06 23:03:56,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 177 transitions, 1812 flow [2023-11-06 23:03:56,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 177 transitions, 1737 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-11-06 23:03:56,718 INFO L231 Difference]: Finished difference. Result has 83 places, 64 transitions, 498 flow [2023-11-06 23:03:56,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=83, PETRI_TRANSITIONS=64} [2023-11-06 23:03:56,719 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-11-06 23:03:56,719 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 64 transitions, 498 flow [2023-11-06 23:03:56,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:56,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:56,720 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:56,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:03:56,720 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:56,720 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:56,720 INFO L85 PathProgramCache]: Analyzing trace with hash -686855442, now seen corresponding path program 1 times [2023-11-06 23:03:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756725694] [2023-11-06 23:03:56,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:57,611 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 23:03:57,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:57,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756725694] [2023-11-06 23:03:57,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756725694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:57,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:57,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:03:57,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824172157] [2023-11-06 23:03:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:57,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:03:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:57,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:03:57,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:03:57,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 291 [2023-11-06 23:03:57,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 64 transitions, 498 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:57,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:57,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 291 [2023-11-06 23:03:57,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:58,455 INFO L124 PetriNetUnfolderBase]: 1476/2527 cut-off events. [2023-11-06 23:03:58,456 INFO L125 PetriNetUnfolderBase]: For 9522/9620 co-relation queries the response was YES. [2023-11-06 23:03:58,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11971 conditions, 2527 events. 1476/2527 cut-off events. For 9522/9620 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 14021 event pairs, 130 based on Foata normal form. 30/2518 useless extension candidates. Maximal degree in co-relation 11947. Up to 1084 conditions per place. [2023-11-06 23:03:58,481 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 91 selfloop transitions, 14 changer transitions 42/156 dead transitions. [2023-11-06 23:03:58,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 156 transitions, 1485 flow [2023-11-06 23:03:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:03:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:03:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1072 transitions. [2023-11-06 23:03:58,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46048109965635736 [2023-11-06 23:03:58,485 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1072 transitions. [2023-11-06 23:03:58,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1072 transitions. [2023-11-06 23:03:58,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:58,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1072 transitions. [2023-11-06 23:03:58,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.0) internal successors, (1072), 8 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,538 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 291.0) internal successors, (2619), 9 states have internal predecessors, (2619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,538 INFO L175 Difference]: Start difference. First operand has 83 places, 64 transitions, 498 flow. Second operand 8 states and 1072 transitions. [2023-11-06 23:03:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 156 transitions, 1485 flow [2023-11-06 23:03:58,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 1205 flow, removed 67 selfloop flow, removed 10 redundant places. [2023-11-06 23:03:58,584 INFO L231 Difference]: Finished difference. Result has 82 places, 70 transitions, 495 flow [2023-11-06 23:03:58,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=495, PETRI_PLACES=82, PETRI_TRANSITIONS=70} [2023-11-06 23:03:58,584 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 30 predicate places. [2023-11-06 23:03:58,585 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 70 transitions, 495 flow [2023-11-06 23:03:58,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:58,586 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:58,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:03:58,586 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:58,587 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:58,587 INFO L85 PathProgramCache]: Analyzing trace with hash 513604376, now seen corresponding path program 2 times [2023-11-06 23:03:58,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:58,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231437219] [2023-11-06 23:03:58,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:58,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:58,852 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 23:03:58,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231437219] [2023-11-06 23:03:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231437219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:58,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:58,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:03:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831168004] [2023-11-06 23:03:58,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:58,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:03:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:03:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:03:58,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 291 [2023-11-06 23:03:58,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 70 transitions, 495 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:58,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:58,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 291 [2023-11-06 23:03:58,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:59,421 INFO L124 PetriNetUnfolderBase]: 1851/3117 cut-off events. [2023-11-06 23:03:59,421 INFO L125 PetriNetUnfolderBase]: For 10609/10638 co-relation queries the response was YES. [2023-11-06 23:03:59,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13841 conditions, 3117 events. 1851/3117 cut-off events. For 10609/10638 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 17350 event pairs, 394 based on Foata normal form. 4/3102 useless extension candidates. Maximal degree in co-relation 13816. Up to 1895 conditions per place. [2023-11-06 23:03:59,445 INFO L140 encePairwiseOnDemand]: 287/291 looper letters, 56 selfloop transitions, 1 changer transitions 64/125 dead transitions. [2023-11-06 23:03:59,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 125 transitions, 1139 flow [2023-11-06 23:03:59,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:03:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:03:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-11-06 23:03:59,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47079037800687284 [2023-11-06 23:03:59,448 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-11-06 23:03:59,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-11-06 23:03:59,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:59,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-11-06 23:03:59,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:59,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:59,458 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:59,458 INFO L175 Difference]: Start difference. First operand has 82 places, 70 transitions, 495 flow. Second operand 5 states and 685 transitions. [2023-11-06 23:03:59,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 125 transitions, 1139 flow [2023-11-06 23:03:59,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 125 transitions, 1100 flow, removed 13 selfloop flow, removed 6 redundant places. [2023-11-06 23:03:59,525 INFO L231 Difference]: Finished difference. Result has 80 places, 57 transitions, 386 flow [2023-11-06 23:03:59,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=386, PETRI_PLACES=80, PETRI_TRANSITIONS=57} [2023-11-06 23:03:59,526 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-11-06 23:03:59,526 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 57 transitions, 386 flow [2023-11-06 23:03:59,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:59,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:59,526 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:59,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:03:59,527 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:59,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:59,527 INFO L85 PathProgramCache]: Analyzing trace with hash -2108894624, now seen corresponding path program 3 times [2023-11-06 23:03:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838697944] [2023-11-06 23:03:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:00,972 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 23:04:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838697944] [2023-11-06 23:04:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838697944] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:00,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 23:04:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451164013] [2023-11-06 23:04:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:00,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 23:04:00,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 23:04:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 23:04:01,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2023-11-06 23:04:01,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 57 transitions, 386 flow. Second operand has 9 states, 9 states have (on average 119.11111111111111) internal successors, (1072), 9 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:01,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:01,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2023-11-06 23:04:01,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:01,920 INFO L124 PetriNetUnfolderBase]: 612/1050 cut-off events. [2023-11-06 23:04:01,920 INFO L125 PetriNetUnfolderBase]: For 2782/2782 co-relation queries the response was YES. [2023-11-06 23:04:01,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4473 conditions, 1050 events. 612/1050 cut-off events. For 2782/2782 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4450 event pairs, 77 based on Foata normal form. 1/1051 useless extension candidates. Maximal degree in co-relation 4450. Up to 473 conditions per place. [2023-11-06 23:04:01,925 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 81 selfloop transitions, 12 changer transitions 40/133 dead transitions. [2023-11-06 23:04:01,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 133 transitions, 1066 flow [2023-11-06 23:04:01,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:04:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1128 transitions. [2023-11-06 23:04:01,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306987399770905 [2023-11-06 23:04:01,930 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1128 transitions. [2023-11-06 23:04:01,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1128 transitions. [2023-11-06 23:04:01,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:01,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1128 transitions. [2023-11-06 23:04:01,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.33333333333333) internal successors, (1128), 9 states have internal predecessors, (1128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:01,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:01,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 291.0) internal successors, (2910), 10 states have internal predecessors, (2910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:01,939 INFO L175 Difference]: Start difference. First operand has 80 places, 57 transitions, 386 flow. Second operand 9 states and 1128 transitions. [2023-11-06 23:04:01,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 133 transitions, 1066 flow [2023-11-06 23:04:01,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 133 transitions, 1018 flow, removed 12 selfloop flow, removed 7 redundant places. [2023-11-06 23:04:01,954 INFO L231 Difference]: Finished difference. Result has 83 places, 51 transitions, 340 flow [2023-11-06 23:04:01,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=340, PETRI_PLACES=83, PETRI_TRANSITIONS=51} [2023-11-06 23:04:01,955 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-11-06 23:04:01,956 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 51 transitions, 340 flow [2023-11-06 23:04:01,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.11111111111111) internal successors, (1072), 9 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:01,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:01,956 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, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:01,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:04:01,957 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:01,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash 894423900, now seen corresponding path program 4 times [2023-11-06 23:04:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:01,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095744862] [2023-11-06 23:04:01,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:01,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:02,031 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:04:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:02,155 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:04:02,156 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:04:02,157 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 23:04:02,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 23:04:02,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 23:04:02,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 23:04:02,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 23:04:02,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 23:04:02,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 23:04:02,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 23:04:02,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 23:04:02,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 23:04:02,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 23:04:02,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:04:02,162 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:02,168 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:04:02,168 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:02,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:02 BasicIcfg [2023-11-06 23:04:02,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:02,297 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:02,297 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:02,298 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:02,298 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:17" (3/4) ... [2023-11-06 23:04:02,300 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:04:02,301 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:02,302 INFO L158 Benchmark]: Toolchain (without parser) took 46701.95ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 133.6MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 23:04:02,302 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 92.3MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:02,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 651.88ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 109.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:02,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.13ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:02,304 INFO L158 Benchmark]: Boogie Preprocessor took 62.95ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:02,304 INFO L158 Benchmark]: RCFGBuilder took 965.88ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 130.7MB in the end (delta: -25.9MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2023-11-06 23:04:02,304 INFO L158 Benchmark]: TraceAbstraction took 44898.59ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 129.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-06 23:04:02,305 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 4.2GB. Free memory was 3.0GB in the beginning and 3.0GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:02,308 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.30ms. Allocated memory is still 119.5MB. Free memory was 92.5MB in the beginning and 92.3MB in the end (delta: 151.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 651.88ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 109.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.13ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.95ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 965.88ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 130.7MB in the end (delta: -25.9MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * TraceAbstraction took 44898.59ms. Allocated memory was 167.8MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 129.7MB in the beginning and 3.0GB in the end (delta: -2.9GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 4.2GB. Free memory was 3.0GB in the beginning and 3.0GB 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: 6.0s, 156 PlacesBefore, 52 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 3860 CoEnabledTransitionPairs, 7 FixpointIterations, 49 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 9954 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4571, independent: 4344, independent conditional: 0, independent unconditional: 4344, dependent: 227, dependent conditional: 0, dependent unconditional: 227, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2053, independent: 2015, independent conditional: 0, independent unconditional: 2015, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4571, independent: 2329, independent conditional: 0, independent unconditional: 2329, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 2053, unknown conditional: 0, unknown unconditional: 2053] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 163, Positive conditional cache size: 0, Positive unconditional cache size: 163, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=-3, t685={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=-2, t685={5:0}, t686={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=-1, t685={5:0}, t686={6:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={5:0}, t686={6:0}, t687={7:0}, t688={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 863]: 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 9 procedures, 185 locations, 16 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: 44.6s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1134 mSDsluCounter, 1162 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1018 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3573 IncrementalHoareTripleChecker+Invalid, 3731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 144 mSDtfsCounter, 3573 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=13, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 342 NumberOfCodeBlocks, 342 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 297 ConstructedInterpolants, 0 QuantifiedInterpolants, 3249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 23:04:02,357 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:04:05,147 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:04:05,283 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:04:05,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:04:05,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:04:05,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:04:05,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:04:05,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:04:05,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:04:05,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:04:05,349 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:04:05,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:04:05,350 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:04:05,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:04:05,353 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:04:05,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:04:05,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:04:05,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:04:05,355 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:04:05,356 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:04:05,357 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:04:05,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:04:05,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:04:05,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:04:05,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:04:05,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:04:05,360 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:04:05,360 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:04:05,361 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:04:05,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:04:05,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:04:05,363 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:05,364 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:04:05,364 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:04:05,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:04:05,365 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:04:05,365 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:04:05,365 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:04:05,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:04:05,366 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:04:05,367 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:04:05,367 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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 -> 98d8aefe0e01e05845b14b6dd9685e093c9c5c7f8cc89a689bcb4822a773c420 [2023-11-06 23:04:05,763 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:04:05,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:04:05,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:04:05,798 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:04:05,798 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:04:05,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-06 23:04:08,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:09,269 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:09,270 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/sv-benchmarks/c/pthread-wmm/mix026_power.opt_tso.opt.i [2023-11-06 23:04:09,291 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/3557a2f8d/d7da3564f3da4d15b4b94f5d23fe7e06/FLAG9d923f6ca [2023-11-06 23:04:09,309 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/data/3557a2f8d/d7da3564f3da4d15b4b94f5d23fe7e06 [2023-11-06 23:04:09,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:09,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:09,315 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:09,315 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:09,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:09,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:09" (1/1) ... [2023-11-06 23:04:09,326 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e743225 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:09, skipping insertion in model container [2023-11-06 23:04:09,326 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:09" (1/1) ... [2023-11-06 23:04:09,407 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:09,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:09,970 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:10,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:10,147 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:04:10,147 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:04:10,155 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:10,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10 WrapperNode [2023-11-06 23:04:10,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:10,157 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:10,157 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:10,158 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:10,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,251 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 23:04:10,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:10,252 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:10,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:10,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:10,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,292 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,296 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:10,304 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:10,304 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:10,304 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:10,305 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (1/1) ... [2023-11-06 23:04:10,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:10,357 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:10,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:10,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:04:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:04:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:04:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:04:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:04:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:04:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:04:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:04:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:04:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:04:10,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:04:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:04:10,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:04:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:04:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:10,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:10,410 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 23:04:10,568 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:10,570 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:11,053 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:11,225 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:11,225 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:04:11,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:11 BoogieIcfgContainer [2023-11-06 23:04:11,229 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:11,231 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:11,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:11,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:11,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:09" (1/3) ... [2023-11-06 23:04:11,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76be03cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:11, skipping insertion in model container [2023-11-06 23:04:11,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:10" (2/3) ... [2023-11-06 23:04:11,239 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76be03cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:11, skipping insertion in model container [2023-11-06 23:04:11,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:11" (3/3) ... [2023-11-06 23:04:11,242 INFO L112 eAbstractionObserver]: Analyzing ICFG mix026_power.opt_tso.opt.i [2023-11-06 23:04:11,260 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:11,260 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 23:04:11,260 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:04:11,346 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:04:11,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 23:04:11,521 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 23:04:11,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:11,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 23:04:11,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 23:04:11,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 23:04:11,543 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:04:11,559 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 23:04:11,562 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 23:04:11,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 23:04:11,597 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 23:04:11,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:11,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 105. Up to 2 conditions per place. [2023-11-06 23:04:11,603 INFO L119 LiptonReduction]: Number of co-enabled transitions 3860 [2023-11-06 23:04:21,885 INFO L134 LiptonReduction]: Checked pairs total: 9945 [2023-11-06 23:04:21,886 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-11-06 23:04:21,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:21,909 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;@3c9c0826, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:21,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 23:04:21,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:04:21,911 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:04:21,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:21,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:21,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:04:21,913 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:21,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 645, now seen corresponding path program 1 times [2023-11-06 23:04:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:21,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1042793214] [2023-11-06 23:04:21,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:21,935 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 23:04:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:21,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:21,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:22,060 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:04:22,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:22,068 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 23:04:22,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:22,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:22,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1042793214] [2023-11-06 23:04:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1042793214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:22,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:04:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296873279] [2023-11-06 23:04:22,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:22,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:04:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:22,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:04:22,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:22,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 294 [2023-11-06 23:04:22,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:22,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:22,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 294 [2023-11-06 23:04:22,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:23,762 INFO L124 PetriNetUnfolderBase]: 5973/8500 cut-off events. [2023-11-06 23:04:23,762 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-06 23:04:23,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16818 conditions, 8500 events. 5973/8500 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 46497 event pairs, 5973 based on Foata normal form. 0/7575 useless extension candidates. Maximal degree in co-relation 16806. Up to 8103 conditions per place. [2023-11-06 23:04:23,842 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 26 selfloop transitions, 0 changer transitions 0/31 dead transitions. [2023-11-06 23:04:23,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 126 flow [2023-11-06 23:04:23,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:04:23,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:04:23,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 23:04:23,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221088435374149 [2023-11-06 23:04:23,865 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 23:04:23,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 23:04:23,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:23,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 23:04:23,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:23,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:23,884 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:23,886 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 2 states and 307 transitions. [2023-11-06 23:04:23,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 126 flow [2023-11-06 23:04:23,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 31 transitions, 122 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:04:23,896 INFO L231 Difference]: Finished difference. Result has 41 places, 31 transitions, 70 flow [2023-11-06 23:04:23,898 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=70, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2023-11-06 23:04:23,902 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2023-11-06 23:04:23,903 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 70 flow [2023-11-06 23:04:23,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:23,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:23,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:04:23,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:24,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:24,115 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:24,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:24,116 INFO L85 PathProgramCache]: Analyzing trace with hash 611219654, now seen corresponding path program 1 times [2023-11-06 23:04:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1655696940] [2023-11-06 23:04:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:24,118 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 23:04:24,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:24,120 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:24,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:24,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:24,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:24,253 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 23:04:24,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:24,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:24,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1655696940] [2023-11-06 23:04:24,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1655696940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:24,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:24,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:04:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341121836] [2023-11-06 23:04:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:24,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:24,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:24,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:24,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:24,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2023-11-06 23:04:24,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:24,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:24,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2023-11-06 23:04:24,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:25,421 INFO L124 PetriNetUnfolderBase]: 4695/6904 cut-off events. [2023-11-06 23:04:25,422 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:25,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13477 conditions, 6904 events. 4695/6904 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 40313 event pairs, 861 based on Foata normal form. 0/6596 useless extension candidates. Maximal degree in co-relation 13474. Up to 5107 conditions per place. [2023-11-06 23:04:25,473 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 39 selfloop transitions, 2 changer transitions 2/48 dead transitions. [2023-11-06 23:04:25,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 194 flow [2023-11-06 23:04:25,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-06 23:04:25,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5090702947845805 [2023-11-06 23:04:25,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-06 23:04:25,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-06 23:04:25,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:25,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-06 23:04:25,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:25,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:25,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:25,485 INFO L175 Difference]: Start difference. First operand has 41 places, 31 transitions, 70 flow. Second operand 3 states and 449 transitions. [2023-11-06 23:04:25,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 194 flow [2023-11-06 23:04:25,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:04:25,487 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2023-11-06 23:04:25,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-11-06 23:04:25,489 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -10 predicate places. [2023-11-06 23:04:25,489 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2023-11-06 23:04:25,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:25,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:25,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:25,507 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:25,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:25,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:25,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:25,702 INFO L85 PathProgramCache]: Analyzing trace with hash 207138661, now seen corresponding path program 1 times [2023-11-06 23:04:25,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:25,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787245446] [2023-11-06 23:04:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:25,704 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 23:04:25,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:25,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:25,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:25,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:25,904 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 23:04:25,904 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:25,905 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:25,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787245446] [2023-11-06 23:04:25,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787245446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:25,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:25,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:25,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665406433] [2023-11-06 23:04:25,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:25,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:25,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:25,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:25,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:25,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 294 [2023-11-06 23:04:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:25,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:25,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 294 [2023-11-06 23:04:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:26,945 INFO L124 PetriNetUnfolderBase]: 3224/4821 cut-off events. [2023-11-06 23:04:26,945 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-06 23:04:26,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9917 conditions, 4821 events. 3224/4821 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 26507 event pairs, 626 based on Foata normal form. 256/4847 useless extension candidates. Maximal degree in co-relation 9913. Up to 3325 conditions per place. [2023-11-06 23:04:26,980 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 37 selfloop transitions, 5 changer transitions 25/72 dead transitions. [2023-11-06 23:04:26,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 72 transitions, 302 flow [2023-11-06 23:04:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:26,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:04:26,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 699 transitions. [2023-11-06 23:04:26,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47551020408163264 [2023-11-06 23:04:26,985 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 699 transitions. [2023-11-06 23:04:26,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 699 transitions. [2023-11-06 23:04:26,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:26,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 699 transitions. [2023-11-06 23:04:26,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.8) internal successors, (699), 5 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 23:04:26,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:26,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:26,994 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 699 transitions. [2023-11-06 23:04:26,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 72 transitions, 302 flow [2023-11-06 23:04:26,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:26,998 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 111 flow [2023-11-06 23:04:26,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 23:04:26,999 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -6 predicate places. [2023-11-06 23:04:26,999 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 111 flow [2023-11-06 23:04:27,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:27,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:27,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:27,020 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:27,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:27,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:27,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:27,213 INFO L85 PathProgramCache]: Analyzing trace with hash -711412298, now seen corresponding path program 1 times [2023-11-06 23:04:27,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:27,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876146169] [2023-11-06 23:04:27,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:27,214 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 23:04:27,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:27,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:27,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:27,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:27,396 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:27,462 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 23:04:27,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:27,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:27,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876146169] [2023-11-06 23:04:27,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [876146169] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:27,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:27,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:27,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48582168] [2023-11-06 23:04:27,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:27,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:27,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:27,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 294 [2023-11-06 23:04:27,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:27,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:27,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 294 [2023-11-06 23:04:27,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:28,133 INFO L124 PetriNetUnfolderBase]: 1712/2715 cut-off events. [2023-11-06 23:04:28,133 INFO L125 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2023-11-06 23:04:28,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7138 conditions, 2715 events. 1712/2715 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 14301 event pairs, 330 based on Foata normal form. 175/2798 useless extension candidates. Maximal degree in co-relation 7131. Up to 1057 conditions per place. [2023-11-06 23:04:28,148 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 49 selfloop transitions, 9 changer transitions 25/88 dead transitions. [2023-11-06 23:04:28,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 447 flow [2023-11-06 23:04:28,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:28,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:04:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2023-11-06 23:04:28,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4767573696145125 [2023-11-06 23:04:28,154 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2023-11-06 23:04:28,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2023-11-06 23:04:28,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:28,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2023-11-06 23:04:28,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:28,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:28,165 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:28,165 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 111 flow. Second operand 6 states and 841 transitions. [2023-11-06 23:04:28,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 447 flow [2023-11-06 23:04:28,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 440 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:28,178 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 176 flow [2023-11-06 23:04:28,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2023-11-06 23:04:28,179 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-11-06 23:04:28,179 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 176 flow [2023-11-06 23:04:28,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:28,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:28,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:28,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:28,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:28,392 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:28,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1790605248, now seen corresponding path program 1 times [2023-11-06 23:04:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536350811] [2023-11-06 23:04:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:28,394 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 23:04:28,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:28,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:28,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:28,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 23:04:28,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:28,623 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 23:04:28,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:28,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:28,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536350811] [2023-11-06 23:04:28,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536350811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:28,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:28,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:28,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772853794] [2023-11-06 23:04:28,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:28,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:28,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:28,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:28,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 294 [2023-11-06 23:04:28,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:28,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:28,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 294 [2023-11-06 23:04:28,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:29,330 INFO L124 PetriNetUnfolderBase]: 1010/1644 cut-off events. [2023-11-06 23:04:29,331 INFO L125 PetriNetUnfolderBase]: For 1508/1508 co-relation queries the response was YES. [2023-11-06 23:04:29,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4904 conditions, 1644 events. 1010/1644 cut-off events. For 1508/1508 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 7921 event pairs, 276 based on Foata normal form. 67/1676 useless extension candidates. Maximal degree in co-relation 4895. Up to 540 conditions per place. [2023-11-06 23:04:29,341 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 59 selfloop transitions, 13 changer transitions 25/102 dead transitions. [2023-11-06 23:04:29,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 102 transitions, 612 flow [2023-11-06 23:04:29,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:04:29,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 981 transitions. [2023-11-06 23:04:29,347 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47667638483965014 [2023-11-06 23:04:29,347 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 981 transitions. [2023-11-06 23:04:29,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 981 transitions. [2023-11-06 23:04:29,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:29,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 981 transitions. [2023-11-06 23:04:29,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.14285714285714) internal successors, (981), 7 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,359 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,359 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 176 flow. Second operand 7 states and 981 transitions. [2023-11-06 23:04:29,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 102 transitions, 612 flow [2023-11-06 23:04:29,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 102 transitions, 550 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 23:04:29,382 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 226 flow [2023-11-06 23:04:29,382 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=226, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-06 23:04:29,383 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-11-06 23:04:29,383 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 226 flow [2023-11-06 23:04:29,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:29,384 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 23:04:29,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:29,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:29,597 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:29,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:29,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1378533994, now seen corresponding path program 1 times [2023-11-06 23:04:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:29,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678108240] [2023-11-06 23:04:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:29,599 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 23:04:29,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:29,600 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:29,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:29,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 23:04:29,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:29,850 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 23:04:29,850 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:29,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:29,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678108240] [2023-11-06 23:04:29,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678108240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:29,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:29,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:04:29,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515470295] [2023-11-06 23:04:29,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:29,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:29,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:29,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:29,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:29,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 294 [2023-11-06 23:04:29,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 226 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:29,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:29,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 294 [2023-11-06 23:04:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:30,577 INFO L124 PetriNetUnfolderBase]: 866/1387 cut-off events. [2023-11-06 23:04:30,577 INFO L125 PetriNetUnfolderBase]: For 1224/1224 co-relation queries the response was YES. [2023-11-06 23:04:30,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 1387 events. 866/1387 cut-off events. For 1224/1224 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6485 event pairs, 272 based on Foata normal form. 13/1377 useless extension candidates. Maximal degree in co-relation 3983. Up to 540 conditions per place. [2023-11-06 23:04:30,585 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 55 selfloop transitions, 17 changer transitions 13/90 dead transitions. [2023-11-06 23:04:30,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 552 flow [2023-11-06 23:04:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:04:30,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1095 transitions. [2023-11-06 23:04:30,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4655612244897959 [2023-11-06 23:04:30,596 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1095 transitions. [2023-11-06 23:04:30,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1095 transitions. [2023-11-06 23:04:30,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:30,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1095 transitions. [2023-11-06 23:04:30,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 136.875) internal successors, (1095), 8 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:30,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:30,607 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:30,607 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 226 flow. Second operand 8 states and 1095 transitions. [2023-11-06 23:04:30,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 552 flow [2023-11-06 23:04:30,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 90 transitions, 490 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 23:04:30,635 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 220 flow [2023-11-06 23:04:30,635 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=220, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2023-11-06 23:04:30,638 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-11-06 23:04:30,639 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 220 flow [2023-11-06 23:04:30,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:30,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:30,640 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, 1, 1, 1, 1, 1] [2023-11-06 23:04:30,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:30,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:30,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:30,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:30,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1317863409, now seen corresponding path program 1 times [2023-11-06 23:04:30,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1698325103] [2023-11-06 23:04:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:30,858 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 23:04:30,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:30,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:30,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:31,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:31,004 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:31,053 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 23:04:31,054 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:31,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:31,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1698325103] [2023-11-06 23:04:31,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1698325103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:31,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:31,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842392203] [2023-11-06 23:04:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:31,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:31,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:31,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:31,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:31,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 294 [2023-11-06 23:04:31,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:31,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:31,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 294 [2023-11-06 23:04:31,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:31,506 INFO L124 PetriNetUnfolderBase]: 1263/1925 cut-off events. [2023-11-06 23:04:31,507 INFO L125 PetriNetUnfolderBase]: For 2274/2274 co-relation queries the response was YES. [2023-11-06 23:04:31,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 1925 events. 1263/1925 cut-off events. For 2274/2274 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9523 event pairs, 158 based on Foata normal form. 0/1920 useless extension candidates. Maximal degree in co-relation 5721. Up to 1162 conditions per place. [2023-11-06 23:04:31,519 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 82 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-06 23:04:31,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 665 flow [2023-11-06 23:04:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:31,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-11-06 23:04:31,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4957482993197279 [2023-11-06 23:04:31,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-11-06 23:04:31,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-11-06 23:04:31,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:31,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-11-06 23:04:31,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 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 23:04:31,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:31,529 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:31,529 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 220 flow. Second operand 4 states and 583 transitions. [2023-11-06 23:04:31,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 665 flow [2023-11-06 23:04:31,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 88 transitions, 524 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 23:04:31,548 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 169 flow [2023-11-06 23:04:31,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-06 23:04:31,549 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-11-06 23:04:31,549 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 169 flow [2023-11-06 23:04:31,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:31,550 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:31,550 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, 1, 1, 1, 1, 1] [2023-11-06 23:04:31,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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)] Ended with exit code 0 [2023-11-06 23:04:31,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:31,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:31,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:31,763 INFO L85 PathProgramCache]: Analyzing trace with hash -395778279, now seen corresponding path program 2 times [2023-11-06 23:04:31,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:31,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690577816] [2023-11-06 23:04:31,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:04:31,764 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 23:04:31,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:31,765 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:31,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:31,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:04:31,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:31,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 23:04:31,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:32,561 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 23:04:32,561 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:32,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690577816] [2023-11-06 23:04:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690577816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:32,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:32,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:04:32,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831195969] [2023-11-06 23:04:32,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:32,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 23:04:32,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:32,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 23:04:32,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 23:04:32,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2023-11-06 23:04:32,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 169 flow. Second operand has 8 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:32,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:32,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2023-11-06 23:04:32,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:33,318 INFO L124 PetriNetUnfolderBase]: 1363/2273 cut-off events. [2023-11-06 23:04:33,318 INFO L125 PetriNetUnfolderBase]: For 1745/1745 co-relation queries the response was YES. [2023-11-06 23:04:33,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6251 conditions, 2273 events. 1363/2273 cut-off events. For 1745/1745 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12675 event pairs, 162 based on Foata normal form. 1/2252 useless extension candidates. Maximal degree in co-relation 6241. Up to 840 conditions per place. [2023-11-06 23:04:33,332 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 95 selfloop transitions, 6 changer transitions 0/107 dead transitions. [2023-11-06 23:04:33,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 107 transitions, 655 flow [2023-11-06 23:04:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:04:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 976 transitions. [2023-11-06 23:04:33,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742468415937804 [2023-11-06 23:04:33,338 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 976 transitions. [2023-11-06 23:04:33,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 976 transitions. [2023-11-06 23:04:33,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:33,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 976 transitions. [2023-11-06 23:04:33,342 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.42857142857142) internal successors, (976), 7 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:33,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:33,347 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:33,347 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 169 flow. Second operand 7 states and 976 transitions. [2023-11-06 23:04:33,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 107 transitions, 655 flow [2023-11-06 23:04:33,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 107 transitions, 652 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:33,375 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 192 flow [2023-11-06 23:04:33,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-11-06 23:04:33,378 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 7 predicate places. [2023-11-06 23:04:33,382 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 192 flow [2023-11-06 23:04:33,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:33,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:33,383 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, 1, 1, 1, 1, 1] [2023-11-06 23:04:33,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:33,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:33,596 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:33,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:33,596 INFO L85 PathProgramCache]: Analyzing trace with hash 2095142907, now seen corresponding path program 3 times [2023-11-06 23:04:33,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:33,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1322321803] [2023-11-06 23:04:33,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:04:33,597 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 23:04:33,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:33,598 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:33,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:33,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:04:33,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:33,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:33,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:33,807 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 23:04:33,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:33,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:33,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1322321803] [2023-11-06 23:04:33,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1322321803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:33,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:33,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:33,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735879839] [2023-11-06 23:04:33,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:33,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:33,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:33,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:33,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 294 [2023-11-06 23:04:33,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:33,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:33,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 294 [2023-11-06 23:04:33,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:34,608 INFO L124 PetriNetUnfolderBase]: 2394/3938 cut-off events. [2023-11-06 23:04:34,608 INFO L125 PetriNetUnfolderBase]: For 3682/3682 co-relation queries the response was YES. [2023-11-06 23:04:34,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11767 conditions, 3938 events. 2394/3938 cut-off events. For 3682/3682 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 23533 event pairs, 311 based on Foata normal form. 1/3917 useless extension candidates. Maximal degree in co-relation 11755. Up to 1870 conditions per place. [2023-11-06 23:04:34,638 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 85 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2023-11-06 23:04:34,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 92 transitions, 594 flow [2023-11-06 23:04:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 581 transitions. [2023-11-06 23:04:34,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49404761904761907 [2023-11-06 23:04:34,642 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 581 transitions. [2023-11-06 23:04:34,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 581 transitions. [2023-11-06 23:04:34,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:34,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 581 transitions. [2023-11-06 23:04:34,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.25) internal successors, (581), 4 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,649 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,649 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 192 flow. Second operand 4 states and 581 transitions. [2023-11-06 23:04:34,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 92 transitions, 594 flow [2023-11-06 23:04:34,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 92 transitions, 583 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 23:04:34,724 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 199 flow [2023-11-06 23:04:34,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2023-11-06 23:04:34,725 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-11-06 23:04:34,725 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 199 flow [2023-11-06 23:04:34,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:34,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:34,726 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, 1, 1, 1, 1, 1] [2023-11-06 23:04:34,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:34,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:34,944 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:34,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:34,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1098300649, now seen corresponding path program 4 times [2023-11-06 23:04:34,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:34,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723551359] [2023-11-06 23:04:34,945 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:04:34,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 23:04:34,945 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:34,946 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:34,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:35,109 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:04:35,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:35,116 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:35,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:35,139 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 23:04:35,139 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:35,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:35,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723551359] [2023-11-06 23:04:35,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723551359] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:35,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:35,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:35,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252148308] [2023-11-06 23:04:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:35,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:35,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:35,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 294 [2023-11-06 23:04:35,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:35,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:35,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 294 [2023-11-06 23:04:35,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:36,085 INFO L124 PetriNetUnfolderBase]: 3750/6087 cut-off events. [2023-11-06 23:04:36,086 INFO L125 PetriNetUnfolderBase]: For 6152/6156 co-relation queries the response was YES. [2023-11-06 23:04:36,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18802 conditions, 6087 events. 3750/6087 cut-off events. For 6152/6156 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 38436 event pairs, 1179 based on Foata normal form. 1/5957 useless extension candidates. Maximal degree in co-relation 18788. Up to 3039 conditions per place. [2023-11-06 23:04:36,124 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 67 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-11-06 23:04:36,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 75 transitions, 477 flow [2023-11-06 23:04:36,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:36,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-11-06 23:04:36,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-06 23:04:36,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-11-06 23:04:36,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-11-06 23:04:36,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:36,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-11-06 23:04:36,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:36,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:36,132 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:36,132 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 199 flow. Second operand 3 states and 441 transitions. [2023-11-06 23:04:36,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 75 transitions, 477 flow [2023-11-06 23:04:36,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 75 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:36,267 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 210 flow [2023-11-06 23:04:36,267 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2023-11-06 23:04:36,267 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-11-06 23:04:36,268 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 210 flow [2023-11-06 23:04:36,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:36,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:36,268 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, 1, 1, 1, 1, 1] [2023-11-06 23:04:36,276 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:36,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:36,469 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:36,470 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:36,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2140051547, now seen corresponding path program 5 times [2023-11-06 23:04:36,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:36,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30230496] [2023-11-06 23:04:36,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 23:04:36,470 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 23:04:36,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:36,472 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:36,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:36,669 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:04:36,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:04:36,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:04:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:36,862 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:04:36,862 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:04:36,863 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 23:04:36,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 23:04:36,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 23:04:36,865 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 23:04:36,866 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 23:04:36,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 23:04:36,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 23:04:36,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 23:04:36,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 23:04:36,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 23:04:36,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 23:04:36,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:37,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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 23:04:37,082 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:37,088 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:04:37,088 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:37,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:37 BasicIcfg [2023-11-06 23:04:37,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:37,210 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:37,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:37,210 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:37,211 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:11" (3/4) ... [2023-11-06 23:04:37,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:04:37,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:37,214 INFO L158 Benchmark]: Toolchain (without parser) took 27900.67ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 64.6MB in the beginning and 875.1MB in the end (delta: -810.5MB). Peak memory consumption was 264.5MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,214 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:37,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 840.75ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 61.6MB in the end (delta: 2.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.21ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,220 INFO L158 Benchmark]: Boogie Preprocessor took 50.89ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 56.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,220 INFO L158 Benchmark]: RCFGBuilder took 924.75ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 44.4MB in the end (delta: 12.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,221 INFO L158 Benchmark]: TraceAbstraction took 25978.10ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.3MB in the beginning and 876.2MB in the end (delta: -832.8MB). Peak memory consumption was 239.3MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,221 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 1.2GB. Free memory was 876.2MB in the beginning and 875.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:37,224 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 38.5MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 840.75ms. Allocated memory is still 90.2MB. Free memory was 64.3MB in the beginning and 61.6MB in the end (delta: 2.7MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.21ms. Allocated memory is still 90.2MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.89ms. Allocated memory is still 90.2MB. Free memory was 58.9MB in the beginning and 56.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 924.75ms. Allocated memory is still 90.2MB. Free memory was 56.8MB in the beginning and 44.4MB in the end (delta: 12.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25978.10ms. Allocated memory was 90.2MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 43.3MB in the beginning and 876.2MB in the end (delta: -832.8MB). Peak memory consumption was 239.3MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 1.2GB. Free memory was 876.2MB in the beginning and 875.1MB 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: 10.3s, 157 PlacesBefore, 52 PlacesAfterwards, 147 TransitionsBefore, 40 TransitionsAfterwards, 3860 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 143 TotalNumberOfCompositions, 9945 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4984, independent: 4751, independent conditional: 0, independent unconditional: 4751, dependent: 233, dependent conditional: 0, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2099, independent: 2055, independent conditional: 0, independent unconditional: 2055, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4984, independent: 2696, independent conditional: 0, independent unconditional: 2696, dependent: 189, dependent conditional: 0, dependent unconditional: 189, unknown: 2099, unknown conditional: 0, unknown unconditional: 2099] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p3_EAX = 0; [L719] 0 int __unbuffered_p3_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff0_thd4; [L733] 0 _Bool x$r_buff1_thd0; [L734] 0 _Bool x$r_buff1_thd1; [L735] 0 _Bool x$r_buff1_thd2; [L736] 0 _Bool x$r_buff1_thd3; [L737] 0 _Bool x$r_buff1_thd4; [L738] 0 _Bool x$read_delayed; [L739] 0 int *x$read_delayed_var; [L740] 0 int x$w_buff0; [L741] 0 _Bool x$w_buff0_used; [L742] 0 int x$w_buff1; [L743] 0 _Bool x$w_buff1_used; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L862] 0 pthread_t t685; [L863] FCALL, FORK 0 pthread_create(&t685, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t685, ((void *)0), P0, ((void *)0))=0, t685={11:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t686; [L865] FCALL, FORK 0 pthread_create(&t686, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t686, ((void *)0), P1, ((void *)0))=1, t685={11:0}, t686={15:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L866] 0 pthread_t t687; [L781] 2 x$w_buff1 = x$w_buff0 [L782] 2 x$w_buff0 = 1 [L783] 2 x$w_buff1_used = x$w_buff0_used [L784] 2 x$w_buff0_used = (_Bool)1 [L785] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L785] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L786] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L787] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L788] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L789] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L790] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L791] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L867] FCALL, FORK 0 pthread_create(&t687, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t687, ((void *)0), P2, ((void *)0))=2, t685={11:0}, t686={15:0}, t687={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L868] 0 pthread_t t688; [L811] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L869] FCALL, FORK 0 pthread_create(&t688, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t688, ((void *)0), P3, ((void *)0))=3, t685={11:0}, t686={15:0}, t687={7:0}, t688={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L814] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L831] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L834] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L837] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L753] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L766] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p0_EAX = x [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 1 return 0; [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L841] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L842] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L843] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L844] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L847] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L849] 4 return 0; [L871] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L873] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L873] RET 0 assume_abort_if_not(main$tmp_guard0) [L875] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L876] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L877] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L878] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L879] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t685={11:0}, t686={15:0}, t687={7:0}, t688={-2147483637:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L882] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix026_power.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:8}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 860]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 869]: 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: 867]: 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: 863]: 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 9 procedures, 186 locations, 16 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: 25.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 489 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 257 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1788 IncrementalHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 65 mSDtfsCounter, 1788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 178 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=226occurred in iteration=5, InterpolantAutomatonStates: 49, 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, 1.1s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1481 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 23:04:37,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d95ba03b-0ca6-4f00-8678-22ee83b3fe86/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