./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:42:56,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:42:57,009 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 21:42:57,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:42:57,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:42:57,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:42:57,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:42:57,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:42:57,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:42:57,051 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:42:57,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:42:57,053 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:42:57,054 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:42:57,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:42:57,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:42:57,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:42:57,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:42:57,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:42:57,059 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:42:57,060 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:42:57,060 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:42:57,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:42:57,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:42:57,070 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:42:57,071 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:42:57,072 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:42:57,077 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:42:57,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:42:57,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:42:57,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:42:57,080 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:42:57,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:42:57,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:42:57,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:42:57,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:42:57,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:42:57,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:42:57,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:42:57,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:42:57,099 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_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/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_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2023-11-23 21:42:57,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:42:57,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:42:57,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:42:57,467 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:42:57,468 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:42:57,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-23 21:43:00,714 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:43:01,043 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:43:01,044 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-23 21:43:01,069 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/bdf4cdf06/1a9a6e5dede640c2bd27345b816d7ca4/FLAG9d7189508 [2023-11-23 21:43:01,089 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/bdf4cdf06/1a9a6e5dede640c2bd27345b816d7ca4 [2023-11-23 21:43:01,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:43:01,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:43:01,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:01,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:43:01,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:43:01,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:01,117 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b901838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01, skipping insertion in model container [2023-11-23 21:43:01,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:01,200 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:43:01,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:01,695 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:43:01,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:01,903 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:01,904 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:01,914 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:43:01,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01 WrapperNode [2023-11-23 21:43:01,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:01,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:01,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:43:01,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:43:01,931 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:01,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,021 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-23 21:43:02,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:02,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:43:02,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:43:02,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:43:02,040 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,057 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,065 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,070 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:43:02,077 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:43:02,077 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:43:02,078 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:43:02,079 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (1/1) ... [2023-11-23 21:43:02,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:02,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:02,150 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:43:02,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:43:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:43:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:43:02,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:43:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:43:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:43:02,212 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:43:02,212 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:43:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:43:02,213 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:43:02,213 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:43:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:43:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:43:02,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:43:02,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:43:02,218 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:43:02,479 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:43:02,482 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:43:03,118 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:43:03,540 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:43:03,540 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:43:03,541 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:03 BoogieIcfgContainer [2023-11-23 21:43:03,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:43:03,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:43:03,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:43:03,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:43:03,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:01" (1/3) ... [2023-11-23 21:43:03,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c4ec76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:03, skipping insertion in model container [2023-11-23 21:43:03,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:01" (2/3) ... [2023-11-23 21:43:03,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c4ec76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:03, skipping insertion in model container [2023-11-23 21:43:03,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:03" (3/3) ... [2023-11-23 21:43:03,566 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-11-23 21:43:03,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:43:03,594 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-23 21:43:03,594 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:43:03,679 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:43:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-23 21:43:03,810 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-23 21:43:03,810 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:03,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-23 21:43:03,819 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-23 21:43:03,829 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-23 21:43:03,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:43:03,860 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;@551c424, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:43:03,860 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-23 21:43:03,865 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:43:03,865 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 21:43:03,865 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:03,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:03,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:43:03,868 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:03,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:03,875 INFO L85 PathProgramCache]: Analyzing trace with hash 12502, now seen corresponding path program 1 times [2023-11-23 21:43:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:03,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455974783] [2023-11-23 21:43:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:04,246 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-23 21:43:04,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:04,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455974783] [2023-11-23 21:43:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455974783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:04,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895256970] [2023-11-23 21:43:04,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:04,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:04,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:04,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:04,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:04,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:04,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:04,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:04,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:04,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:05,073 INFO L124 PetriNetUnfolderBase]: 772/1598 cut-off events. [2023-11-23 21:43:05,073 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 21:43:05,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1598 events. 772/1598 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11268 event pairs, 580 based on Foata normal form. 90/1503 useless extension candidates. Maximal degree in co-relation 2797. Up to 888 conditions per place. [2023-11-23 21:43:05,108 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-23 21:43:05,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 181 flow [2023-11-23 21:43:05,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:05,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:05,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:05,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,155 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:05,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 181 flow [2023-11-23 21:43:05,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 21:43:05,172 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-23 21:43:05,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-23 21:43:05,180 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-23 21:43:05,180 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-23 21:43:05,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:05,182 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:43:05,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:43:05,183 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:05,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:05,185 INFO L85 PathProgramCache]: Analyzing trace with hash 12503, now seen corresponding path program 1 times [2023-11-23 21:43:05,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:05,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869365101] [2023-11-23 21:43:05,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:05,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:05,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:05,355 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-23 21:43:05,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:05,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869365101] [2023-11-23 21:43:05,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869365101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:05,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:05,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:05,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879277784] [2023-11-23 21:43:05,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:05,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:05,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:05,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:05,377 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:05,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:05,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:05,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:05,762 INFO L124 PetriNetUnfolderBase]: 772/1597 cut-off events. [2023-11-23 21:43:05,763 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:05,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1597 events. 772/1597 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11358 event pairs, 580 based on Foata normal form. 1/1413 useless extension candidates. Maximal degree in co-relation 2842. Up to 887 conditions per place. [2023-11-23 21:43:05,787 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-23 21:43:05,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 178 flow [2023-11-23 21:43:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:05,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:05,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:05,795 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:05,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:05,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:05,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,799 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,800 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:05,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 178 flow [2023-11-23 21:43:05,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:05,806 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-23 21:43:05,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-23 21:43:05,807 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-23 21:43:05,808 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-23 21:43:05,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:05,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:43:05,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:43:05,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:05,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash 372826061, now seen corresponding path program 1 times [2023-11-23 21:43:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:05,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927357857] [2023-11-23 21:43:05,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:05,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:05,919 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-23 21:43:05,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:05,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927357857] [2023-11-23 21:43:05,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927357857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:05,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:05,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:05,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334025268] [2023-11-23 21:43:05,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:05,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:05,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:05,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:05,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:05,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:05,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:05,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:05,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:05,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:06,423 INFO L124 PetriNetUnfolderBase]: 774/1596 cut-off events. [2023-11-23 21:43:06,424 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 1596 events. 774/1596 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11285 event pairs, 438 based on Foata normal form. 0/1417 useless extension candidates. Maximal degree in co-relation 2846. Up to 888 conditions per place. [2023-11-23 21:43:06,444 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-23 21:43:06,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 178 flow [2023-11-23 21:43:06,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 21:43:06,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-23 21:43:06,452 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 21:43:06,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 21:43:06,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:06,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 21:43:06,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:06,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:06,461 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:06,461 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 118 transitions. [2023-11-23 21:43:06,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 178 flow [2023-11-23 21:43:06,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:06,468 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-23 21:43:06,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-23 21:43:06,471 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-23 21:43:06,471 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-23 21:43:06,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:06,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:06,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:43:06,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:43:06,473 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:06,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:06,475 INFO L85 PathProgramCache]: Analyzing trace with hash 372826062, now seen corresponding path program 1 times [2023-11-23 21:43:06,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:06,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882865318] [2023-11-23 21:43:06,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:06,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:06,659 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-23 21:43:06,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:06,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882865318] [2023-11-23 21:43:06,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882865318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:06,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:06,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:06,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822314146] [2023-11-23 21:43:06,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:06,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:06,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:06,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:06,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:06,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:06,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:06,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:07,107 INFO L124 PetriNetUnfolderBase]: 772/1591 cut-off events. [2023-11-23 21:43:07,108 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 21:43:07,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2849 conditions, 1591 events. 772/1591 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11264 event pairs, 438 based on Foata normal form. 3/1417 useless extension candidates. Maximal degree in co-relation 2839. Up to 883 conditions per place. [2023-11-23 21:43:07,128 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-23 21:43:07,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 174 flow [2023-11-23 21:43:07,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:07,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:07,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:07,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:07,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:07,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:07,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,135 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:07,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 174 flow [2023-11-23 21:43:07,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:07,139 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-23 21:43:07,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-23 21:43:07,142 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-23 21:43:07,142 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-23 21:43:07,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:07,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:07,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:43:07,144 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:07,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:07,144 INFO L85 PathProgramCache]: Analyzing trace with hash 76132508, now seen corresponding path program 1 times [2023-11-23 21:43:07,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:07,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146847480] [2023-11-23 21:43:07,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:07,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:07,234 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-23 21:43:07,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:07,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146847480] [2023-11-23 21:43:07,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146847480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:07,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:07,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885282913] [2023-11-23 21:43:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:07,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:07,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:07,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:07,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:07,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:07,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:07,588 INFO L124 PetriNetUnfolderBase]: 794/1589 cut-off events. [2023-11-23 21:43:07,589 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 21:43:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 1589 events. 794/1589 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10988 event pairs, 468 based on Foata normal form. 0/1440 useless extension candidates. Maximal degree in co-relation 2874. Up to 890 conditions per place. [2023-11-23 21:43:07,603 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-23 21:43:07,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 174 flow [2023-11-23 21:43:07,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 21:43:07,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-23 21:43:07,605 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 21:43:07,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 21:43:07,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:07,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 21:43:07,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,608 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,608 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 118 transitions. [2023-11-23 21:43:07,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 174 flow [2023-11-23 21:43:07,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:07,611 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-23 21:43:07,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-23 21:43:07,612 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-23 21:43:07,613 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-23 21:43:07,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:07,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:07,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:43:07,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:07,614 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 76132509, now seen corresponding path program 1 times [2023-11-23 21:43:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870867085] [2023-11-23 21:43:07,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:07,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:07,695 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-23 21:43:07,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:07,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870867085] [2023-11-23 21:43:07,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870867085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:07,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16429098] [2023-11-23 21:43:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:07,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:07,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:07,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:07,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:07,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:07,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:08,019 INFO L124 PetriNetUnfolderBase]: 772/1492 cut-off events. [2023-11-23 21:43:08,020 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-23 21:43:08,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1492 events. 772/1492 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10441 event pairs, 456 based on Foata normal form. 15/1382 useless extension candidates. Maximal degree in co-relation 2752. Up to 853 conditions per place. [2023-11-23 21:43:08,034 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-23 21:43:08,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-23 21:43:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:08,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:08,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:08,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:08,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:08,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:08,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:08,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:08,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,039 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:08,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-23 21:43:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:08,045 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-23 21:43:08,045 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-23 21:43:08,048 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-23 21:43:08,048 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-23 21:43:08,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,049 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:08,049 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:08,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:43:08,049 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:08,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:08,051 INFO L85 PathProgramCache]: Analyzing trace with hash 76133552, now seen corresponding path program 1 times [2023-11-23 21:43:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095155320] [2023-11-23 21:43:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:08,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:08,228 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-23 21:43:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:08,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095155320] [2023-11-23 21:43:08,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095155320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:08,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:08,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:08,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503937700] [2023-11-23 21:43:08,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:08,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:08,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:08,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:08,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:08,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-23 21:43:08,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:08,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-23 21:43:08,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:08,497 INFO L124 PetriNetUnfolderBase]: 603/1140 cut-off events. [2023-11-23 21:43:08,497 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:08,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 1140 events. 603/1140 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7057 event pairs, 192 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 2135. Up to 742 conditions per place. [2023-11-23 21:43:08,509 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-23 21:43:08,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-23 21:43:08,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-23 21:43:08,512 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7696969696969697 [2023-11-23 21:43:08,512 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-23 21:43:08,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-23 21:43:08,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:08,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-23 21:43:08,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,514 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,515 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,515 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 127 transitions. [2023-11-23 21:43:08,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-23 21:43:08,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:08,518 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-23 21:43:08,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-23 21:43:08,519 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-23 21:43:08,519 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-23 21:43:08,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:08,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:08,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:08,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:43:08,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:08,522 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:08,522 INFO L85 PathProgramCache]: Analyzing trace with hash -525413068, now seen corresponding path program 1 times [2023-11-23 21:43:08,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:08,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688746683] [2023-11-23 21:43:08,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:08,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:09,152 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-23 21:43:09,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:09,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688746683] [2023-11-23 21:43:09,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688746683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:09,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:09,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:43:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347420600] [2023-11-23 21:43:09,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:09,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:43:09,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:43:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:43:09,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:09,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:09,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:09,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:09,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:09,916 INFO L124 PetriNetUnfolderBase]: 721/1359 cut-off events. [2023-11-23 21:43:09,916 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-23 21:43:09,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2577 conditions, 1359 events. 721/1359 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8495 event pairs, 10 based on Foata normal form. 48/1380 useless extension candidates. Maximal degree in co-relation 2565. Up to 702 conditions per place. [2023-11-23 21:43:09,928 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 34 selfloop transitions, 4 changer transitions 10/66 dead transitions. [2023-11-23 21:43:09,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 244 flow [2023-11-23 21:43:09,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:43:09,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:43:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-23 21:43:09,931 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2023-11-23 21:43:09,931 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-23 21:43:09,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-23 21:43:09,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:09,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-23 21:43:09,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:09,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:09,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:09,935 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 7 states and 238 transitions. [2023-11-23 21:43:09,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 244 flow [2023-11-23 21:43:09,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:09,942 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 92 flow [2023-11-23 21:43:09,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=92, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-11-23 21:43:09,946 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-23 21:43:09,946 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 92 flow [2023-11-23 21:43:09,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:09,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:09,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:09,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:43:09,948 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:09,948 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:09,948 INFO L85 PathProgramCache]: Analyzing trace with hash -525413606, now seen corresponding path program 1 times [2023-11-23 21:43:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758913952] [2023-11-23 21:43:09,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:43:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758913952] [2023-11-23 21:43:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758913952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:10,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:43:10,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923536027] [2023-11-23 21:43:10,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:10,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:43:10,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:10,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:43:10,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:43:10,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:10,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:10,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:10,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:10,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:10,689 INFO L124 PetriNetUnfolderBase]: 1213/2160 cut-off events. [2023-11-23 21:43:10,690 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-23 21:43:10,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4086 conditions, 2160 events. 1213/2160 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13799 event pairs, 147 based on Foata normal form. 80/2172 useless extension candidates. Maximal degree in co-relation 4075. Up to 1081 conditions per place. [2023-11-23 21:43:10,710 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 39 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-23 21:43:10,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 236 flow [2023-11-23 21:43:10,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:43:10,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:43:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2023-11-23 21:43:10,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-23 21:43:10,713 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 155 transitions. [2023-11-23 21:43:10,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 155 transitions. [2023-11-23 21:43:10,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:10,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 155 transitions. [2023-11-23 21:43:10,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:10,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:10,715 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:10,716 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 92 flow. Second operand 4 states and 155 transitions. [2023-11-23 21:43:10,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 236 flow [2023-11-23 21:43:10,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 225 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:10,722 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 119 flow [2023-11-23 21:43:10,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=119, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-23 21:43:10,724 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-23 21:43:10,724 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 119 flow [2023-11-23 21:43:10,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:10,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:10,725 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] [2023-11-23 21:43:10,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:43:10,725 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:10,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:10,726 INFO L85 PathProgramCache]: Analyzing trace with hash 27692455, now seen corresponding path program 1 times [2023-11-23 21:43:10,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958337799] [2023-11-23 21:43:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:10,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:11,005 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-23 21:43:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:11,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958337799] [2023-11-23 21:43:11,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958337799] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:11,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:11,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:43:11,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845984059] [2023-11-23 21:43:11,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:11,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:43:11,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:43:11,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:43:11,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:11,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:11,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:11,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:11,374 INFO L124 PetriNetUnfolderBase]: 809/1456 cut-off events. [2023-11-23 21:43:11,374 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-11-23 21:43:11,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3268 conditions, 1456 events. 809/1456 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8232 event pairs, 73 based on Foata normal form. 68/1479 useless extension candidates. Maximal degree in co-relation 3255. Up to 521 conditions per place. [2023-11-23 21:43:11,385 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 49 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2023-11-23 21:43:11,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 322 flow [2023-11-23 21:43:11,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:43:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:43:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2023-11-23 21:43:11,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-23 21:43:11,387 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 195 transitions. [2023-11-23 21:43:11,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 195 transitions. [2023-11-23 21:43:11,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:11,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 195 transitions. [2023-11-23 21:43:11,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,390 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,390 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,390 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 119 flow. Second operand 5 states and 195 transitions. [2023-11-23 21:43:11,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 322 flow [2023-11-23 21:43:11,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:11,394 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 159 flow [2023-11-23 21:43:11,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-23 21:43:11,395 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-23 21:43:11,396 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 159 flow [2023-11-23 21:43:11,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:11,396 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:11,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:43:11,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:11,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:11,397 INFO L85 PathProgramCache]: Analyzing trace with hash -968843194, now seen corresponding path program 1 times [2023-11-23 21:43:11,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:11,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563375468] [2023-11-23 21:43:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:11,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:11,723 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-23 21:43:11,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:11,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563375468] [2023-11-23 21:43:11,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563375468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:11,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323033371] [2023-11-23 21:43:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:11,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:11,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:11,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:11,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:11,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:11,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:11,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:11,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:12,019 INFO L124 PetriNetUnfolderBase]: 477/840 cut-off events. [2023-11-23 21:43:12,019 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-23 21:43:12,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2158 conditions, 840 events. 477/840 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3824 event pairs, 59 based on Foata normal form. 36/841 useless extension candidates. Maximal degree in co-relation 2143. Up to 268 conditions per place. [2023-11-23 21:43:12,026 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 43 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-23 21:43:12,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 333 flow [2023-11-23 21:43:12,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:12,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-23 21:43:12,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2023-11-23 21:43:12,029 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-23 21:43:12,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-23 21:43:12,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:12,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-23 21:43:12,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,033 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 159 flow. Second operand 6 states and 219 transitions. [2023-11-23 21:43:12,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 333 flow [2023-11-23 21:43:12,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:12,039 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 173 flow [2023-11-23 21:43:12,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=173, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2023-11-23 21:43:12,040 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2023-11-23 21:43:12,040 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 173 flow [2023-11-23 21:43:12,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:12,041 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] [2023-11-23 21:43:12,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:43:12,041 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:12,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 57969529, now seen corresponding path program 1 times [2023-11-23 21:43:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845063684] [2023-11-23 21:43:12,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:12,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:12,424 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-23 21:43:12,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:12,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845063684] [2023-11-23 21:43:12,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845063684] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:12,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:12,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:43:12,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936006281] [2023-11-23 21:43:12,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:12,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:12,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:12,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:12,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-23 21:43:12,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 173 flow. Second operand has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:12,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-23 21:43:12,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:12,886 INFO L124 PetriNetUnfolderBase]: 800/1462 cut-off events. [2023-11-23 21:43:12,886 INFO L125 PetriNetUnfolderBase]: For 612/623 co-relation queries the response was YES. [2023-11-23 21:43:12,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3413 conditions, 1462 events. 800/1462 cut-off events. For 612/623 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7801 event pairs, 179 based on Foata normal form. 8/1424 useless extension candidates. Maximal degree in co-relation 3397. Up to 722 conditions per place. [2023-11-23 21:43:12,898 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 48 selfloop transitions, 9 changer transitions 10/89 dead transitions. [2023-11-23 21:43:12,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 416 flow [2023-11-23 21:43:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:43:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:43:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2023-11-23 21:43:12,901 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2023-11-23 21:43:12,901 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 250 transitions. [2023-11-23 21:43:12,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 250 transitions. [2023-11-23 21:43:12,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:12,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 250 transitions. [2023-11-23 21:43:12,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,905 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 55.0) internal successors, (440), 8 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,905 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 173 flow. Second operand 7 states and 250 transitions. [2023-11-23 21:43:12,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 416 flow [2023-11-23 21:43:12,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 352 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-23 21:43:12,915 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 183 flow [2023-11-23 21:43:12,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=183, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-23 21:43:12,916 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2023-11-23 21:43:12,916 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 183 flow [2023-11-23 21:43:12,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.333333333333332) internal successors, (176), 6 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:12,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:12,917 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] [2023-11-23 21:43:12,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:43:12,917 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:12,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:12,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1495297993, now seen corresponding path program 2 times [2023-11-23 21:43:12,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:12,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252954147] [2023-11-23 21:43:12,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:12,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:13,266 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-23 21:43:13,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:13,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252954147] [2023-11-23 21:43:13,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252954147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:13,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:13,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:43:13,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051003386] [2023-11-23 21:43:13,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:13,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:13,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:13,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:13,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:13,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-23 21:43:13,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 183 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:13,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:13,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-23 21:43:13,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:13,735 INFO L124 PetriNetUnfolderBase]: 904/1748 cut-off events. [2023-11-23 21:43:13,735 INFO L125 PetriNetUnfolderBase]: For 383/394 co-relation queries the response was YES. [2023-11-23 21:43:13,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3846 conditions, 1748 events. 904/1748 cut-off events. For 383/394 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 10447 event pairs, 214 based on Foata normal form. 8/1672 useless extension candidates. Maximal degree in co-relation 3829. Up to 608 conditions per place. [2023-11-23 21:43:13,755 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 26 selfloop transitions, 1 changer transitions 28/81 dead transitions. [2023-11-23 21:43:13,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 81 transitions, 361 flow [2023-11-23 21:43:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:13,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-23 21:43:13,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2023-11-23 21:43:13,758 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-23 21:43:13,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-23 21:43:13,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:13,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-23 21:43:13,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:13,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:13,761 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:13,761 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 183 flow. Second operand 6 states and 219 transitions. [2023-11-23 21:43:13,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 81 transitions, 361 flow [2023-11-23 21:43:13,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 355 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:13,767 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 156 flow [2023-11-23 21:43:13,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2023-11-23 21:43:13,768 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2023-11-23 21:43:13,769 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 156 flow [2023-11-23 21:43:13,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:13,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:13,770 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] [2023-11-23 21:43:13,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:43:13,770 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:13,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2097533729, now seen corresponding path program 3 times [2023-11-23 21:43:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:13,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643855478] [2023-11-23 21:43:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:15,575 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-23 21:43:15,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:15,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643855478] [2023-11-23 21:43:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643855478] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:15,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:43:15,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586425318] [2023-11-23 21:43:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:15,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:43:15,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:15,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:43:15,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:43:15,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:15,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:15,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:15,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:15,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:16,244 INFO L124 PetriNetUnfolderBase]: 456/942 cut-off events. [2023-11-23 21:43:16,244 INFO L125 PetriNetUnfolderBase]: For 116/116 co-relation queries the response was YES. [2023-11-23 21:43:16,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 942 events. 456/942 cut-off events. For 116/116 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4981 event pairs, 81 based on Foata normal form. 8/884 useless extension candidates. Maximal degree in co-relation 1985. Up to 200 conditions per place. [2023-11-23 21:43:16,251 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 29 selfloop transitions, 4 changer transitions 23/84 dead transitions. [2023-11-23 21:43:16,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 358 flow [2023-11-23 21:43:16,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:43:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-23 21:43:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2023-11-23 21:43:16,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2023-11-23 21:43:16,254 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 327 transitions. [2023-11-23 21:43:16,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 327 transitions. [2023-11-23 21:43:16,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:16,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 327 transitions. [2023-11-23 21:43:16,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.333333333333336) internal successors, (327), 9 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,259 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,259 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 156 flow. Second operand 9 states and 327 transitions. [2023-11-23 21:43:16,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 358 flow [2023-11-23 21:43:16,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 84 transitions, 343 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:16,263 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 165 flow [2023-11-23 21:43:16,264 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=165, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2023-11-23 21:43:16,265 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2023-11-23 21:43:16,265 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 165 flow [2023-11-23 21:43:16,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,265 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:16,266 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] [2023-11-23 21:43:16,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:43:16,266 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:16,267 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:16,267 INFO L85 PathProgramCache]: Analyzing trace with hash -606909659, now seen corresponding path program 4 times [2023-11-23 21:43:16,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:16,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906207817] [2023-11-23 21:43:16,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:16,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:16,572 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-23 21:43:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:43:16,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906207817] [2023-11-23 21:43:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906207817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:43:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445594563] [2023-11-23 21:43:16,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:16,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:43:16,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:43:16,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:43:16,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:43:16,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-23 21:43:16,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 165 flow. Second operand has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:16,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-23 21:43:16,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:16,979 INFO L124 PetriNetUnfolderBase]: 610/1230 cut-off events. [2023-11-23 21:43:16,979 INFO L125 PetriNetUnfolderBase]: For 519/535 co-relation queries the response was YES. [2023-11-23 21:43:16,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2909 conditions, 1230 events. 610/1230 cut-off events. For 519/535 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6993 event pairs, 177 based on Foata normal form. 8/1172 useless extension candidates. Maximal degree in co-relation 2888. Up to 488 conditions per place. [2023-11-23 21:43:16,986 INFO L140 encePairwiseOnDemand]: 48/55 looper letters, 24 selfloop transitions, 3 changer transitions 30/79 dead transitions. [2023-11-23 21:43:16,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 79 transitions, 380 flow [2023-11-23 21:43:16,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:43:16,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:43:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 266 transitions. [2023-11-23 21:43:16,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6045454545454545 [2023-11-23 21:43:16,989 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 266 transitions. [2023-11-23 21:43:16,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 266 transitions. [2023-11-23 21:43:16,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:16,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 266 transitions. [2023-11-23 21:43:16,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.25) internal successors, (266), 8 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,995 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 55.0) internal successors, (495), 9 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:16,995 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 165 flow. Second operand 8 states and 266 transitions. [2023-11-23 21:43:16,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 79 transitions, 380 flow [2023-11-23 21:43:16,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 352 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-23 21:43:17,001 INFO L231 Difference]: Finished difference. Result has 69 places, 45 transitions, 151 flow [2023-11-23 21:43:17,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=151, PETRI_PLACES=69, PETRI_TRANSITIONS=45} [2023-11-23 21:43:17,003 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2023-11-23 21:43:17,003 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 45 transitions, 151 flow [2023-11-23 21:43:17,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.857142857142858) internal successors, (202), 7 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:17,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:17,004 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] [2023-11-23 21:43:17,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:43:17,004 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:17,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:17,005 INFO L85 PathProgramCache]: Analyzing trace with hash 500460389, now seen corresponding path program 5 times [2023-11-23 21:43:17,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:43:17,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545728380] [2023-11-23 21:43:17,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:17,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:43:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:43:17,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:43:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:43:17,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:43:17,169 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:43:17,171 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-23 21:43:17,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-23 21:43:17,173 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-23 21:43:17,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-23 21:43:17,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-23 21:43:17,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-23 21:43:17,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-23 21:43:17,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-23 21:43:17,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-23 21:43:17,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-23 21:43:17,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-23 21:43:17,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-23 21:43:17,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-23 21:43:17,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:43:17,176 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:17,184 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:43:17,184 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:43:17,269 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:43:17,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:43:17,282 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:43:17,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:43:17,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:43:17,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:43:17 BasicIcfg [2023-11-23 21:43:17,322 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:43:17,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:43:17,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:43:17,323 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:43:17,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:03" (3/4) ... [2023-11-23 21:43:17,325 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:43:17,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:43:17,327 INFO L158 Benchmark]: Toolchain (without parser) took 16233.02ms. Allocated memory was 167.8MB in the beginning and 371.2MB in the end (delta: 203.4MB). Free memory was 124.9MB in the beginning and 188.2MB in the end (delta: -63.3MB). Peak memory consumption was 141.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,328 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:43:17,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 818.75ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 101.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.78ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,329 INFO L158 Benchmark]: Boogie Preprocessor took 43.72ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,330 INFO L158 Benchmark]: RCFGBuilder took 1464.48ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 97.2MB in the beginning and 156.6MB in the end (delta: -59.3MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,330 INFO L158 Benchmark]: TraceAbstraction took 13766.45ms. Allocated memory was 205.5MB in the beginning and 371.2MB in the end (delta: 165.7MB). Free memory was 155.5MB in the beginning and 188.2MB in the end (delta: -32.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2023-11-23 21:43:17,330 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 371.2MB. Free memory is still 188.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:43:17,332 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.29ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 136.3MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 818.75ms. Allocated memory is still 167.8MB. Free memory was 124.9MB in the beginning and 101.9MB in the end (delta: 23.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.78ms. Allocated memory is still 167.8MB. Free memory was 101.4MB in the beginning and 99.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.72ms. Allocated memory is still 167.8MB. Free memory was 99.3MB in the beginning and 97.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1464.48ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 97.2MB in the beginning and 156.6MB in the end (delta: -59.3MB). Peak memory consumption was 39.6MB. Max. memory is 16.1GB. * TraceAbstraction took 13766.45ms. Allocated memory was 205.5MB in the beginning and 371.2MB in the end (delta: 165.7MB). Free memory was 155.5MB in the beginning and 188.2MB in the end (delta: -32.7MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 371.2MB. Free memory is still 188.2MB. 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~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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L793] 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) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L819] 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) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 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 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix035_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 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: 13.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 598 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1875 IncrementalHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 41 mSDtfsCounter, 1875 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=12, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 300 NumberOfCodeBlocks, 300 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 2656 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 21:43:17,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ --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 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:43:20,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:43:20,240 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-23 21:43:20,246 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:43:20,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:43:20,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:43:20,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:43:20,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:43:20,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:43:20,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:43:20,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:43:20,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:43:20,303 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:43:20,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:43:20,304 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:43:20,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:43:20,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:43:20,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:43:20,307 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:43:20,307 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:43:20,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:43:20,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:43:20,309 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:43:20,310 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:43:20,310 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:43:20,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:43:20,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:43:20,312 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:43:20,313 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:43:20,313 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:43:20,314 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:43:20,314 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:43:20,315 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:20,315 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:43:20,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:43:20,316 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 21:43:20,317 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:43:20,317 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:43:20,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:43:20,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:43:20,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:43:20,320 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 21:43:20,320 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_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/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_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ 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 -> 6f7e432a886f0272967b45cc6f21d24dfd6dfdb8fd02a0d13e6bb2d2db636b21 [2023-11-23 21:43:20,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:43:20,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:43:20,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:43:20,769 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:43:20,770 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:43:20,771 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-23 21:43:24,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:43:24,503 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:43:24,509 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-23 21:43:24,541 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/abc98ec42/a07cf1f274174376ad06bac303271b21/FLAG2b20d9949 [2023-11-23 21:43:24,561 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/data/abc98ec42/a07cf1f274174376ad06bac303271b21 [2023-11-23 21:43:24,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:43:24,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:43:24,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:24,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:43:24,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:43:24,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:24" (1/1) ... [2023-11-23 21:43:24,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9a8de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:24, skipping insertion in model container [2023-11-23 21:43:24,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:43:24" (1/1) ... [2023-11-23 21:43:24,661 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:43:25,294 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:25,316 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:43:25,446 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:43:25,527 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:25,527 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:43:25,535 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:43:25,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25 WrapperNode [2023-11-23 21:43:25,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:43:25,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:25,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:43:25,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:43:25,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,656 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-11-23 21:43:25,657 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:43:25,658 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:43:25,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:43:25,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:43:25,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,691 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,739 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:43:25,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:43:25,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:43:25,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:43:25,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (1/1) ... [2023-11-23 21:43:25,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:43:25,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:43:25,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:43:25,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:43:25,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:43:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:43:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:43:25,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:43:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-23 21:43:25,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 21:43:25,831 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:43:25,831 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:43:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:43:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:43:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:43:25,832 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:43:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:43:25,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:43:25,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:43:25,836 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:43:26,070 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:43:26,073 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:43:26,544 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:43:26,955 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:43:26,956 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:43:26,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:26 BoogieIcfgContainer [2023-11-23 21:43:26,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:43:26,963 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:43:26,963 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:43:26,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:43:26,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:43:24" (1/3) ... [2023-11-23 21:43:26,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af064e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:26, skipping insertion in model container [2023-11-23 21:43:26,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:43:25" (2/3) ... [2023-11-23 21:43:26,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af064e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:43:26, skipping insertion in model container [2023-11-23 21:43:26,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:26" (3/3) ... [2023-11-23 21:43:26,972 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-11-23 21:43:26,993 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:43:26,994 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-23 21:43:26,994 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:43:27,067 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:43:27,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-23 21:43:27,166 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-23 21:43:27,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:27,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 52 events. 2/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 102 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-11-23 21:43:27,172 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-23 21:43:27,181 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-23 21:43:27,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:43:27,213 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;@68292cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:43:27,213 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-23 21:43:27,222 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:43:27,222 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 21:43:27,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:43:27,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:27,228 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:43:27,229 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:27,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:27,235 INFO L85 PathProgramCache]: Analyzing trace with hash 12566, now seen corresponding path program 1 times [2023-11-23 21:43:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:27,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300046879] [2023-11-23 21:43:27,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:27,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:27,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:27,256 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:27,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 21:43:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:27,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:43:27,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:27,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 21:43:27,506 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-23 21:43:27,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:27,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300046879] [2023-11-23 21:43:27,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300046879] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:27,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:27,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849811283] [2023-11-23 21:43:27,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:27,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:27,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:27,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:27,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:27,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:27,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:27,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:28,078 INFO L124 PetriNetUnfolderBase]: 772/1598 cut-off events. [2023-11-23 21:43:28,079 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-23 21:43:28,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2811 conditions, 1598 events. 772/1598 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11268 event pairs, 580 based on Foata normal form. 90/1503 useless extension candidates. Maximal degree in co-relation 2797. Up to 888 conditions per place. [2023-11-23 21:43:28,102 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-23 21:43:28,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 181 flow [2023-11-23 21:43:28,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:28,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:28,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:28,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:28,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:28,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,127 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,129 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:28,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 181 flow [2023-11-23 21:43:28,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 21:43:28,137 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-23 21:43:28,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2023-11-23 21:43:28,143 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-23 21:43:28,143 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-23 21:43:28,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:28,144 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:43:28,159 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:28,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:28,347 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:28,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:28,347 INFO L85 PathProgramCache]: Analyzing trace with hash 12567, now seen corresponding path program 1 times [2023-11-23 21:43:28,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:28,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550971689] [2023-11-23 21:43:28,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:28,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:28,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:28,350 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:28,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 21:43:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:28,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:43:28,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:43:28,476 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-23 21:43:28,476 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:28,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:28,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550971689] [2023-11-23 21:43:28,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550971689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:28,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:28,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:28,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516460] [2023-11-23 21:43:28,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:28,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:28,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:28,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:28,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:28,522 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:28,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:28,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:28,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:28,885 INFO L124 PetriNetUnfolderBase]: 772/1597 cut-off events. [2023-11-23 21:43:28,885 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:28,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1597 events. 772/1597 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11358 event pairs, 580 based on Foata normal form. 1/1413 useless extension candidates. Maximal degree in co-relation 2842. Up to 887 conditions per place. [2023-11-23 21:43:28,900 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-23 21:43:28,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 178 flow [2023-11-23 21:43:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:28,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:28,903 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:28,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:28,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,907 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,907 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:28,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 178 flow [2023-11-23 21:43:28,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:28,912 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-23 21:43:28,913 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-23 21:43:28,914 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-23 21:43:28,914 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-23 21:43:28,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:28,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:28,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:43:28,921 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-23 21:43:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:29,117 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:29,117 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:29,118 INFO L85 PathProgramCache]: Analyzing trace with hash 374734671, now seen corresponding path program 1 times [2023-11-23 21:43:29,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:29,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188959817] [2023-11-23 21:43:29,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:29,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:29,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:29,120 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:29,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 21:43:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:29,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:43:29,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:29,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 21:43:29,224 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-23 21:43:29,225 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:29,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:29,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188959817] [2023-11-23 21:43:29,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188959817] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:29,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:29,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:29,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409487248] [2023-11-23 21:43:29,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:29,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:29,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:29,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:29,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:29,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:29,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:29,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:29,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:29,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:29,593 INFO L124 PetriNetUnfolderBase]: 774/1596 cut-off events. [2023-11-23 21:43:29,593 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:29,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 1596 events. 774/1596 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 11285 event pairs, 438 based on Foata normal form. 0/1417 useless extension candidates. Maximal degree in co-relation 2846. Up to 888 conditions per place. [2023-11-23 21:43:29,621 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-23 21:43:29,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 178 flow [2023-11-23 21:43:29,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 21:43:29,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-23 21:43:29,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 21:43:29,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 21:43:29,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:29,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 21:43:29,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:29,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:29,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:29,635 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 118 transitions. [2023-11-23 21:43:29,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 178 flow [2023-11-23 21:43:29,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:29,641 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-23 21:43:29,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-23 21:43:29,643 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-23 21:43:29,647 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-23 21:43:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:29,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:29,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:43:29,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:29,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:29,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:29,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:29,852 INFO L85 PathProgramCache]: Analyzing trace with hash 374734672, now seen corresponding path program 1 times [2023-11-23 21:43:29,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:29,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24120991] [2023-11-23 21:43:29,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:29,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:29,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 21:43:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:29,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:43:29,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:29,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:43:29,984 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-23 21:43:29,985 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:29,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24120991] [2023-11-23 21:43:29,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24120991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:29,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022138617] [2023-11-23 21:43:29,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:29,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:29,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:29,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:29,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:30,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:30,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:30,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:30,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:30,329 INFO L124 PetriNetUnfolderBase]: 772/1580 cut-off events. [2023-11-23 21:43:30,329 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 21:43:30,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2838 conditions, 1580 events. 772/1580 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10792 event pairs, 593 based on Foata normal form. 3/1407 useless extension candidates. Maximal degree in co-relation 2828. Up to 883 conditions per place. [2023-11-23 21:43:30,345 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-23 21:43:30,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 174 flow [2023-11-23 21:43:30,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:30,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:30,348 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:30,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:30,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:30,349 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:30,350 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,351 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,355 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:30,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 174 flow [2023-11-23 21:43:30,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:30,360 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-23 21:43:30,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-23 21:43:30,362 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-23 21:43:30,363 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-23 21:43:30,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:30,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:30,383 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:30,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:30,583 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:30,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:30,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1100960156, now seen corresponding path program 1 times [2023-11-23 21:43:30,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225160090] [2023-11-23 21:43:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:30,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:30,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:30,586 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:30,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 21:43:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:30,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:43:30,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:30,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-23 21:43:30,710 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-23 21:43:30,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:30,716 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:30,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225160090] [2023-11-23 21:43:30,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225160090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:30,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:30,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:30,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137594990] [2023-11-23 21:43:30,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:30,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:30,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:30,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:30,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:30,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-23 21:43:30,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:30,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:30,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-23 21:43:30,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:31,083 INFO L124 PetriNetUnfolderBase]: 794/1598 cut-off events. [2023-11-23 21:43:31,083 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-23 21:43:31,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2893 conditions, 1598 events. 794/1598 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11312 event pairs, 294 based on Foata normal form. 0/1455 useless extension candidates. Maximal degree in co-relation 2883. Up to 890 conditions per place. [2023-11-23 21:43:31,097 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-23 21:43:31,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 174 flow [2023-11-23 21:43:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-23 21:43:31,099 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-23 21:43:31,099 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-23 21:43:31,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-23 21:43:31,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:31,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-23 21:43:31,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,102 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 118 transitions. [2023-11-23 21:43:31,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 174 flow [2023-11-23 21:43:31,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:31,108 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-23 21:43:31,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-23 21:43:31,111 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-23 21:43:31,111 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-23 21:43:31,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:31,111 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:31,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:31,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:31,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:31,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:31,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1100960157, now seen corresponding path program 1 times [2023-11-23 21:43:31,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:31,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1697410655] [2023-11-23 21:43:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:31,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:31,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:31,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:31,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 21:43:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:31,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:43:31,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:31,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:43:31,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:43:31,442 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:31,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1697410655] [2023-11-23 21:43:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1697410655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:31,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:31,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:43:31,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132365757] [2023-11-23 21:43:31,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:31,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:31,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:31,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:31,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:31,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:31,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:31,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:31,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:31,850 INFO L124 PetriNetUnfolderBase]: 772/1561 cut-off events. [2023-11-23 21:43:31,850 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-23 21:43:31,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2831 conditions, 1561 events. 772/1561 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 11105 event pairs, 294 based on Foata normal form. 15/1436 useless extension candidates. Maximal degree in co-relation 2821. Up to 853 conditions per place. [2023-11-23 21:43:31,866 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-23 21:43:31,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-23 21:43:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:31,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:31,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-23 21:43:31,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-23 21:43:31,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-23 21:43:31,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-23 21:43:31,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:31,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-23 21:43:31,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,870 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,871 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 120 transitions. [2023-11-23 21:43:31,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-23 21:43:31,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:31,877 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-23 21:43:31,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-23 21:43:31,881 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-23 21:43:31,882 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-23 21:43:31,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:31,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:31,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:31,893 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:32,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:32,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:32,088 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1100961200, now seen corresponding path program 1 times [2023-11-23 21:43:32,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:32,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274088751] [2023-11-23 21:43:32,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:32,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:32,089 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:32,090 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:32,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-23 21:43:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:32,206 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:43:32,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:32,231 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-23 21:43:32,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:32,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:32,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274088751] [2023-11-23 21:43:32,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274088751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:32,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:43:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979660218] [2023-11-23 21:43:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:32,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:43:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:43:32,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:43:32,235 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-23 21:43:32,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:32,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-23 21:43:32,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:32,471 INFO L124 PetriNetUnfolderBase]: 603/1140 cut-off events. [2023-11-23 21:43:32,471 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-23 21:43:32,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2145 conditions, 1140 events. 603/1140 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7001 event pairs, 192 based on Foata normal form. 0/1111 useless extension candidates. Maximal degree in co-relation 2135. Up to 742 conditions per place. [2023-11-23 21:43:32,481 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-23 21:43:32,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-23 21:43:32,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:43:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:43:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-23 21:43:32,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7696969696969697 [2023-11-23 21:43:32,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-23 21:43:32,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-23 21:43:32,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:32,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-23 21:43:32,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,485 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,485 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 127 transitions. [2023-11-23 21:43:32,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-23 21:43:32,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:32,487 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-23 21:43:32,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-23 21:43:32,488 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-23 21:43:32,488 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-23 21:43:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,489 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:32,489 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:32,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:32,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:32,692 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:32,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:32,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1440704652, now seen corresponding path program 1 times [2023-11-23 21:43:32,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:32,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381551892] [2023-11-23 21:43:32,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:32,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:32,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:32,695 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:32,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-23 21:43:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:32,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 21:43:32,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:32,865 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-23 21:43:32,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:32,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:32,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381551892] [2023-11-23 21:43:32,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381551892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:32,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:32,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:43:32,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026928886] [2023-11-23 21:43:32,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:32,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:43:32,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:32,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:43:32,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:43:32,872 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:32,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:32,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:32,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:32,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:33,272 INFO L124 PetriNetUnfolderBase]: 1361/2444 cut-off events. [2023-11-23 21:43:33,272 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-23 21:43:33,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4684 conditions, 2444 events. 1361/2444 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 16051 event pairs, 147 based on Foata normal form. 80/2456 useless extension candidates. Maximal degree in co-relation 4673. Up to 1297 conditions per place. [2023-11-23 21:43:33,297 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 40 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2023-11-23 21:43:33,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 238 flow [2023-11-23 21:43:33,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:43:33,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:43:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-23 21:43:33,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-23 21:43:33,299 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-23 21:43:33,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-23 21:43:33,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:33,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-23 21:43:33,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:33,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:33,302 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 55.0) internal successors, (275), 5 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:33,302 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 4 states and 156 transitions. [2023-11-23 21:43:33,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 238 flow [2023-11-23 21:43:33,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:33,304 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 122 flow [2023-11-23 21:43:33,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-23 21:43:33,305 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-23 21:43:33,306 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 122 flow [2023-11-23 21:43:33,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:33,306 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:33,306 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] [2023-11-23 21:43:33,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:33,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:33,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:33,510 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:33,510 INFO L85 PathProgramCache]: Analyzing trace with hash -135359667, now seen corresponding path program 1 times [2023-11-23 21:43:33,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:33,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1007628419] [2023-11-23 21:43:33,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:33,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:33,512 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:33,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-23 21:43:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:33,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 21:43:33,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:33,702 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-23 21:43:33,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:33,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:33,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1007628419] [2023-11-23 21:43:33,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1007628419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:33,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:43:33,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427412313] [2023-11-23 21:43:33,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:33,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:43:33,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:33,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:43:33,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:43:33,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:33,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:33,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:33,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:33,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:34,082 INFO L124 PetriNetUnfolderBase]: 877/1596 cut-off events. [2023-11-23 21:43:34,083 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2023-11-23 21:43:34,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 1596 events. 877/1596 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 9283 event pairs, 73 based on Foata normal form. 68/1619 useless extension candidates. Maximal degree in co-relation 3505. Up to 625 conditions per place. [2023-11-23 21:43:34,095 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 50 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2023-11-23 21:43:34,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 327 flow [2023-11-23 21:43:34,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:43:34,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:43:34,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2023-11-23 21:43:34,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127272727272728 [2023-11-23 21:43:34,097 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 196 transitions. [2023-11-23 21:43:34,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 196 transitions. [2023-11-23 21:43:34,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:34,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 196 transitions. [2023-11-23 21:43:34,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 39.2) internal successors, (196), 5 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,100 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 55.0) internal successors, (330), 6 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,100 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 122 flow. Second operand 5 states and 196 transitions. [2023-11-23 21:43:34,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 327 flow [2023-11-23 21:43:34,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 317 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-23 21:43:34,104 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 162 flow [2023-11-23 21:43:34,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=162, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-11-23 21:43:34,105 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-23 21:43:34,105 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 162 flow [2023-11-23 21:43:34,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:34,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:34,114 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:34,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:34,309 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:34,309 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash 222688736, now seen corresponding path program 1 times [2023-11-23 21:43:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290764214] [2023-11-23 21:43:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:34,312 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:34,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-23 21:43:34,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:34,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:43:34,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:34,519 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-23 21:43:34,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:34,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:34,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290764214] [2023-11-23 21:43:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290764214] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:34,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:43:34,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544614377] [2023-11-23 21:43:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:34,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:34,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:34,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:34,530 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 162 flow. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,530 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:34,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:34,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:34,840 INFO L124 PetriNetUnfolderBase]: 489/868 cut-off events. [2023-11-23 21:43:34,840 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-23 21:43:34,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2200 conditions, 868 events. 489/868 cut-off events. For 730/730 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3963 event pairs, 59 based on Foata normal form. 36/869 useless extension candidates. Maximal degree in co-relation 2185. Up to 268 conditions per place. [2023-11-23 21:43:34,846 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2023-11-23 21:43:34,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 338 flow [2023-11-23 21:43:34,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:34,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2023-11-23 21:43:34,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-23 21:43:34,849 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 220 transitions. [2023-11-23 21:43:34,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 220 transitions. [2023-11-23 21:43:34,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:34,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 220 transitions. [2023-11-23 21:43:34,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,851 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,851 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 162 flow. Second operand 6 states and 220 transitions. [2023-11-23 21:43:34,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 338 flow [2023-11-23 21:43:34,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 313 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:34,857 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 176 flow [2023-11-23 21:43:34,857 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-23 21:43:34,858 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-23 21:43:34,858 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 176 flow [2023-11-23 21:43:34,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:34,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:34,859 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] [2023-11-23 21:43:34,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:35,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:35,062 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:35,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1240809333, now seen corresponding path program 1 times [2023-11-23 21:43:35,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:35,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [739610640] [2023-11-23 21:43:35,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:35,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:35,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:35,064 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:35,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 21:43:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:35,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 21:43:35,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:35,938 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-23 21:43:35,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:35,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:35,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [739610640] [2023-11-23 21:43:35,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [739610640] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:35,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:35,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:43:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539093126] [2023-11-23 21:43:35,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:35,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:35,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:36,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-23 21:43:36,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:36,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:36,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-23 21:43:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:36,626 INFO L124 PetriNetUnfolderBase]: 248/570 cut-off events. [2023-11-23 21:43:36,626 INFO L125 PetriNetUnfolderBase]: For 170/176 co-relation queries the response was YES. [2023-11-23 21:43:36,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 570 events. 248/570 cut-off events. For 170/176 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2821 event pairs, 57 based on Foata normal form. 8/539 useless extension candidates. Maximal degree in co-relation 1169. Up to 352 conditions per place. [2023-11-23 21:43:36,630 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 22 selfloop transitions, 3 changer transitions 4/56 dead transitions. [2023-11-23 21:43:36,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 56 transitions, 252 flow [2023-11-23 21:43:36,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 192 transitions. [2023-11-23 21:43:36,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2023-11-23 21:43:36,633 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 192 transitions. [2023-11-23 21:43:36,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 192 transitions. [2023-11-23 21:43:36,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:36,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 192 transitions. [2023-11-23 21:43:36,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 32.0) internal successors, (192), 6 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-23 21:43:36,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:36,636 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:36,636 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 176 flow. Second operand 6 states and 192 transitions. [2023-11-23 21:43:36,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 56 transitions, 252 flow [2023-11-23 21:43:36,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 56 transitions, 196 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-23 21:43:36,639 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 122 flow [2023-11-23 21:43:36,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2023-11-23 21:43:36,640 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-23 21:43:36,640 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 122 flow [2023-11-23 21:43:36,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:36,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:36,641 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] [2023-11-23 21:43:36,656 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:36,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:36,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:36,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:36,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1128575691, now seen corresponding path program 1 times [2023-11-23 21:43:36,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:36,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919316056] [2023-11-23 21:43:36,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:43:36,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:36,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:36,851 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:36,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-23 21:43:36,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:43:36,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 21:43:37,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:37,184 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-23 21:43:37,184 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:37,184 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:37,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919316056] [2023-11-23 21:43:37,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919316056] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:37,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:37,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:43:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029105283] [2023-11-23 21:43:37,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:37,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 21:43:37,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:37,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 21:43:37,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 21:43:37,202 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:37,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:37,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:37,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:37,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:37,674 INFO L124 PetriNetUnfolderBase]: 540/1092 cut-off events. [2023-11-23 21:43:37,674 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-23 21:43:37,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 1092 events. 540/1092 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6074 event pairs, 167 based on Foata normal form. 8/1023 useless extension candidates. Maximal degree in co-relation 2122. Up to 302 conditions per place. [2023-11-23 21:43:37,687 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 30 selfloop transitions, 6 changer transitions 24/86 dead transitions. [2023-11-23 21:43:37,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 86 transitions, 336 flow [2023-11-23 21:43:37,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:43:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-23 21:43:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 331 transitions. [2023-11-23 21:43:37,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6686868686868687 [2023-11-23 21:43:37,690 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 331 transitions. [2023-11-23 21:43:37,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 331 transitions. [2023-11-23 21:43:37,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:37,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 331 transitions. [2023-11-23 21:43:37,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 36.77777777777778) internal successors, (331), 9 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:37,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:37,696 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:37,696 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 122 flow. Second operand 9 states and 331 transitions. [2023-11-23 21:43:37,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 86 transitions, 336 flow [2023-11-23 21:43:37,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 328 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-23 21:43:37,699 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 159 flow [2023-11-23 21:43:37,699 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-11-23 21:43:37,700 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2023-11-23 21:43:37,700 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 159 flow [2023-11-23 21:43:37,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.0) internal successors, (256), 8 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:37,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:37,701 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] [2023-11-23 21:43:37,717 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:37,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:37,904 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:37,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:37,905 INFO L85 PathProgramCache]: Analyzing trace with hash -217615349, now seen corresponding path program 2 times [2023-11-23 21:43:37,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:37,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922194300] [2023-11-23 21:43:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 21:43:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:37,907 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:37,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-23 21:43:38,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 21:43:38,057 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:43:38,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 21:43:38,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:38,157 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-23 21:43:38,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:38,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:38,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922194300] [2023-11-23 21:43:38,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922194300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:38,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:38,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:43:38,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429170172] [2023-11-23 21:43:38,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:38,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:38,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:38,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:38,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:38,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-23 21:43:38,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:38,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:38,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-23 21:43:38,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:38,602 INFO L124 PetriNetUnfolderBase]: 807/1560 cut-off events. [2023-11-23 21:43:38,602 INFO L125 PetriNetUnfolderBase]: For 458/458 co-relation queries the response was YES. [2023-11-23 21:43:38,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3561 conditions, 1560 events. 807/1560 cut-off events. For 458/458 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 9300 event pairs, 207 based on Foata normal form. 8/1489 useless extension candidates. Maximal degree in co-relation 3543. Up to 636 conditions per place. [2023-11-23 21:43:38,610 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 33 selfloop transitions, 1 changer transitions 27/85 dead transitions. [2023-11-23 21:43:38,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 85 transitions, 405 flow [2023-11-23 21:43:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-23 21:43:38,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2023-11-23 21:43:38,613 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-23 21:43:38,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-23 21:43:38,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:38,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-23 21:43:38,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.5) internal successors, (219), 6 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:38,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:38,616 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:38,616 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 159 flow. Second operand 6 states and 219 transitions. [2023-11-23 21:43:38,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 85 transitions, 405 flow [2023-11-23 21:43:38,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 85 transitions, 390 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-23 21:43:38,620 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 161 flow [2023-11-23 21:43:38,620 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=161, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-11-23 21:43:38,621 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2023-11-23 21:43:38,621 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 161 flow [2023-11-23 21:43:38,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:38,622 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:38,622 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] [2023-11-23 21:43:38,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:38,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:38,826 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:38,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:38,826 INFO L85 PathProgramCache]: Analyzing trace with hash 144755163, now seen corresponding path program 3 times [2023-11-23 21:43:38,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:38,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1761567340] [2023-11-23 21:43:38,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:43:38,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:38,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:38,829 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:38,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-23 21:43:38,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-23 21:43:38,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:43:38,978 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-23 21:43:38,980 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:39,436 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-23 21:43:39,436 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:39,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:39,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1761567340] [2023-11-23 21:43:39,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1761567340] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:39,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 21:43:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233940820] [2023-11-23 21:43:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:43:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:43:39,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:43:39,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-23 21:43:39,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 49 transitions, 161 flow. Second operand has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:39,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:39,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-23 21:43:39,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:39,936 INFO L124 PetriNetUnfolderBase]: 459/960 cut-off events. [2023-11-23 21:43:39,937 INFO L125 PetriNetUnfolderBase]: For 252/279 co-relation queries the response was YES. [2023-11-23 21:43:39,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2131 conditions, 960 events. 459/960 cut-off events. For 252/279 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5116 event pairs, 119 based on Foata normal form. 15/923 useless extension candidates. Maximal degree in co-relation 2113. Up to 296 conditions per place. [2023-11-23 21:43:39,943 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 27 selfloop transitions, 6 changer transitions 20/79 dead transitions. [2023-11-23 21:43:39,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 79 transitions, 343 flow [2023-11-23 21:43:39,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:43:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-23 21:43:39,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 322 transitions. [2023-11-23 21:43:39,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6505050505050505 [2023-11-23 21:43:39,946 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 322 transitions. [2023-11-23 21:43:39,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 322 transitions. [2023-11-23 21:43:39,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:39,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 322 transitions. [2023-11-23 21:43:39,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.77777777777778) internal successors, (322), 9 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:39,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:39,949 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 55.0) internal successors, (550), 10 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:39,950 INFO L175 Difference]: Start difference. First operand has 65 places, 49 transitions, 161 flow. Second operand 9 states and 322 transitions. [2023-11-23 21:43:39,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 79 transitions, 343 flow [2023-11-23 21:43:39,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 79 transitions, 332 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-23 21:43:39,953 INFO L231 Difference]: Finished difference. Result has 70 places, 49 transitions, 178 flow [2023-11-23 21:43:39,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=178, PETRI_PLACES=70, PETRI_TRANSITIONS=49} [2023-11-23 21:43:39,954 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 10 predicate places. [2023-11-23 21:43:39,955 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 49 transitions, 178 flow [2023-11-23 21:43:39,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.77777777777778) internal successors, (286), 9 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:39,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:39,955 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] [2023-11-23 21:43:39,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:40,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:40,159 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:40,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2079054339, now seen corresponding path program 4 times [2023-11-23 21:43:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:40,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474456347] [2023-11-23 21:43:40,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 21:43:40,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:40,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:40,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-23 21:43:40,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 21:43:40,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:43:40,305 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 21:43:40,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:43:40,380 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-23 21:43:40,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 21:43:40,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 21:43:40,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474456347] [2023-11-23 21:43:40,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474456347] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:43:40,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:43:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:43:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509103027] [2023-11-23 21:43:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:43:40,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:43:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 21:43:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:43:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:43:40,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-23 21:43:40,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 49 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:40,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:43:40,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-23 21:43:40,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:43:40,752 INFO L124 PetriNetUnfolderBase]: 652/1374 cut-off events. [2023-11-23 21:43:40,752 INFO L125 PetriNetUnfolderBase]: For 878/888 co-relation queries the response was YES. [2023-11-23 21:43:40,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3276 conditions, 1374 events. 652/1374 cut-off events. For 878/888 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8255 event pairs, 247 based on Foata normal form. 10/1322 useless extension candidates. Maximal degree in co-relation 3256. Up to 446 conditions per place. [2023-11-23 21:43:40,759 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 23 selfloop transitions, 1 changer transitions 27/75 dead transitions. [2023-11-23 21:43:40,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 75 transitions, 379 flow [2023-11-23 21:43:40,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:43:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:43:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-23 21:43:40,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2023-11-23 21:43:40,762 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-23 21:43:40,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-23 21:43:40,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:43:40,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-23 21:43:40,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:40,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:40,764 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 55.0) internal successors, (385), 7 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:40,765 INFO L175 Difference]: Start difference. First operand has 70 places, 49 transitions, 178 flow. Second operand 6 states and 214 transitions. [2023-11-23 21:43:40,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 75 transitions, 379 flow [2023-11-23 21:43:40,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 75 transitions, 341 flow, removed 8 selfloop flow, removed 7 redundant places. [2023-11-23 21:43:40,770 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 159 flow [2023-11-23 21:43:40,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=159, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-23 21:43:40,771 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2023-11-23 21:43:40,771 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 159 flow [2023-11-23 21:43:40,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:43:40,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:43:40,771 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] [2023-11-23 21:43:40,775 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:40,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:40,975 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-23 21:43:40,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:43:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash 804361933, now seen corresponding path program 5 times [2023-11-23 21:43:40,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 21:43:40,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1082923306] [2023-11-23 21:43:40,976 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-23 21:43:40,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:40,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat [2023-11-23 21:43:40,978 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 21:43:41,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-23 21:43:41,151 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 21:43:41,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-23 21:43:41,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:43:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:43:41,334 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-23 21:43:41,334 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:43:41,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-23 21:43:41,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-23 21:43:41,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-23 21:43:41,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-23 21:43:41,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-23 21:43:41,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-23 21:43:41,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-23 21:43:41,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-23 21:43:41,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-23 21:43:41,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 21:43:41,545 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:43:41,550 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:43:41,551 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:43:41,640 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:43:41,643 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:43:41,647 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:43:41,662 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:43:41,675 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:43:41,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:43:41 BasicIcfg [2023-11-23 21:43:41,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:43:41,702 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:43:41,702 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:43:41,703 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:43:41,703 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:43:26" (3/4) ... [2023-11-23 21:43:41,709 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:43:41,710 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:43:41,711 INFO L158 Benchmark]: Toolchain (without parser) took 17141.20ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 70.0MB in the beginning and 71.5MB in the end (delta: -1.5MB). Peak memory consumption was 103.2MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,712 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:43:41,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 965.03ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 69.5MB in the end (delta: 527.7kB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,714 INFO L158 Benchmark]: Boogie Procedure Inliner took 118.30ms. Allocated memory is still 94.4MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,714 INFO L158 Benchmark]: Boogie Preprocessor took 92.25ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,715 INFO L158 Benchmark]: RCFGBuilder took 1206.33ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 64.1MB in the end (delta: 339.9kB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,715 INFO L158 Benchmark]: TraceAbstraction took 14738.97ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 63.0MB in the beginning and 71.5MB in the end (delta: -8.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2023-11-23 21:43:41,715 INFO L158 Benchmark]: Witness Printer took 8.30ms. Allocated memory is still 197.1MB. Free memory is still 71.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:43:41,717 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 58.7MB. Free memory was 35.2MB in the beginning and 35.1MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 965.03ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 69.5MB in the end (delta: 527.7kB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 118.30ms. Allocated memory is still 94.4MB. Free memory was 69.1MB in the beginning and 66.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.25ms. Allocated memory is still 94.4MB. Free memory was 66.9MB in the beginning and 64.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1206.33ms. Allocated memory is still 94.4MB. Free memory was 64.4MB in the beginning and 64.1MB in the end (delta: 339.9kB). Peak memory consumption was 29.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14738.97ms. Allocated memory was 94.4MB in the beginning and 197.1MB in the end (delta: 102.8MB). Free memory was 63.0MB in the beginning and 71.5MB in the end (delta: -8.5MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. * Witness Printer took 8.30ms. Allocated memory is still 197.1MB. Free memory is still 71.5MB. 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~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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={3:0}, t917={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L845] 0 pthread_t t918; [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t916={3:0}, t917={6:0}, t918={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L807] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L758] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L759] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L760] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L761] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L763] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L793] 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) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L819] 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) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={3:0}, t917={6:0}, t918={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 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 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={3:0}, t917={6:0}, t918={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={3:0}, t917={6:0}, t918={7: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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L861] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "mix035_power.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 844]: 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: 846]: 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: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 81 locations, 13 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: 14.4s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 600 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 489 mSDsluCounter, 126 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1745 IncrementalHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 41 mSDtfsCounter, 1745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=14, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 267 ConstructedInterpolants, 1 QuantifiedInterpolants, 1954 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1823 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 21:43:41,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c958ef4c-91eb-4604-8186-1ea470a758a6/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample