./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 527bcce2 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:01:02,272 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:01:02,406 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-21 21:01:02,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:01:02,418 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:01:02,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:01:02,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:01:02,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:01:02,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:01:02,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:01:02,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:01:02,486 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:01:02,486 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:01:02,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:01:02,490 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:01:02,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:01:02,491 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:01:02,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:01:02,492 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 21:01:02,493 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 21:01:02,493 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 21:01:02,494 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:01:02,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 21:01:02,496 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:01:02,496 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:01:02,497 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:01:02,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:01:02,499 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:01:02,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:01:02,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:01:02,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:02,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:01:02,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:01:02,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 21:01:02,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-21 21:01:02,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:01:02,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:01:02,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:01:02,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:01:02,506 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_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/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_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2023-11-21 21:01:02,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:01:02,920 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:01:02,923 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:01:02,925 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:01:02,926 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:01:02,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-21 21:01:06,210 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:01:06,655 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:01:06,656 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-21 21:01:06,690 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/d409e600f/44cd46c4440f45598993afd28435ceed/FLAG4a49dc216 [2023-11-21 21:01:06,710 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/d409e600f/44cd46c4440f45598993afd28435ceed [2023-11-21 21:01:06,718 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:01:06,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:01:06,725 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:06,725 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:01:06,732 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:01:06,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:06" (1/1) ... [2023-11-21 21:01:06,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb6e34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:06, skipping insertion in model container [2023-11-21 21:01:06,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:06" (1/1) ... [2023-11-21 21:01:06,824 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:01:07,357 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:07,372 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:01:07,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:07,551 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:01:07,551 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:01:07,559 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:01:07,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07 WrapperNode [2023-11-21 21:01:07,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:07,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:07,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:01:07,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:01:07,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,594 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,634 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-11-21 21:01:07,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:07,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:01:07,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:01:07,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:01:07,647 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,653 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,653 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,666 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,669 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,673 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:01:07,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:01:07,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:01:07,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:01:07,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (1/1) ... [2023-11-21 21:01:07,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:07,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:07,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:01:07,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-21 21:01:07,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:01:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:01:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:01:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:01:07,777 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 21:01:07,777 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 21:01:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 21:01:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 21:01:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 21:01:07,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 21:01:07,778 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 21:01:07,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 21:01:07,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-21 21:01:07,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:01:07,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:01:07,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:01:07,784 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:01:08,026 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:01:08,029 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 21:01:08,556 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 21:01:08,889 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 21:01:08,889 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 21:01:08,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:08 BoogieIcfgContainer [2023-11-21 21:01:08,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 21:01:08,896 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-21 21:01:08,896 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-21 21:01:08,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-21 21:01:08,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 09:01:06" (1/3) ... [2023-11-21 21:01:08,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b98cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:08, skipping insertion in model container [2023-11-21 21:01:08,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:07" (2/3) ... [2023-11-21 21:01:08,905 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b98cc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 09:01:08, skipping insertion in model container [2023-11-21 21:01:08,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:08" (3/3) ... [2023-11-21 21:01:08,907 INFO L112 eAbstractionObserver]: Analyzing ICFG mix005_tso.oepc.i [2023-11-21 21:01:08,928 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-21 21:01:08,929 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-21 21:01:08,929 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-21 21:01:08,989 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-21 21:01:09,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-21 21:01:09,084 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-21 21:01:09,085 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:01:09,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-21 21:01:09,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-21 21:01:09,097 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-21 21:01:09,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-21 21:01:09,128 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;@525a9c8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-21 21:01:09,129 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-21 21:01:09,134 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-21 21:01:09,134 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-21 21:01:09,134 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-21 21:01:09,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:09,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 21:01:09,136 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:09,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:09,144 INFO L85 PathProgramCache]: Analyzing trace with hash 14643, now seen corresponding path program 1 times [2023-11-21 21:01:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:09,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169260314] [2023-11-21 21:01:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:09,570 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-21 21:01:09,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:09,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169260314] [2023-11-21 21:01:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169260314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:09,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:09,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:01:09,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83728635] [2023-11-21 21:01:09,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:09,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:09,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:09,670 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-21 21:01:09,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:09,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:09,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-21 21:01:09,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:11,228 INFO L124 PetriNetUnfolderBase]: 3508/6029 cut-off events. [2023-11-21 21:01:11,229 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-21 21:01:11,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11014 conditions, 6029 events. 3508/6029 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45136 event pairs, 2752 based on Foata normal form. 270/5714 useless extension candidates. Maximal degree in co-relation 10999. Up to 3825 conditions per place. [2023-11-21 21:01:11,319 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-21 21:01:11,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 224 flow [2023-11-21 21:01:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:11,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-21 21:01:11,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-21 21:01:11,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-21 21:01:11,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-21 21:01:11,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:11,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-21 21:01:11,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:11,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:11,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:11,359 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 148 transitions. [2023-11-21 21:01:11,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 224 flow [2023-11-21 21:01:11,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-21 21:01:11,377 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-21 21:01:11,379 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-21 21:01:11,383 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-21 21:01:11,384 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-21 21:01:11,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:11,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:11,385 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-21 21:01:11,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-21 21:01:11,386 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:11,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 14644, now seen corresponding path program 1 times [2023-11-21 21:01:11,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:11,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511499049] [2023-11-21 21:01:11,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:11,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:11,559 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-21 21:01:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:11,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511499049] [2023-11-21 21:01:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511499049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:11,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:11,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:01:11,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337963306] [2023-11-21 21:01:11,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:11,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:11,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:11,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:11,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-21 21:01:11,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:11,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:11,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-21 21:01:11,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:12,889 INFO L124 PetriNetUnfolderBase]: 3508/6028 cut-off events. [2023-11-21 21:01:12,890 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-21 21:01:12,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11145 conditions, 6028 events. 3508/6028 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45008 event pairs, 2752 based on Foata normal form. 1/5444 useless extension candidates. Maximal degree in co-relation 11134. Up to 3824 conditions per place. [2023-11-21 21:01:13,001 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-21 21:01:13,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 220 flow [2023-11-21 21:01:13,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-21 21:01:13,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-21 21:01:13,009 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-21 21:01:13,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-21 21:01:13,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:13,010 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-21 21:01:13,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:13,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:13,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:13,015 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 148 transitions. [2023-11-21 21:01:13,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 220 flow [2023-11-21 21:01:13,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:13,033 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-21 21:01:13,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-21 21:01:13,035 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-21 21:01:13,036 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-21 21:01:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:13,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:13,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 21:01:13,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-21 21:01:13,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:13,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:13,052 INFO L85 PathProgramCache]: Analyzing trace with hash 436669227, now seen corresponding path program 1 times [2023-11-21 21:01:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544035404] [2023-11-21 21:01:13,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:13,160 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-21 21:01:13,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:13,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544035404] [2023-11-21 21:01:13,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544035404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:13,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:13,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:13,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56209013] [2023-11-21 21:01:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:13,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:13,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:13,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:13,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:13,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-21 21:01:13,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:13,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:13,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-21 21:01:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:14,317 INFO L124 PetriNetUnfolderBase]: 3510/5981 cut-off events. [2023-11-21 21:01:14,317 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-21 21:01:14,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11103 conditions, 5981 events. 3510/5981 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 44493 event pairs, 2797 based on Foata normal form. 0/5402 useless extension candidates. Maximal degree in co-relation 11092. Up to 3825 conditions per place. [2023-11-21 21:01:14,382 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-21 21:01:14,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 220 flow [2023-11-21 21:01:14,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 21:01:14,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-21 21:01:14,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 21:01:14,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 21:01:14,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:14,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 21:01:14,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:14,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:14,388 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:14,388 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-21 21:01:14,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 220 flow [2023-11-21 21:01:14,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:14,406 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-21 21:01:14,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-21 21:01:14,408 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-21 21:01:14,408 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-21 21:01:14,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:14,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:14,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-21 21:01:14,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-21 21:01:14,410 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:14,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:14,410 INFO L85 PathProgramCache]: Analyzing trace with hash 436669228, now seen corresponding path program 1 times [2023-11-21 21:01:14,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:14,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047393678] [2023-11-21 21:01:14,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:14,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:14,495 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-21 21:01:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047393678] [2023-11-21 21:01:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047393678] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:14,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:14,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345088029] [2023-11-21 21:01:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:14,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:14,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:14,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-21 21:01:14,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:14,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:14,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-21 21:01:14,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:15,818 INFO L124 PetriNetUnfolderBase]: 3508/6022 cut-off events. [2023-11-21 21:01:15,818 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-21 21:01:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11141 conditions, 6022 events. 3508/6022 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 45170 event pairs, 2220 based on Foata normal form. 3/5448 useless extension candidates. Maximal degree in co-relation 11131. Up to 3820 conditions per place. [2023-11-21 21:01:15,877 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-21 21:01:15,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 216 flow [2023-11-21 21:01:15,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:15,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:15,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-21 21:01:15,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-21 21:01:15,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-21 21:01:15,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-21 21:01:15,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:15,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-21 21:01:15,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:15,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:15,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:15,882 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 148 transitions. [2023-11-21 21:01:15,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 216 flow [2023-11-21 21:01:15,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:15,887 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-21 21:01:15,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-21 21:01:15,888 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-21 21:01:15,889 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-21 21:01:15,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:15,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:15,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:15,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-21 21:01:15,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:15,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:15,890 INFO L85 PathProgramCache]: Analyzing trace with hash -642554093, now seen corresponding path program 1 times [2023-11-21 21:01:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798599402] [2023-11-21 21:01:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:15,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:15,996 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-21 21:01:15,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:15,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798599402] [2023-11-21 21:01:15,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798599402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:15,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:15,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640155277] [2023-11-21 21:01:15,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:15,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:15,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:16,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:16,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-21 21:01:16,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:16,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:16,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-21 21:01:16,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:17,163 INFO L124 PetriNetUnfolderBase]: 3530/6002 cut-off events. [2023-11-21 21:01:17,163 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-21 21:01:17,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11158 conditions, 6002 events. 3530/6002 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 44837 event pairs, 2286 based on Foata normal form. 0/5453 useless extension candidates. Maximal degree in co-relation 11148. Up to 3827 conditions per place. [2023-11-21 21:01:17,226 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-21 21:01:17,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 216 flow [2023-11-21 21:01:17,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:17,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-21 21:01:17,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-21 21:01:17,236 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-21 21:01:17,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-21 21:01:17,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:17,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-21 21:01:17,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:17,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:17,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:17,241 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-21 21:01:17,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 216 flow [2023-11-21 21:01:17,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:17,248 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-21 21:01:17,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-21 21:01:17,252 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-21 21:01:17,253 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-21 21:01:17,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:17,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:17,253 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:17,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-21 21:01:17,254 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:17,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -642554092, now seen corresponding path program 1 times [2023-11-21 21:01:17,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:17,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209543632] [2023-11-21 21:01:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:17,391 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-21 21:01:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209543632] [2023-11-21 21:01:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209543632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227664721] [2023-11-21 21:01:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:17,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:17,414 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-21 21:01:17,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:17,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:17,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-21 21:01:17,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:18,325 INFO L124 PetriNetUnfolderBase]: 3508/5992 cut-off events. [2023-11-21 21:01:18,326 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-21 21:01:18,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11123 conditions, 5992 events. 3508/5992 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 45248 event pairs, 1608 based on Foata normal form. 15/5467 useless extension candidates. Maximal degree in co-relation 11113. Up to 3790 conditions per place. [2023-11-21 21:01:18,382 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-21 21:01:18,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-21 21:01:18,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:18,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-21 21:01:18,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-21 21:01:18,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-21 21:01:18,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-21 21:01:18,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:18,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-21 21:01:18,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:18,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:18,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:18,387 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 148 transitions. [2023-11-21 21:01:18,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-21 21:01:18,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:18,391 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-21 21:01:18,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-21 21:01:18,395 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-21 21:01:18,395 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-21 21:01:18,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:18,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:18,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:18,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-21 21:01:18,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:18,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash -642553002, now seen corresponding path program 1 times [2023-11-21 21:01:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546054402] [2023-11-21 21:01:18,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:18,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:18,520 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-21 21:01:18,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546054402] [2023-11-21 21:01:18,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546054402] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-21 21:01:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319368390] [2023-11-21 21:01:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:18,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:18,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:18,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:18,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:18,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-21 21:01:18,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:18,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:18,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-21 21:01:18,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:19,181 INFO L124 PetriNetUnfolderBase]: 2754/4599 cut-off events. [2023-11-21 21:01:19,181 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-21 21:01:19,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8655 conditions, 4599 events. 2754/4599 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 32642 event pairs, 492 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 8645. Up to 3064 conditions per place. [2023-11-21 21:01:19,220 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 39 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2023-11-21 21:01:19,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 248 flow [2023-11-21 21:01:19,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-21 21:01:19,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860696517412935 [2023-11-21 21:01:19,222 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-21 21:01:19,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-21 21:01:19,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:19,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-21 21:01:19,224 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:19,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:19,225 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:19,225 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 158 transitions. [2023-11-21 21:01:19,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 248 flow [2023-11-21 21:01:19,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:19,228 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-21 21:01:19,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-21 21:01:19,229 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-21 21:01:19,229 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-21 21:01:19,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:19,230 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:19,230 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:19,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-21 21:01:19,230 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:19,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash 340695609, now seen corresponding path program 1 times [2023-11-21 21:01:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756260039] [2023-11-21 21:01:19,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:19,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:19,298 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-21 21:01:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:19,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756260039] [2023-11-21 21:01:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756260039] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898346966] [2023-11-21 21:01:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:19,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:19,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-21 21:01:19,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:19,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:19,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-21 21:01:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:20,079 INFO L124 PetriNetUnfolderBase]: 2532/4332 cut-off events. [2023-11-21 21:01:20,079 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-21 21:01:20,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8224 conditions, 4332 events. 2532/4332 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 30777 event pairs, 1191 based on Foata normal form. 0/4140 useless extension candidates. Maximal degree in co-relation 8213. Up to 2985 conditions per place. [2023-11-21 21:01:20,125 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-21 21:01:20,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 202 flow [2023-11-21 21:01:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:20,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:20,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-21 21:01:20,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-21 21:01:20,127 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-21 21:01:20,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-21 21:01:20,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:20,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-21 21:01:20,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:20,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:20,130 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:20,130 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-21 21:01:20,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 202 flow [2023-11-21 21:01:20,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:20,133 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-21 21:01:20,134 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-21 21:01:20,134 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-21 21:01:20,135 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-21 21:01:20,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:20,135 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:20,135 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:20,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-21 21:01:20,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:20,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash 340695610, now seen corresponding path program 1 times [2023-11-21 21:01:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:20,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100896870] [2023-11-21 21:01:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:20,248 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-21 21:01:20,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:20,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100896870] [2023-11-21 21:01:20,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100896870] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:20,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:20,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-21 21:01:20,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000078483] [2023-11-21 21:01:20,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:20,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-21 21:01:20,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-21 21:01:20,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-21 21:01:20,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-21 21:01:20,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:20,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:20,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-21 21:01:20,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:21,095 INFO L124 PetriNetUnfolderBase]: 2457/4269 cut-off events. [2023-11-21 21:01:21,095 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-21 21:01:21,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7944 conditions, 4269 events. 2457/4269 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30667 event pairs, 735 based on Foata normal form. 36/4137 useless extension candidates. Maximal degree in co-relation 7934. Up to 2874 conditions per place. [2023-11-21 21:01:21,139 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-21 21:01:21,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 196 flow [2023-11-21 21:01:21,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-21 21:01:21,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-21 21:01:21,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-21 21:01:21,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-21 21:01:21,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-21 21:01:21,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-21 21:01:21,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:21,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-21 21:01:21,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:21,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:21,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:21,144 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 145 transitions. [2023-11-21 21:01:21,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 196 flow [2023-11-21 21:01:21,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:21,147 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-21 21:01:21,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-21 21:01:21,148 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-21 21:01:21,148 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-21 21:01:21,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:21,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:21,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:21,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-21 21:01:21,150 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:21,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 578759073, now seen corresponding path program 1 times [2023-11-21 21:01:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266967553] [2023-11-21 21:01:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:21,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:22,434 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-21 21:01:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266967553] [2023-11-21 21:01:22,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266967553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:22,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-21 21:01:22,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429665660] [2023-11-21 21:01:22,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:22,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-21 21:01:22,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:22,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-21 21:01:22,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-21 21:01:22,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-21 21:01:22,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:22,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:22,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-21 21:01:22,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:24,089 INFO L124 PetriNetUnfolderBase]: 3326/5426 cut-off events. [2023-11-21 21:01:24,089 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-21 21:01:24,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10307 conditions, 5426 events. 3326/5426 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 37073 event pairs, 204 based on Foata normal form. 144/5515 useless extension candidates. Maximal degree in co-relation 10296. Up to 2979 conditions per place. [2023-11-21 21:01:24,117 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 48 selfloop transitions, 5 changer transitions 12/87 dead transitions. [2023-11-21 21:01:24,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 318 flow [2023-11-21 21:01:24,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:01:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:01:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2023-11-21 21:01:24,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6305970149253731 [2023-11-21 21:01:24,119 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 338 transitions. [2023-11-21 21:01:24,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 338 transitions. [2023-11-21 21:01:24,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:24,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 338 transitions. [2023-11-21 21:01:24,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:24,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:24,123 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:24,123 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 338 transitions. [2023-11-21 21:01:24,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 318 flow [2023-11-21 21:01:24,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:24,126 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-21 21:01:24,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-21 21:01:24,127 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-21 21:01:24,128 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-21 21:01:24,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.7) internal successors, (357), 10 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:24,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:24,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-21 21:01:24,129 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-21 21:01:24,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:24,129 INFO L85 PathProgramCache]: Analyzing trace with hash 578760426, now seen corresponding path program 1 times [2023-11-21 21:01:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080050078] [2023-11-21 21:01:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:24,390 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-21 21:01:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:24,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080050078] [2023-11-21 21:01:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080050078] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-21 21:01:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106013188] [2023-11-21 21:01:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:24,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-21 21:01:24,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:24,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-21 21:01:24,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-21 21:01:24,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-21 21:01:24,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:24,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:24,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-21 21:01:24,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:25,772 INFO L124 PetriNetUnfolderBase]: 8029/11962 cut-off events. [2023-11-21 21:01:25,772 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-21 21:01:25,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23266 conditions, 11962 events. 8029/11962 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 81308 event pairs, 869 based on Foata normal form. 320/12023 useless extension candidates. Maximal degree in co-relation 23255. Up to 7057 conditions per place. [2023-11-21 21:01:25,844 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 51 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2023-11-21 21:01:25,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 78 transitions, 302 flow [2023-11-21 21:01:25,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-21 21:01:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-21 21:01:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-21 21:01:25,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-21 21:01:25,846 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-21 21:01:25,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-21 21:01:25,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:25,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-21 21:01:25,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:25,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:25,848 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:25,848 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 4 states and 192 transitions. [2023-11-21 21:01:25,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 78 transitions, 302 flow [2023-11-21 21:01:25,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 287 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-21 21:01:25,850 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 147 flow [2023-11-21 21:01:25,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-21 21:01:25,850 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-21 21:01:25,850 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 147 flow [2023-11-21 21:01:25,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:25,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:25,851 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] [2023-11-21 21:01:25,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-21 21:01:25,851 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-21 21:01:25,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:25,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1564534999, now seen corresponding path program 1 times [2023-11-21 21:01:25,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:25,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107947907] [2023-11-21 21:01:25,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:25,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:26,108 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-21 21:01:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107947907] [2023-11-21 21:01:26,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107947907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:26,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:26,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-21 21:01:26,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561837458] [2023-11-21 21:01:26,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:26,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-21 21:01:26,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:26,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-21 21:01:26,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-21 21:01:26,123 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-21 21:01:26,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:26,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:26,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-21 21:01:26,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:27,142 INFO L124 PetriNetUnfolderBase]: 6173/9290 cut-off events. [2023-11-21 21:01:27,142 INFO L125 PetriNetUnfolderBase]: For 2252/2252 co-relation queries the response was YES. [2023-11-21 21:01:27,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21064 conditions, 9290 events. 6173/9290 cut-off events. For 2252/2252 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 60227 event pairs, 369 based on Foata normal form. 296/9387 useless extension candidates. Maximal degree in co-relation 21051. Up to 4681 conditions per place. [2023-11-21 21:01:27,194 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 65 selfloop transitions, 10 changer transitions 1/96 dead transitions. [2023-11-21 21:01:27,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 416 flow [2023-11-21 21:01:27,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-21 21:01:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-21 21:01:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-21 21:01:27,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7253731343283583 [2023-11-21 21:01:27,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-21 21:01:27,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-21 21:01:27,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:27,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-21 21:01:27,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:27,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:27,200 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:27,200 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-21 21:01:27,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 416 flow [2023-11-21 21:01:27,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 405 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:27,205 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 199 flow [2023-11-21 21:01:27,205 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-21 21:01:27,206 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-21 21:01:27,206 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 199 flow [2023-11-21 21:01:27,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:27,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:27,207 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, 1, 1, 1] [2023-11-21 21:01:27,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-21 21:01:27,207 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-21 21:01:27,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 391951632, now seen corresponding path program 1 times [2023-11-21 21:01:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243062584] [2023-11-21 21:01:27,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:27,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:27,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:27,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 21:01:27,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:27,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243062584] [2023-11-21 21:01:27,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243062584] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:27,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:27,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-21 21:01:27,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368031570] [2023-11-21 21:01:27,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:27,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:01:27,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:27,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:01:27,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:27,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-21 21:01:27,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:27,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:27,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-21 21:01:27,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:28,365 INFO L124 PetriNetUnfolderBase]: 3825/5774 cut-off events. [2023-11-21 21:01:28,365 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-21 21:01:28,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14674 conditions, 5774 events. 3825/5774 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 33453 event pairs, 221 based on Foata normal form. 208/5818 useless extension candidates. Maximal degree in co-relation 14659. Up to 1801 conditions per place. [2023-11-21 21:01:28,401 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 77 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2023-11-21 21:01:28,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 543 flow [2023-11-21 21:01:28,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:01:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:01:28,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-21 21:01:28,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-21 21:01:28,405 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-21 21:01:28,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-21 21:01:28,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:28,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-21 21:01:28,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:28,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:28,408 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:28,409 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-21 21:01:28,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 543 flow [2023-11-21 21:01:28,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 513 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 21:01:28,436 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 249 flow [2023-11-21 21:01:28,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-11-21 21:01:28,438 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-21 21:01:28,438 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 249 flow [2023-11-21 21:01:28,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:28,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:28,439 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:28,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-21 21:01:28,439 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-21 21:01:28,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:28,440 INFO L85 PathProgramCache]: Analyzing trace with hash 867935833, now seen corresponding path program 1 times [2023-11-21 21:01:28,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:28,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359363296] [2023-11-21 21:01:28,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:28,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:28,837 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-21 21:01:28,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:28,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359363296] [2023-11-21 21:01:28,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359363296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:28,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:28,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:28,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600208856] [2023-11-21 21:01:28,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:28,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:28,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:28,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:28,846 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-21 21:01:28,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:28,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:28,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-21 21:01:28,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:29,643 INFO L124 PetriNetUnfolderBase]: 2457/3638 cut-off events. [2023-11-21 21:01:29,644 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-21 21:01:29,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10155 conditions, 3638 events. 2457/3638 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18995 event pairs, 173 based on Foata normal form. 88/3569 useless extension candidates. Maximal degree in co-relation 10139. Up to 1088 conditions per place. [2023-11-21 21:01:29,676 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 18 changer transitions 1/108 dead transitions. [2023-11-21 21:01:29,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 537 flow [2023-11-21 21:01:29,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-21 21:01:29,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-21 21:01:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-21 21:01:29,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844349680170576 [2023-11-21 21:01:29,678 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-21 21:01:29,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-21 21:01:29,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:29,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-21 21:01:29,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:29,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 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-21 21:01:29,682 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 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-21 21:01:29,682 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 249 flow. Second operand 7 states and 321 transitions. [2023-11-21 21:01:29,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 537 flow [2023-11-21 21:01:29,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 491 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-21 21:01:29,722 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 259 flow [2023-11-21 21:01:29,722 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-11-21 21:01:29,723 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-21 21:01:29,723 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 259 flow [2023-11-21 21:01:29,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:29,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:29,724 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:29,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-21 21:01:29,724 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-21 21:01:29,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1752490468, now seen corresponding path program 1 times [2023-11-21 21:01:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:29,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091318853] [2023-11-21 21:01:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:30,439 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-21 21:01:30,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091318853] [2023-11-21 21:01:30,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091318853] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:01:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130666965] [2023-11-21 21:01:30,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:30,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:30,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-21 21:01:30,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:30,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:30,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-21 21:01:30,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:31,809 INFO L124 PetriNetUnfolderBase]: 6026/9358 cut-off events. [2023-11-21 21:01:31,809 INFO L125 PetriNetUnfolderBase]: For 3656/3878 co-relation queries the response was YES. [2023-11-21 21:01:31,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21662 conditions, 9358 events. 6026/9358 cut-off events. For 3656/3878 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 59907 event pairs, 1316 based on Foata normal form. 16/9066 useless extension candidates. Maximal degree in co-relation 21645. Up to 4503 conditions per place. [2023-11-21 21:01:31,886 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 5 changer transitions 45/124 dead transitions. [2023-11-21 21:01:31,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 602 flow [2023-11-21 21:01:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:01:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:01:31,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 350 transitions. [2023-11-21 21:01:31,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6529850746268657 [2023-11-21 21:01:31,889 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 350 transitions. [2023-11-21 21:01:31,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 350 transitions. [2023-11-21 21:01:31,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:31,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 350 transitions. [2023-11-21 21:01:31,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 43.75) internal successors, (350), 8 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:31,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:31,892 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:31,893 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 259 flow. Second operand 8 states and 350 transitions. [2023-11-21 21:01:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 602 flow [2023-11-21 21:01:32,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 124 transitions, 496 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-21 21:01:32,013 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 207 flow [2023-11-21 21:01:32,013 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=207, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-11-21 21:01:32,014 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2023-11-21 21:01:32,014 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 207 flow [2023-11-21 21:01:32,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:32,015 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:32,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:32,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-21 21:01:32,015 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-21 21:01:32,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:32,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1754123270, now seen corresponding path program 2 times [2023-11-21 21:01:32,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:32,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486236156] [2023-11-21 21:01:32,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:32,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:32,774 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-21 21:01:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:32,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486236156] [2023-11-21 21:01:32,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486236156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:32,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:32,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-21 21:01:32,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875643169] [2023-11-21 21:01:32,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:32,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-21 21:01:32,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:32,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-21 21:01:32,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-21 21:01:32,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-21 21:01:32,845 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 207 flow. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:32,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:32,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-21 21:01:32,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:34,090 INFO L124 PetriNetUnfolderBase]: 5199/8264 cut-off events. [2023-11-21 21:01:34,090 INFO L125 PetriNetUnfolderBase]: For 2541/2544 co-relation queries the response was YES. [2023-11-21 21:01:34,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19310 conditions, 8264 events. 5199/8264 cut-off events. For 2541/2544 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 55154 event pairs, 856 based on Foata normal form. 18/7931 useless extension candidates. Maximal degree in co-relation 19292. Up to 3467 conditions per place. [2023-11-21 21:01:34,144 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 41 selfloop transitions, 4 changer transitions 32/108 dead transitions. [2023-11-21 21:01:34,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 108 transitions, 488 flow [2023-11-21 21:01:34,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-21 21:01:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-21 21:01:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2023-11-21 21:01:34,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6231343283582089 [2023-11-21 21:01:34,146 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 334 transitions. [2023-11-21 21:01:34,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 334 transitions. [2023-11-21 21:01:34,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:34,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 334 transitions. [2023-11-21 21:01:34,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.75) internal successors, (334), 8 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:34,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:34,150 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:34,150 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 207 flow. Second operand 8 states and 334 transitions. [2023-11-21 21:01:34,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 108 transitions, 488 flow [2023-11-21 21:01:34,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 108 transitions, 478 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-21 21:01:34,155 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 212 flow [2023-11-21 21:01:34,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=212, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-11-21 21:01:34,156 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-21 21:01:34,156 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 212 flow [2023-11-21 21:01:34,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:34,157 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:34,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:34,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-21 21:01:34,158 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-21 21:01:34,158 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:34,158 INFO L85 PathProgramCache]: Analyzing trace with hash 2096969698, now seen corresponding path program 3 times [2023-11-21 21:01:34,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:34,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842898375] [2023-11-21 21:01:34,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:34,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:36,603 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-21 21:01:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842898375] [2023-11-21 21:01:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842898375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-21 21:01:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440452818] [2023-11-21 21:01:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:36,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-21 21:01:36,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:36,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-21 21:01:36,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-21 21:01:36,624 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-21 21:01:36,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 212 flow. Second operand has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:36,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:36,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-21 21:01:36,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:37,888 INFO L124 PetriNetUnfolderBase]: 3468/5819 cut-off events. [2023-11-21 21:01:37,888 INFO L125 PetriNetUnfolderBase]: For 883/997 co-relation queries the response was YES. [2023-11-21 21:01:37,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12927 conditions, 5819 events. 3468/5819 cut-off events. For 883/997 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 39545 event pairs, 984 based on Foata normal form. 39/5276 useless extension candidates. Maximal degree in co-relation 12906. Up to 2913 conditions per place. [2023-11-21 21:01:37,926 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 60 selfloop transitions, 13 changer transitions 14/124 dead transitions. [2023-11-21 21:01:37,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 124 transitions, 544 flow [2023-11-21 21:01:37,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-21 21:01:37,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-21 21:01:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 420 transitions. [2023-11-21 21:01:37,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6965174129353234 [2023-11-21 21:01:37,929 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 420 transitions. [2023-11-21 21:01:37,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 420 transitions. [2023-11-21 21:01:37,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:37,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 420 transitions. [2023-11-21 21:01:37,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 46.666666666666664) internal successors, (420), 9 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:37,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:37,933 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:37,934 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 212 flow. Second operand 9 states and 420 transitions. [2023-11-21 21:01:37,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 124 transitions, 544 flow [2023-11-21 21:01:37,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 124 transitions, 531 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-21 21:01:37,939 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 299 flow [2023-11-21 21:01:37,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2023-11-21 21:01:37,940 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 12 predicate places. [2023-11-21 21:01:37,940 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 299 flow [2023-11-21 21:01:37,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:37,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:37,941 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:37,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-21 21:01:37,941 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-21 21:01:37,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:37,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2011070890, now seen corresponding path program 4 times [2023-11-21 21:01:37,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:37,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495635148] [2023-11-21 21:01:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:37,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 21:01:38,254 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-21 21:01:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 21:01:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495635148] [2023-11-21 21:01:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495635148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 21:01:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 21:01:38,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 21:01:38,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443114098] [2023-11-21 21:01:38,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 21:01:38,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-21 21:01:38,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 21:01:38,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 21:01:38,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 21:01:38,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-21 21:01:38,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 299 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:38,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-21 21:01:38,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-21 21:01:38,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-21 21:01:38,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_43 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_42 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_43)) (= (ite .cse2 0 v_~x$w_buff0_used~0_52) v_~x$w_buff0_used~0_51) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= (ite .cse2 v_~x$w_buff0~0_12 (ite .cse0 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][47], [42#L818true, 262#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 16#L788true, Black: 192#(and (= ~a~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P2Thread1of1ForFork1InUse, 186#(= ~a~0 1), P3Thread1of1ForFork3InUse, Black: 188#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P1Thread1of1ForFork2InUse, 52#L831true, 125#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 158#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork0InUse, 208#(= ~z~0 1), 49#L765true, Black: 247#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (<= (div ~x$w_buff0_used~0 256) 0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (= ~x$r_buff1_thd1~0 0)), 22#L865-3true, Black: 236#(and (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 241#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 243#(and (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), 228#true, Black: 245#(and (<= 1 ~main$tmp_guard1~0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0))]) [2023-11-21 21:01:38,898 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-11-21 21:01:38,898 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 21:01:38,898 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 21:01:38,898 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-11-21 21:01:39,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_43 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_42 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_43)) (= (ite .cse2 0 v_~x$w_buff0_used~0_52) v_~x$w_buff0_used~0_51) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= (ite .cse2 v_~x$w_buff0~0_12 (ite .cse0 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][47], [42#L818true, 8#L866true, 262#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 16#L788true, Black: 192#(and (= ~a~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P2Thread1of1ForFork1InUse, 186#(= ~a~0 1), P3Thread1of1ForFork3InUse, Black: 188#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 52#L831true, P1Thread1of1ForFork2InUse, 125#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), 158#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256))), P0Thread1of1ForFork0InUse, 208#(= ~z~0 1), 49#L765true, Black: 247#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (<= (div ~x$w_buff0_used~0 256) 0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (= ~x$r_buff1_thd1~0 0)), Black: 236#(and (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 241#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 228#true, Black: 243#(and (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 245#(and (<= 1 ~main$tmp_guard1~0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0))]) [2023-11-21 21:01:39,007 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-11-21 21:01:39,007 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 21:01:39,007 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 21:01:39,008 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-11-21 21:01:39,160 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_43 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_42 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_43)) (= (ite .cse2 0 v_~x$w_buff0_used~0_52) v_~x$w_buff0_used~0_51) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= (ite .cse2 v_~x$w_buff0~0_12 (ite .cse0 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][47], [262#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 16#L788true, Black: 192#(and (= ~a~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P2Thread1of1ForFork1InUse, 186#(= ~a~0 1), P3Thread1of1ForFork3InUse, Black: 188#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P1Thread1of1ForFork2InUse, 52#L831true, 125#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), P0Thread1of1ForFork0InUse, 17#P2EXITtrue, 208#(= ~z~0 1), 49#L765true, Black: 247#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (<= (div ~x$w_buff0_used~0 256) 0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (= ~x$r_buff1_thd1~0 0)), 22#L865-3true, Black: 236#(and (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 176#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 241#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), Black: 243#(and (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), 228#true, Black: 245#(and (<= 1 ~main$tmp_guard1~0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0))]) [2023-11-21 21:01:39,160 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-11-21 21:01:39,160 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 21:01:39,161 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 21:01:39,161 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-11-21 21:01:39,240 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([450] L758-->L765: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_51 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_22 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_52 256) 0)) .cse5)) (.cse0 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_43 256) 0)))) (.cse1 (and .cse4 .cse5))) (and (= v_~x$w_buff1_used~0_42 (ite (or .cse0 .cse1) 0 v_~x$w_buff1_used~0_43)) (= (ite .cse2 0 v_~x$w_buff0_used~0_52) v_~x$w_buff0_used~0_51) (= v_~x$r_buff1_thd1~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_42 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd1~0_21 256) 0)))) 0 v_~x$r_buff1_thd1~0_20)) (= (ite .cse2 v_~x$w_buff0~0_12 (ite .cse0 v_~x$w_buff1~0_11 v_~x~0_20)) v_~x~0_19) (= v_~x$r_buff0_thd1~0_21 (ite .cse1 0 v_~x$r_buff0_thd1~0_22))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_22, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_43, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_20, ~x~0=v_~x~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_52} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_12, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_21, ~x$w_buff1~0=v_~x$w_buff1~0_11, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x~0=v_~x~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_51} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][47], [8#L866true, 262#(and (= ~__unbuffered_p1_EAX~0 1) (= ~y~0 1)), 16#L788true, Black: 192#(and (= ~a~0 1) (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), P2Thread1of1ForFork1InUse, 186#(= ~a~0 1), P3Thread1of1ForFork3InUse, Black: 188#(and (or (not (= 2 ~x$w_buff0~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~x$w_buff1~0))) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))))))), 52#L831true, P1Thread1of1ForFork2InUse, 125#(and (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t145~0#1.base|)) (not (= |ULTIMATE.start_main_~#t145~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t148~0#1.base| 0) |ULTIMATE.start_main_~#t145~0#1.base| 0) |ULTIMATE.start_main_~#t147~0#1.base| 0) |ULTIMATE.start_main_~#t146~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t148~0#1.base|)) (not (= |ULTIMATE.start_main_~#t148~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|)) (not (= |ULTIMATE.start_main_~#t146~0#1.base| |ULTIMATE.start_main_~#t147~0#1.base|))), P0Thread1of1ForFork0InUse, 208#(= ~z~0 1), 17#P2EXITtrue, 49#L765true, Black: 247#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 231#(and (<= (div ~x$w_buff0_used~0 256) 0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= 1 ~x$w_buff0_used~0) (= 1 ~x$r_buff0_thd2~0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0) (= ~x$r_buff1_thd1~0 0)), Black: 236#(and (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 241#(and (= ~x~0 0) (= 0 ~x$r_buff0_thd4~0) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$w_buff0~0) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0)), 176#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), 228#true, Black: 243#(and (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0)), Black: 245#(and (<= 1 ~main$tmp_guard1~0) (= 0 ~x$r_buff0_thd4~0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd3~0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0)) (= ~x$r_buff1_thd1~0 0))]) [2023-11-21 21:01:39,240 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-11-21 21:01:39,241 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-21 21:01:39,241 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-21 21:01:39,241 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-11-21 21:01:39,759 INFO L124 PetriNetUnfolderBase]: 6675/11527 cut-off events. [2023-11-21 21:01:39,759 INFO L125 PetriNetUnfolderBase]: For 7528/8107 co-relation queries the response was YES. [2023-11-21 21:01:39,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29522 conditions, 11527 events. 6675/11527 cut-off events. For 7528/8107 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 90940 event pairs, 2612 based on Foata normal form. 25/10605 useless extension candidates. Maximal degree in co-relation 29497. Up to 4154 conditions per place. [2023-11-21 21:01:39,839 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 28 selfloop transitions, 1 changer transitions 45/109 dead transitions. [2023-11-21 21:01:39,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 109 transitions, 557 flow [2023-11-21 21:01:39,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 21:01:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-21 21:01:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-21 21:01:39,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-21 21:01:39,842 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-21 21:01:39,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-21 21:01:39,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 21:01:39,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-21 21:01:39,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:39,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:39,845 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:39,846 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 299 flow. Second operand 6 states and 276 transitions. [2023-11-21 21:01:39,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 109 transitions, 557 flow [2023-11-21 21:01:39,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 109 transitions, 551 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-21 21:01:39,856 INFO L231 Difference]: Finished difference. Result has 91 places, 61 transitions, 231 flow [2023-11-21 21:01:39,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=91, PETRI_TRANSITIONS=61} [2023-11-21 21:01:39,857 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 17 predicate places. [2023-11-21 21:01:39,857 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 61 transitions, 231 flow [2023-11-21 21:01:39,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-21 21:01:39,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-21 21:01:39,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:39,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-21 21:01:39,858 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-21 21:01:39,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 21:01:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -165758494, now seen corresponding path program 5 times [2023-11-21 21:01:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 21:01:39,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115654181] [2023-11-21 21:01:39,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 21:01:39,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 21:01:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:39,934 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 21:01:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 21:01:40,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 21:01:40,062 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-21 21:01:40,064 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-21 21:01:40,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-21 21:01:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-21 21:01:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-21 21:01:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-21 21:01:40,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-21 21:01:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-21 21:01:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-21 21:01:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-21 21:01:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-21 21:01:40,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-21 21:01:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-21 21:01:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-21 21:01:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-21 21:01:40,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-21 21:01:40,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-21 21:01:40,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-21 21:01:40,071 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 21:01:40,078 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-21 21:01:40,079 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-21 21:01:40,166 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-21 21:01:40,168 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-21 21:01:40,171 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-21 21:01:40,173 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-21 21:01:40,191 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 21:01:40,192 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-21 21:01:40,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 09:01:40 BasicIcfg [2023-11-21 21:01:40,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-21 21:01:40,209 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-21 21:01:40,210 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-21 21:01:40,210 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-21 21:01:40,210 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 09:01:08" (3/4) ... [2023-11-21 21:01:40,212 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-21 21:01:40,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-21 21:01:40,214 INFO L158 Benchmark]: Toolchain (without parser) took 33494.24ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 94.7MB in the beginning and 999.4MB in the end (delta: -904.8MB). Peak memory consumption was 558.1MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,215 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 113.2MB. Free memory was 81.2MB in the beginning and 81.1MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:01:40,215 INFO L158 Benchmark]: CACSL2BoogieTranslator took 835.71ms. Allocated memory is still 140.5MB. Free memory was 94.7MB in the beginning and 105.5MB in the end (delta: -10.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,215 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.92ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,216 INFO L158 Benchmark]: Boogie Preprocessor took 46.52ms. Allocated memory is still 140.5MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,216 INFO L158 Benchmark]: RCFGBuilder took 1210.41ms. Allocated memory is still 140.5MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,217 INFO L158 Benchmark]: TraceAbstraction took 31313.04ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.9MB in the beginning and 999.4MB in the end (delta: -902.6MB). Peak memory consumption was 557.9MB. Max. memory is 16.1GB. [2023-11-21 21:01:40,217 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 1.6GB. Free memory is still 999.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-21 21:01:40,219 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.64ms. Allocated memory is still 113.2MB. Free memory was 81.2MB in the beginning and 81.1MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 835.71ms. Allocated memory is still 140.5MB. Free memory was 94.7MB in the beginning and 105.5MB in the end (delta: -10.9MB). Peak memory consumption was 27.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.92ms. Allocated memory is still 140.5MB. Free memory was 104.9MB in the beginning and 102.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.52ms. Allocated memory is still 140.5MB. Free memory was 102.1MB in the beginning and 100.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1210.41ms. Allocated memory is still 140.5MB. Free memory was 100.0MB in the beginning and 97.7MB in the end (delta: 2.3MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31313.04ms. Allocated memory was 140.5MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.9MB in the beginning and 999.4MB in the end (delta: -902.6MB). Peak memory consumption was 557.9MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 1.6GB. Free memory is still 999.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t145; [L859] FCALL, FORK 0 pthread_create(&t145, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={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] [L860] 0 pthread_t t146; [L861] FCALL, FORK 0 pthread_create(&t146, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t145={5:0}, t146={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] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t147; [L863] FCALL, FORK 0 pthread_create(&t147, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t145={5:0}, t146={6:0}, t147={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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t148; [L865] FCALL, FORK 0 pthread_create(&t148, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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, t145={5:0}, t146={6:0}, t147={7:0}, t148={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=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 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) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 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 [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L813] 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) [L814] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L815] 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 [L816] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L817] 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_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 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) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 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 [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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$$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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, t145={5:0}, t146={6:0}, t147={7:0}, t148={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=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 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 [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 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 [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, t145={5:0}, t146={6:0}, t147={7:0}, t148={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=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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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, t145={5:0}, t146={6:0}, t147={7:0}, t148={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix005_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __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=2, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: 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: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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. - 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: 861]: 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: 859]: 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, 101 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: 31.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1231 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1041 mSDsluCounter, 306 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 260 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2945 IncrementalHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 46 mSDtfsCounter, 2945 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=17, InterpolantAutomatonStates: 88, 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.8s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 350 ConstructedInterpolants, 0 QuantifiedInterpolants, 2570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-21 21:01:40,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 21:01:43,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 21:01:43,174 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-21 21:01:43,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 21:01:43,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 21:01:43,229 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 21:01:43,230 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 21:01:43,231 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 21:01:43,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-21 21:01:43,237 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-21 21:01:43,238 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 21:01:43,238 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 21:01:43,239 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 21:01:43,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 21:01:43,241 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 21:01:43,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 21:01:43,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 21:01:43,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 21:01:43,243 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-21 21:01:43,244 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-21 21:01:43,244 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-21 21:01:43,245 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-21 21:01:43,245 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-21 21:01:43,245 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-21 21:01:43,246 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-21 21:01:43,246 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 21:01:43,247 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 21:01:43,247 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 21:01:43,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 21:01:43,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 21:01:43,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-21 21:01:43,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-21 21:01:43,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:43,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 21:01:43,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-21 21:01:43,252 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-21 21:01:43,252 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-21 21:01:43,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-21 21:01:43,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-21 21:01:43,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-21 21:01:43,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-21 21:01:43,259 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-21 21:01:43,259 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_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/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_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c22ca6d642b28badc1dc02a5cc527ddbb1f35b5d6d2e3ba3e8f314e81f0fd465 [2023-11-21 21:01:43,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 21:01:43,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 21:01:43,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 21:01:43,763 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 21:01:43,764 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 21:01:43,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-21 21:01:47,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 21:01:47,555 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 21:01:47,556 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/sv-benchmarks/c/pthread-wmm/mix005_tso.oepc.i [2023-11-21 21:01:47,575 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/cbccdc1df/bc9700b2ef6c41948a3df7e0128791bc/FLAG87c71be8e [2023-11-21 21:01:47,594 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/data/cbccdc1df/bc9700b2ef6c41948a3df7e0128791bc [2023-11-21 21:01:47,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 21:01:47,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 21:01:47,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:47,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 21:01:47,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 21:01:47,616 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:47" (1/1) ... [2023-11-21 21:01:47,617 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55b11765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:47, skipping insertion in model container [2023-11-21 21:01:47,617 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 09:01:47" (1/1) ... [2023-11-21 21:01:47,707 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 21:01:48,353 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:48,387 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 21:01:48,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 21:01:48,577 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:01:48,578 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-21 21:01:48,586 INFO L206 MainTranslator]: Completed translation [2023-11-21 21:01:48,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48 WrapperNode [2023-11-21 21:01:48,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 21:01:48,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:48,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 21:01:48,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 21:01:48,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,648 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,712 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-21 21:01:48,716 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 21:01:48,717 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 21:01:48,719 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 21:01:48,719 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 21:01:48,730 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,750 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,793 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,796 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 21:01:48,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 21:01:48,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 21:01:48,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 21:01:48,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 09:01:48" (1/1) ... [2023-11-21 21:01:48,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-21 21:01:48,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 21:01:48,881 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-21 21:01:48,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_dd526647-c71b-411f-a0d0-ecd29057c012/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-21 21:01:48,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-21 21:01:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 21:01:48,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 21:01:48,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 21:01:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-21 21:01:48,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-21 21:01:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-21 21:01:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-21 21:01:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-21 21:01:48,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-21 21:01:48,956 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-21 21:01:48,958 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-21 21:01:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-21 21:01:48,959 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-21 21:01:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-21 21:01:48,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 21:01:48,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 21:01:48,962 WARN L212 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-21 21:01:49,225 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 21:01:49,228 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation