./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 0e0057cc 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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 05:44:05,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:44:05,795 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:44:05,800 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:44:05,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:44:05,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:44:05,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:44:05,824 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:44:05,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:44:05,825 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:44:05,825 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:44:05,826 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:44:05,827 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:44:05,827 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:44:05,828 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:44:05,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:44:05,829 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:44:05,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:44:05,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:44:05,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:44:05,831 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:44:05,835 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:44:05,836 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:44:05,836 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:44:05,837 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:44:05,837 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:44:05,837 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:44:05,838 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:44:05,838 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:44:05,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:44:05,839 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:44:05,839 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:44:05,839 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:05,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:44:05,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:44:05,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:44:05,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:44:05,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:44:05,842 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:44:05,842 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:44:05,842 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:44:05,843 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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya 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-29 05:44:06,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:44:06,092 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:44:06,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:44:06,096 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:44:06,096 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:44:06,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-29 05:44:09,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:44:09,698 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:44:09,698 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-29 05:44:09,718 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/2a36204f7/5a1a3b01a3b54b3eb54ed70109de4237/FLAGdd9850a1c [2023-11-29 05:44:09,736 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/2a36204f7/5a1a3b01a3b54b3eb54ed70109de4237 [2023-11-29 05:44:09,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:44:09,741 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:44:09,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:09,743 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:44:09,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:44:09,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:09" (1/1) ... [2023-11-29 05:44:09,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b55ee30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:09, skipping insertion in model container [2023-11-29 05:44:09,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:09" (1/1) ... [2023-11-29 05:44:09,808 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:44:10,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:10,184 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:44:10,254 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:10,290 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:44:10,290 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:44:10,297 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:44:10,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10 WrapperNode [2023-11-29 05:44:10,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:10,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:10,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:44:10,299 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:44:10,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,357 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-11-29 05:44:10,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:10,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:44:10,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:44:10,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:44:10,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,374 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,398 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 05:44:10,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,399 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,411 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,414 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,421 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:44:10,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:44:10,428 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:44:10,428 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:44:10,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (1/1) ... [2023-11-29 05:44:10,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:10,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:44:10,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:44:10,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:44:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:44:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:44:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:44:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:44:10,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:44:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:44:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:44:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:44:10,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:44:10,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:44:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:44:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:44:10,514 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:44:10,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:44:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:44:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:44:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:44:10,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:44:10,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:44:10,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:44:10,518 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:44:10,737 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:44:10,739 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:44:11,053 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:44:11,263 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:44:11,263 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:44:11,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:11 BoogieIcfgContainer [2023-11-29 05:44:11,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:44:11,267 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:44:11,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:44:11,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:44:11,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:44:09" (1/3) ... [2023-11-29 05:44:11,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b91789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:11, skipping insertion in model container [2023-11-29 05:44:11,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:10" (2/3) ... [2023-11-29 05:44:11,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b91789 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:11, skipping insertion in model container [2023-11-29 05:44:11,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:11" (3/3) ... [2023-11-29 05:44:11,275 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-11-29 05:44:11,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:44:11,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 05:44:11,300 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:44:11,359 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:44:11,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 05:44:11,440 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 05:44:11,440 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:44:11,445 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-29 05:44:11,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 05:44:11,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 05:44:11,464 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:44:11,473 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;@812717a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:44:11,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 05:44:11,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:44:11,477 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:44:11,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:44:11,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:11,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:44:11,479 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-29 05:44:11,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:11,486 INFO L85 PathProgramCache]: Analyzing trace with hash 12502, now seen corresponding path program 1 times [2023-11-29 05:44:11,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:11,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526854848] [2023-11-29 05:44:11,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:11,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:11,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:11,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526854848] [2023-11-29 05:44:11,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526854848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705417247] [2023-11-29 05:44:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:11,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:11,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:11,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:11,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:11,919 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-29 05:44:11,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:11,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:11,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:12,525 INFO L124 PetriNetUnfolderBase]: 772/1598 cut-off events. [2023-11-29 05:44:12,525 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:44:12,534 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-29 05:44:12,551 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 05:44:12,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 181 flow [2023-11-29 05:44:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:12,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:12,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:12,569 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:12,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:12,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:12,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:12,577 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-29 05:44:12,582 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-29 05:44:12,582 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-29 05:44:12,585 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:12,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 181 flow [2023-11-29 05:44:12,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:44:12,594 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 05:44:12,597 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-29 05:44:12,601 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 05:44:12,602 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 05:44:12,602 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-29 05:44:12,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:12,602 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:44:12,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:44:12,603 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-29 05:44:12,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:12,604 INFO L85 PathProgramCache]: Analyzing trace with hash 12503, now seen corresponding path program 1 times [2023-11-29 05:44:12,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:12,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885425380] [2023-11-29 05:44:12,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:12,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:12,722 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-29 05:44:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885425380] [2023-11-29 05:44:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885425380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:12,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181071188] [2023-11-29 05:44:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:12,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:12,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:12,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:12,746 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-29 05:44:12,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:12,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:12,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:13,140 INFO L124 PetriNetUnfolderBase]: 772/1597 cut-off events. [2023-11-29 05:44:13,140 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:13,146 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-29 05:44:13,159 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 05:44:13,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 178 flow [2023-11-29 05:44:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:13,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:13,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:13,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:13,163 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:13,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:13,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:13,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:13,165 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-29 05:44:13,167 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-29 05:44:13,167 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-29 05:44:13,167 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:13,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 178 flow [2023-11-29 05:44:13,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:13,173 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 05:44:13,173 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-29 05:44:13,174 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 05:44:13,175 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 05:44:13,175 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-29 05:44:13,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:13,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:44:13,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:44:13,176 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-29 05:44:13,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:13,177 INFO L85 PathProgramCache]: Analyzing trace with hash 372826061, now seen corresponding path program 1 times [2023-11-29 05:44:13,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:13,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244471834] [2023-11-29 05:44:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,247 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-29 05:44:13,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:13,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244471834] [2023-11-29 05:44:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244471834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:13,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:13,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:13,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494400955] [2023-11-29 05:44:13,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:13,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:13,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:13,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:13,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:13,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:13,269 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-29 05:44:13,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:13,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:13,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:13,622 INFO L124 PetriNetUnfolderBase]: 774/1596 cut-off events. [2023-11-29 05:44:13,622 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:13,626 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-29 05:44:13,640 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 05:44:13,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 178 flow [2023-11-29 05:44:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:13,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:13,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-29 05:44:13,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-29 05:44:13,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-29 05:44:13,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-29 05:44:13,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:13,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-29 05:44:13,645 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-29 05:44:13,646 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-29 05:44:13,646 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-29 05:44:13,646 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 118 transitions. [2023-11-29 05:44:13,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 178 flow [2023-11-29 05:44:13,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:13,651 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 05:44:13,652 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-29 05:44:13,653 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 05:44:13,653 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 05:44:13,653 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-29 05:44:13,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:13,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:44:13,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:44:13,654 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-29 05:44:13,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:13,655 INFO L85 PathProgramCache]: Analyzing trace with hash 372826062, now seen corresponding path program 1 times [2023-11-29 05:44:13,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:13,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593434281] [2023-11-29 05:44:13,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:13,740 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-29 05:44:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593434281] [2023-11-29 05:44:13,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593434281] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:13,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:13,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:13,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578388757] [2023-11-29 05:44:13,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:13,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:13,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:13,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:13,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:13,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:13,761 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-29 05:44:13,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:13,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:13,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:14,132 INFO L124 PetriNetUnfolderBase]: 772/1591 cut-off events. [2023-11-29 05:44:14,132 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 05:44:14,136 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-29 05:44:14,148 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 05:44:14,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 174 flow [2023-11-29 05:44:14,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:14,151 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:14,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:14,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,153 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-29 05:44:14,154 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-29 05:44:14,154 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-29 05:44:14,154 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:14,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 174 flow [2023-11-29 05:44:14,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:14,158 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 05:44:14,158 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-29 05:44:14,159 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 05:44:14,159 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 05:44:14,159 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-29 05:44:14,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:14,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:14,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:44:14,160 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-29 05:44:14,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:14,161 INFO L85 PathProgramCache]: Analyzing trace with hash 76132508, now seen corresponding path program 1 times [2023-11-29 05:44:14,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:14,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212220551] [2023-11-29 05:44:14,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:14,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,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-29 05:44:14,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:14,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212220551] [2023-11-29 05:44:14,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212220551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:14,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:14,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:14,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473863003] [2023-11-29 05:44:14,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:14,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:14,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:14,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:14,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:14,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:14,248 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-29 05:44:14,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:14,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:14,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:14,526 INFO L124 PetriNetUnfolderBase]: 794/1589 cut-off events. [2023-11-29 05:44:14,526 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 05:44:14,529 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-29 05:44:14,537 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 05:44:14,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 174 flow [2023-11-29 05:44:14,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-29 05:44:14,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-29 05:44:14,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-29 05:44:14,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-29 05:44:14,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:14,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-29 05:44:14,540 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-29 05:44:14,541 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-29 05:44:14,542 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-29 05:44:14,542 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 118 transitions. [2023-11-29 05:44:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 174 flow [2023-11-29 05:44:14,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:14,545 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 05:44:14,545 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-29 05:44:14,546 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 05:44:14,546 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 05:44:14,547 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-29 05:44:14,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:14,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:14,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:44:14,548 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-29 05:44:14,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:14,548 INFO L85 PathProgramCache]: Analyzing trace with hash 76132509, now seen corresponding path program 1 times [2023-11-29 05:44:14,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:14,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394686706] [2023-11-29 05:44:14,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:14,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:14,641 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-29 05:44:14,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:14,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394686706] [2023-11-29 05:44:14,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394686706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:14,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:14,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:14,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401319767] [2023-11-29 05:44:14,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:14,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:14,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:14,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:14,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:14,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:14,660 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-29 05:44:14,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:14,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:14,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:14,906 INFO L124 PetriNetUnfolderBase]: 772/1492 cut-off events. [2023-11-29 05:44:14,906 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-29 05:44:14,908 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-29 05:44:14,916 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 05:44:14,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-29 05:44:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:14,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:14,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:14,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:14,919 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-29 05:44:14,920 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-29 05:44:14,920 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-29 05:44:14,920 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:14,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-29 05:44:14,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:14,924 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 05:44:14,924 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-29 05:44:14,925 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 05:44:14,925 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 05:44:14,926 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-29 05:44:14,926 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:14,926 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:44:14,926 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-29 05:44:14,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 76133552, now seen corresponding path program 1 times [2023-11-29 05:44:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50050190] [2023-11-29 05:44:14,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:15,032 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-29 05:44:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:15,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50050190] [2023-11-29 05:44:15,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50050190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:15,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:15,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:15,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688014868] [2023-11-29 05:44:15,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:15,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:15,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:15,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:15,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-29 05:44:15,036 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-29 05:44:15,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:15,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-29 05:44:15,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:15,255 INFO L124 PetriNetUnfolderBase]: 603/1140 cut-off events. [2023-11-29 05:44:15,255 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:15,257 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-29 05:44:15,262 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-29 05:44:15,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-29 05:44:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 05:44:15,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7696969696969697 [2023-11-29 05:44:15,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 05:44:15,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 05:44:15,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:15,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 05:44:15,266 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-29 05:44:15,267 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-29 05:44:15,267 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-29 05:44:15,267 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 127 transitions. [2023-11-29 05:44:15,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-29 05:44:15,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:15,270 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-29 05:44:15,270 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-29 05:44:15,271 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 05:44:15,271 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-29 05:44:15,272 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-29 05:44:15,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:15,272 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-29 05:44:15,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:44:15,272 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-29 05:44:15,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:15,273 INFO L85 PathProgramCache]: Analyzing trace with hash -525413068, now seen corresponding path program 1 times [2023-11-29 05:44:15,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:15,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988742846] [2023-11-29 05:44:15,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:15,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:15,794 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-29 05:44:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:15,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988742846] [2023-11-29 05:44:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988742846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:44:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449865325] [2023-11-29 05:44:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:15,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:44:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:44:15,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:44:16,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:16,048 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-29 05:44:16,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:16,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:16,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:16,491 INFO L124 PetriNetUnfolderBase]: 721/1359 cut-off events. [2023-11-29 05:44:16,492 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-29 05:44:16,494 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-29 05:44:16,501 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 34 selfloop transitions, 4 changer transitions 10/66 dead transitions. [2023-11-29 05:44:16,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 244 flow [2023-11-29 05:44:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:16,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:44:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2023-11-29 05:44:16,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6181818181818182 [2023-11-29 05:44:16,503 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 238 transitions. [2023-11-29 05:44:16,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 238 transitions. [2023-11-29 05:44:16,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:16,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 238 transitions. [2023-11-29 05:44:16,505 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-29 05:44:16,507 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-29 05:44:16,507 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-29 05:44:16,507 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 7 states and 238 transitions. [2023-11-29 05:44:16,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 244 flow [2023-11-29 05:44:16,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:16,510 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 92 flow [2023-11-29 05:44:16,510 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-29 05:44:16,511 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 05:44:16,511 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 92 flow [2023-11-29 05:44:16,511 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-29 05:44:16,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:16,512 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-29 05:44:16,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:44:16,512 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-29 05:44:16,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:16,513 INFO L85 PathProgramCache]: Analyzing trace with hash -525413606, now seen corresponding path program 1 times [2023-11-29 05:44:16,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:16,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430977802] [2023-11-29 05:44:16,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:16,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:16,671 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-29 05:44:16,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:16,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430977802] [2023-11-29 05:44:16,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430977802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:16,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:16,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:16,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702763038] [2023-11-29 05:44:16,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:16,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:16,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:16,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:16,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:16,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:16,684 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-29 05:44:16,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:16,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:16,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:17,016 INFO L124 PetriNetUnfolderBase]: 1213/2160 cut-off events. [2023-11-29 05:44:17,016 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-29 05:44:17,019 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-29 05:44:17,031 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 39 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2023-11-29 05:44:17,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 62 transitions, 236 flow [2023-11-29 05:44:17,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:44:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2023-11-29 05:44:17,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7045454545454546 [2023-11-29 05:44:17,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 155 transitions. [2023-11-29 05:44:17,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 155 transitions. [2023-11-29 05:44:17,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:17,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 155 transitions. [2023-11-29 05:44:17,034 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-29 05:44:17,035 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-29 05:44:17,035 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-29 05:44:17,036 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 92 flow. Second operand 4 states and 155 transitions. [2023-11-29 05:44:17,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 62 transitions, 236 flow [2023-11-29 05:44:17,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 225 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:44:17,038 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 119 flow [2023-11-29 05:44:17,038 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-29 05:44:17,039 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 05:44:17,039 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 119 flow [2023-11-29 05:44:17,040 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-29 05:44:17,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:17,040 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-29 05:44:17,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:44:17,040 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-29 05:44:17,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 27692455, now seen corresponding path program 1 times [2023-11-29 05:44:17,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:17,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041721784] [2023-11-29 05:44:17,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:17,281 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-29 05:44:17,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:17,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041721784] [2023-11-29 05:44:17,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041721784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:17,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:17,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:44:17,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698054878] [2023-11-29 05:44:17,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:17,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:44:17,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:17,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:44:17,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:17,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:17,296 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-29 05:44:17,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:17,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:17,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:17,638 INFO L124 PetriNetUnfolderBase]: 809/1456 cut-off events. [2023-11-29 05:44:17,638 INFO L125 PetriNetUnfolderBase]: For 384/384 co-relation queries the response was YES. [2023-11-29 05:44:17,641 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-29 05:44:17,647 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 49 selfloop transitions, 8 changer transitions 1/75 dead transitions. [2023-11-29 05:44:17,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 75 transitions, 322 flow [2023-11-29 05:44:17,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:44:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:44:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 195 transitions. [2023-11-29 05:44:17,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 05:44:17,650 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 195 transitions. [2023-11-29 05:44:17,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 195 transitions. [2023-11-29 05:44:17,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:17,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 195 transitions. [2023-11-29 05:44:17,651 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-29 05:44:17,652 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-29 05:44:17,652 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-29 05:44:17,652 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 119 flow. Second operand 5 states and 195 transitions. [2023-11-29 05:44:17,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 75 transitions, 322 flow [2023-11-29 05:44:17,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 75 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:17,655 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 159 flow [2023-11-29 05:44:17,655 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-29 05:44:17,656 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 05:44:17,656 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 159 flow [2023-11-29 05:44:17,657 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-29 05:44:17,657 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:17,657 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-29 05:44:17,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:44:17,657 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-29 05:44:17,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -968843194, now seen corresponding path program 1 times [2023-11-29 05:44:17,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:17,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838347655] [2023-11-29 05:44:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:17,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:17,926 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-29 05:44:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:17,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838347655] [2023-11-29 05:44:17,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838347655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:17,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:17,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:44:17,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519395130] [2023-11-29 05:44:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:17,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:17,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:17,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:17,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:17,934 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-29 05:44:17,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:17,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:17,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:18,231 INFO L124 PetriNetUnfolderBase]: 477/840 cut-off events. [2023-11-29 05:44:18,231 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-29 05:44:18,233 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-29 05:44:18,236 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 43 selfloop transitions, 11 changer transitions 1/72 dead transitions. [2023-11-29 05:44:18,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 333 flow [2023-11-29 05:44:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:44:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 219 transitions. [2023-11-29 05:44:18,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6636363636363637 [2023-11-29 05:44:18,238 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 219 transitions. [2023-11-29 05:44:18,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 219 transitions. [2023-11-29 05:44:18,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:18,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 219 transitions. [2023-11-29 05:44:18,240 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-29 05:44:18,241 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-29 05:44:18,242 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-29 05:44:18,242 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 159 flow. Second operand 6 states and 219 transitions. [2023-11-29 05:44:18,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 333 flow [2023-11-29 05:44:18,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 05:44:18,246 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 173 flow [2023-11-29 05:44:18,247 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-29 05:44:18,247 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -1 predicate places. [2023-11-29 05:44:18,247 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 173 flow [2023-11-29 05:44:18,248 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-29 05:44:18,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:18,248 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-29 05:44:18,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:44:18,248 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-29 05:44:18,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:18,249 INFO L85 PathProgramCache]: Analyzing trace with hash 57969529, now seen corresponding path program 1 times [2023-11-29 05:44:18,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:18,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386106924] [2023-11-29 05:44:18,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:18,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386106924] [2023-11-29 05:44:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386106924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698051369] [2023-11-29 05:44:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:18,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:18,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:18,583 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 05:44:18,584 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-29 05:44:18,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:18,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 05:44:18,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:18,960 INFO L124 PetriNetUnfolderBase]: 800/1462 cut-off events. [2023-11-29 05:44:18,961 INFO L125 PetriNetUnfolderBase]: For 612/623 co-relation queries the response was YES. [2023-11-29 05:44:18,963 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-29 05:44:18,969 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 48 selfloop transitions, 9 changer transitions 10/89 dead transitions. [2023-11-29 05:44:18,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 89 transitions, 416 flow [2023-11-29 05:44:18,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:44:18,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:44:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 250 transitions. [2023-11-29 05:44:18,971 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6493506493506493 [2023-11-29 05:44:18,971 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 250 transitions. [2023-11-29 05:44:18,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 250 transitions. [2023-11-29 05:44:18,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:18,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 250 transitions. [2023-11-29 05:44:18,973 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-29 05:44:18,974 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-29 05:44:18,974 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-29 05:44:18,974 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 173 flow. Second operand 7 states and 250 transitions. [2023-11-29 05:44:18,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 89 transitions, 416 flow [2023-11-29 05:44:18,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 89 transitions, 352 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-29 05:44:18,980 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 183 flow [2023-11-29 05:44:18,980 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-29 05:44:18,981 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 2 predicate places. [2023-11-29 05:44:18,981 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 183 flow [2023-11-29 05:44:18,982 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-29 05:44:18,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:18,982 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-29 05:44:18,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:44:18,982 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-29 05:44:18,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1495297993, now seen corresponding path program 2 times [2023-11-29 05:44:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402303424] [2023-11-29 05:44:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:19,508 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-29 05:44:19,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:19,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402303424] [2023-11-29 05:44:19,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402303424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:19,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:19,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:44:19,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883375511] [2023-11-29 05:44:19,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:19,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:44:19,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:19,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:44:19,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:44:19,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 05:44:19,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 27.818181818181817) internal successors, (306), 11 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:19,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:19,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 05:44:19,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:20,373 INFO L124 PetriNetUnfolderBase]: 1405/2546 cut-off events. [2023-11-29 05:44:20,373 INFO L125 PetriNetUnfolderBase]: For 880/909 co-relation queries the response was YES. [2023-11-29 05:44:20,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6056 conditions, 2546 events. 1405/2546 cut-off events. For 880/909 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15520 event pairs, 295 based on Foata normal form. 15/2496 useless extension candidates. Maximal degree in co-relation 6039. Up to 986 conditions per place. [2023-11-29 05:44:20,386 INFO L140 encePairwiseOnDemand]: 43/55 looper letters, 56 selfloop transitions, 19 changer transitions 30/127 dead transitions. [2023-11-29 05:44:20,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 127 transitions, 668 flow [2023-11-29 05:44:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:44:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 05:44:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 405 transitions. [2023-11-29 05:44:20,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2023-11-29 05:44:20,389 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 405 transitions. [2023-11-29 05:44:20,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 405 transitions. [2023-11-29 05:44:20,389 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:20,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 405 transitions. [2023-11-29 05:44:20,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 33.75) internal successors, (405), 12 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:20,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:20,393 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 55.0) internal successors, (715), 13 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:20,393 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 183 flow. Second operand 12 states and 405 transitions. [2023-11-29 05:44:20,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 127 transitions, 668 flow [2023-11-29 05:44:20,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 127 transitions, 662 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:20,398 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 337 flow [2023-11-29 05:44:20,399 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=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=337, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-11-29 05:44:20,399 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 17 predicate places. [2023-11-29 05:44:20,400 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 337 flow [2023-11-29 05:44:20,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 27.818181818181817) internal successors, (306), 11 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:20,400 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:20,400 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-29 05:44:20,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:44:20,401 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-29 05:44:20,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1907674729, now seen corresponding path program 3 times [2023-11-29 05:44:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959575724] [2023-11-29 05:44:20,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:20,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:20,671 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-29 05:44:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:44:20,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959575724] [2023-11-29 05:44:20,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959575724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:20,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:20,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:44:20,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605858735] [2023-11-29 05:44:20,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:20,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:44:20,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:44:20,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:44:20,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:44:20,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 55 [2023-11-29 05:44:20,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 337 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-29 05:44:20,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:20,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 55 [2023-11-29 05:44:20,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:21,190 INFO L124 PetriNetUnfolderBase]: 1253/2310 cut-off events. [2023-11-29 05:44:21,190 INFO L125 PetriNetUnfolderBase]: For 2039/2134 co-relation queries the response was YES. [2023-11-29 05:44:21,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6361 conditions, 2310 events. 1253/2310 cut-off events. For 2039/2134 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13941 event pairs, 339 based on Foata normal form. 26/2269 useless extension candidates. Maximal degree in co-relation 6336. Up to 931 conditions per place. [2023-11-29 05:44:21,247 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 38 selfloop transitions, 6 changer transitions 44/110 dead transitions. [2023-11-29 05:44:21,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 662 flow [2023-11-29 05:44:21,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:44:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:44:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 280 transitions. [2023-11-29 05:44:21,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2023-11-29 05:44:21,251 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 280 transitions. [2023-11-29 05:44:21,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 280 transitions. [2023-11-29 05:44:21,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:21,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 280 transitions. [2023-11-29 05:44:21,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:21,254 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-29 05:44:21,254 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-29 05:44:21,254 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 337 flow. Second operand 8 states and 280 transitions. [2023-11-29 05:44:21,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 662 flow [2023-11-29 05:44:21,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 110 transitions, 651 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:44:21,261 INFO L231 Difference]: Finished difference. Result has 79 places, 54 transitions, 229 flow [2023-11-29 05:44:21,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=229, PETRI_PLACES=79, PETRI_TRANSITIONS=54} [2023-11-29 05:44:21,262 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 19 predicate places. [2023-11-29 05:44:21,262 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 54 transitions, 229 flow [2023-11-29 05:44:21,262 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-29 05:44:21,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:21,262 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-29 05:44:21,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:44:21,263 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-29 05:44:21,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:21,263 INFO L85 PathProgramCache]: Analyzing trace with hash 554015223, now seen corresponding path program 4 times [2023-11-29 05:44:21,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:44:21,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515116999] [2023-11-29 05:44:21,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:21,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:44:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:44:21,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:44:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:44:21,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:44:21,390 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:44:21,391 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 05:44:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 05:44:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 05:44:21,393 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 05:44:21,394 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 05:44:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 05:44:21,395 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 05:44:21,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:44:21,395 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:21,401 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:44:21,402 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:44:21,461 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:44:21,463 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:44:21,466 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:44:21,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:44:21,482 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:44:21,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:44:21 BasicIcfg [2023-11-29 05:44:21,497 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:44:21,498 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:44:21,498 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:44:21,498 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:44:21,499 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:11" (3/4) ... [2023-11-29 05:44:21,500 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:44:21,501 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:44:21,502 INFO L158 Benchmark]: Toolchain (without parser) took 11761.10ms. Allocated memory was 153.1MB in the beginning and 270.5MB in the end (delta: 117.4MB). Free memory was 107.6MB in the beginning and 179.8MB in the end (delta: -72.1MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,502 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:44:21,503 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.20ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 83.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,503 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.78ms. Allocated memory is still 153.1MB. Free memory was 83.7MB in the beginning and 81.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,503 INFO L158 Benchmark]: Boogie Preprocessor took 68.39ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 77.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,504 INFO L158 Benchmark]: RCFGBuilder took 836.45ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 83.5MB in the end (delta: -5.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,504 INFO L158 Benchmark]: TraceAbstraction took 10230.18ms. Allocated memory was 153.1MB in the beginning and 270.5MB in the end (delta: 117.4MB). Free memory was 83.1MB in the beginning and 179.8MB in the end (delta: -96.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. [2023-11-29 05:44:21,504 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 270.5MB. Free memory is still 179.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:44:21,506 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.20ms. Allocated memory is still 153.1MB. Free memory was 107.2MB in the beginning and 83.7MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.78ms. Allocated memory is still 153.1MB. Free memory was 83.7MB in the beginning and 81.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.39ms. Allocated memory is still 153.1MB. Free memory was 81.3MB in the beginning and 77.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 836.45ms. Allocated memory is still 153.1MB. Free memory was 77.9MB in the beginning and 83.5MB in the end (delta: -5.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10230.18ms. Allocated memory was 153.1MB in the beginning and 270.5MB in the end (delta: 117.4MB). Free memory was 83.1MB in the beginning and 179.8MB in the end (delta: -96.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 270.5MB. Free memory is still 179.8MB. 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}, 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] [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=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=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=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=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=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: 10.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 749 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 296 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 244 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1782 IncrementalHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 52 mSDtfsCounter, 1782 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=337occurred in iteration=13, InterpolantAutomatonStates: 70, 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.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 265 NumberOfCodeBlocks, 265 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 216 ConstructedInterpolants, 0 QuantifiedInterpolants, 1433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-29 05:44:21,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 05:44:23,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:44:23,977 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:44:23,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:44:23,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:44:24,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:44:24,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:44:24,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:44:24,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:44:24,035 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:44:24,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:44:24,036 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:44:24,037 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:44:24,038 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:44:24,039 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:44:24,039 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:44:24,040 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:44:24,041 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:44:24,041 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:44:24,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:44:24,043 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:44:24,043 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:44:24,044 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:44:24,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:44:24,045 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:44:24,046 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:44:24,046 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:44:24,047 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:44:24,047 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:44:24,048 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:44:24,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:44:24,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:44:24,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:44:24,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:44:24,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:24,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:44:24,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:44:24,051 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:44:24,051 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:44:24,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:44:24,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:44:24,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:44:24,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:44:24,053 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:44:24,053 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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/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_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya 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-29 05:44:24,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:44:24,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:44:24,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:44:24,444 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:44:24,445 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:44:24,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-29 05:44:27,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:44:27,996 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:44:27,997 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/sv-benchmarks/c/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-11-29 05:44:28,016 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/fa936ac79/f9f6111bd43345458cbc020d94ee19d6/FLAG2ce79c6f6 [2023-11-29 05:44:28,034 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/data/fa936ac79/f9f6111bd43345458cbc020d94ee19d6 [2023-11-29 05:44:28,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:44:28,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:44:28,041 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:28,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:44:28,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:44:28,048 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73937d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28, skipping insertion in model container [2023-11-29 05:44:28,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,108 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:44:28,524 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:28,543 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:44:28,606 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:44:28,654 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:44:28,654 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:44:28,664 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:44:28,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28 WrapperNode [2023-11-29 05:44:28,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:44:28,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:28,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:44:28,666 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:44:28,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,736 INFO L138 Inliner]: procedures = 179, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-11-29 05:44:28,737 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:44:28,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:44:28,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:44:28,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:44:28,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,779 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 05:44:28,779 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,792 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,794 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,798 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:44:28,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:44:28,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:44:28,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:44:28,809 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (1/1) ... [2023-11-29 05:44:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:44:28,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:44:28,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:44:28,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:44:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:44:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:44:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:44:28,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:44:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:44:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:44:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:44:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:44:28,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:44:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:44:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:44:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:44:28,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:44:28,911 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:44:28,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:44:28,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:44:28,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:44:28,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:44:28,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:44:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:44:28,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:44:28,915 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:44:29,110 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:44:29,113 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:44:29,506 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:44:29,774 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:44:29,775 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:44:29,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:29 BoogieIcfgContainer [2023-11-29 05:44:29,775 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:44:29,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:44:29,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:44:29,784 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:44:29,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:44:28" (1/3) ... [2023-11-29 05:44:29,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3abeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:29, skipping insertion in model container [2023-11-29 05:44:29,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:44:28" (2/3) ... [2023-11-29 05:44:29,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3abeca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:44:29, skipping insertion in model container [2023-11-29 05:44:29,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:29" (3/3) ... [2023-11-29 05:44:29,787 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-11-29 05:44:29,813 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:44:29,813 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-29 05:44:29,814 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:44:29,883 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:44:29,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 05:44:29,961 INFO L124 PetriNetUnfolderBase]: 2/52 cut-off events. [2023-11-29 05:44:29,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:44:29,966 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-29 05:44:29,966 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 55 transitions, 122 flow [2023-11-29 05:44:29,970 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 113 flow [2023-11-29 05:44:29,982 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:44:30,000 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;@1be21e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:44:30,000 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-29 05:44:30,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:44:30,004 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:44:30,005 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:44:30,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:30,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:44:30,006 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-29 05:44:30,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 12566, now seen corresponding path program 1 times [2023-11-29 05:44:30,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:30,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482667585] [2023-11-29 05:44:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:30,027 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-29 05:44:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:30,061 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:30,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:30,173 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:44:30,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:30,283 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-29 05:44:30,296 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-29 05:44:30,296 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:30,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482667585] [2023-11-29 05:44:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482667585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:30,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:30,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:30,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79121854] [2023-11-29 05:44:30,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:30,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:30,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:30,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:30,390 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-29 05:44:30,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:30,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:30,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:30,911 INFO L124 PetriNetUnfolderBase]: 772/1598 cut-off events. [2023-11-29 05:44:30,912 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:44:30,921 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-29 05:44:30,938 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-29 05:44:30,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 181 flow [2023-11-29 05:44:30,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:30,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:30,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:30,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:30,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:30,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:30,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:30,958 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:30,961 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-29 05:44:30,966 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-29 05:44:30,967 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-29 05:44:30,970 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 113 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:30,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 181 flow [2023-11-29 05:44:30,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 178 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:44:30,980 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 106 flow [2023-11-29 05:44:30,982 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-29 05:44:30,987 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 05:44:30,988 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 106 flow [2023-11-29 05:44:30,988 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-29 05:44:30,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:30,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:44:30,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:31,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:31,190 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-29 05:44:31,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 12567, now seen corresponding path program 1 times [2023-11-29 05:44:31,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371861447] [2023-11-29 05:44:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:31,192 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-29 05:44:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:31,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:31,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:31,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:31,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:31,303 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-29 05:44:31,318 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-29 05:44:31,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:31,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:31,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371861447] [2023-11-29 05:44:31,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371861447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:31,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:31,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73946893] [2023-11-29 05:44:31,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:31,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:31,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:31,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:31,379 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-29 05:44:31,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:31,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:31,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:31,823 INFO L124 PetriNetUnfolderBase]: 772/1597 cut-off events. [2023-11-29 05:44:31,824 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:31,829 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-29 05:44:31,842 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-29 05:44:31,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 55 transitions, 178 flow [2023-11-29 05:44:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:31,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:31,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:31,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:31,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:31,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:31,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:31,849 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-29 05:44:31,851 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-29 05:44:31,851 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-29 05:44:31,851 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 106 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:31,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 55 transitions, 178 flow [2023-11-29 05:44:31,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:31,857 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-29 05:44:31,858 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-29 05:44:31,859 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2023-11-29 05:44:31,859 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-29 05:44:31,860 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-29 05:44:31,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:31,860 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:44:31,863 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,061 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-29 05:44:32,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 374734671, now seen corresponding path program 1 times [2023-11-29 05:44:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:32,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074151239] [2023-11-29 05:44:32,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:32,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-29 05:44:32,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:32,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:32,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:44:32,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:32,186 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-29 05:44:32,194 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-29 05:44:32,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:32,195 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:32,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074151239] [2023-11-29 05:44:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074151239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:32,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:32,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108528279] [2023-11-29 05:44:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:32,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:32,233 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:32,234 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-29 05:44:32,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:32,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:32,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:32,683 INFO L124 PetriNetUnfolderBase]: 774/1596 cut-off events. [2023-11-29 05:44:32,683 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:32,688 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-29 05:44:32,701 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-29 05:44:32,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 178 flow [2023-11-29 05:44:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-29 05:44:32,704 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-29 05:44:32,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-29 05:44:32,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-29 05:44:32,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:32,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-29 05:44:32,706 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-29 05:44:32,707 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-29 05:44:32,707 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-29 05:44:32,708 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 118 transitions. [2023-11-29 05:44:32,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 178 flow [2023-11-29 05:44:32,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 174 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:32,713 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-29 05:44:32,713 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-29 05:44:32,714 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -5 predicate places. [2023-11-29 05:44:32,714 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-29 05:44:32,715 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-29 05:44:32,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:32,715 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:44:32,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:32,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,916 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-29 05:44:32,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:32,917 INFO L85 PathProgramCache]: Analyzing trace with hash 374734672, now seen corresponding path program 1 times [2023-11-29 05:44:32,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:32,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243217106] [2023-11-29 05:44:32,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:32,918 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-29 05:44:32,918 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:32,919 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:32,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:33,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:33,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:33,031 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-29 05:44:33,042 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-29 05:44:33,042 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:33,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:33,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243217106] [2023-11-29 05:44:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243217106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127579568] [2023-11-29 05:44:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:33,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:33,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:33,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:33,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:33,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:33,081 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-29 05:44:33,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:33,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:33,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:33,438 INFO L124 PetriNetUnfolderBase]: 772/1580 cut-off events. [2023-11-29 05:44:33,438 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 05:44:33,443 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-29 05:44:33,456 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-29 05:44:33,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 174 flow [2023-11-29 05:44:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:33,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:33,459 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:33,459 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:33,459 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:33,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:33,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:33,461 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-29 05:44:33,462 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-29 05:44:33,462 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-29 05:44:33,463 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:33,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 174 flow [2023-11-29 05:44:33,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:33,467 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-29 05:44:33,468 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-29 05:44:33,469 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -6 predicate places. [2023-11-29 05:44:33,469 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-29 05:44:33,470 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-29 05:44:33,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:33,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:33,473 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 05:44:33,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:33,673 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-29 05:44:33,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:33,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1100960156, now seen corresponding path program 1 times [2023-11-29 05:44:33,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:33,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494595638] [2023-11-29 05:44:33,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:33,674 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-29 05:44:33,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:33,675 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:33,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:33,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:33,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:44:33,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:33,795 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-29 05:44:33,802 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-29 05:44:33,802 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:33,802 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:33,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494595638] [2023-11-29 05:44:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494595638] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671245736] [2023-11-29 05:44:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:33,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:33,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:33,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:33,841 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 55 [2023-11-29 05:44:33,842 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-29 05:44:33,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:33,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 55 [2023-11-29 05:44:33,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:34,168 INFO L124 PetriNetUnfolderBase]: 794/1598 cut-off events. [2023-11-29 05:44:34,169 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 05:44:34,174 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-29 05:44:34,187 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 28 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-29 05:44:34,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 174 flow [2023-11-29 05:44:34,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2023-11-29 05:44:34,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7151515151515152 [2023-11-29 05:44:34,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 118 transitions. [2023-11-29 05:44:34,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 118 transitions. [2023-11-29 05:44:34,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:34,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 118 transitions. [2023-11-29 05:44:34,191 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-29 05:44:34,192 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-29 05:44:34,193 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-29 05:44:34,193 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 118 transitions. [2023-11-29 05:44:34,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 174 flow [2023-11-29 05:44:34,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:34,197 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-29 05:44:34,197 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-29 05:44:34,198 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 05:44:34,198 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-29 05:44:34,198 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-29 05:44:34,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:34,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:34,202 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:34,402 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-29 05:44:34,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1100960157, now seen corresponding path program 1 times [2023-11-29 05:44:34,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:34,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420841280] [2023-11-29 05:44:34,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:34,404 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-29 05:44:34,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:34,406 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:34,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:34,517 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:34,519 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:34,526 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-29 05:44:34,538 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-29 05:44:34,538 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:34,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:34,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420841280] [2023-11-29 05:44:34,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1420841280] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:34,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:34,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:44:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225460749] [2023-11-29 05:44:34,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:34,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:34,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:34,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:34,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:34,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:34,596 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-29 05:44:34,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:34,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:34,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:34,897 INFO L124 PetriNetUnfolderBase]: 772/1561 cut-off events. [2023-11-29 05:44:34,897 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2023-11-29 05:44:34,901 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-29 05:44:34,912 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2023-11-29 05:44:34,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 170 flow [2023-11-29 05:44:34,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2023-11-29 05:44:34,913 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:44:34,913 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 120 transitions. [2023-11-29 05:44:34,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 120 transitions. [2023-11-29 05:44:34,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:34,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 120 transitions. [2023-11-29 05:44:34,914 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-29 05:44:34,915 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-29 05:44:34,916 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-29 05:44:34,916 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 120 transitions. [2023-11-29 05:44:34,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 170 flow [2023-11-29 05:44:34,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:34,919 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 96 flow [2023-11-29 05:44:34,920 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-29 05:44:34,921 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2023-11-29 05:44:34,921 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 96 flow [2023-11-29 05:44:34,921 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-29 05:44:34,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:34,921 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:34,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:44:35,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,122 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-29 05:44:35,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:35,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1100961200, now seen corresponding path program 1 times [2023-11-29 05:44:35,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:35,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97948883] [2023-11-29 05:44:35,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:35,124 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-29 05:44:35,124 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:35,125 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:35,220 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:44:35,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:35,238 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:35,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:35,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97948883] [2023-11-29 05:44:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97948883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:35,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:35,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:44:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652389912] [2023-11-29 05:44:35,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:35,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:44:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:44:35,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:44:35,241 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 55 [2023-11-29 05:44:35,241 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-29 05:44:35,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:35,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 55 [2023-11-29 05:44:35,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:35,415 INFO L124 PetriNetUnfolderBase]: 603/1140 cut-off events. [2023-11-29 05:44:35,416 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-29 05:44:35,418 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-29 05:44:35,423 INFO L140 encePairwiseOnDemand]: 52/55 looper letters, 29 selfloop transitions, 2 changer transitions 2/55 dead transitions. [2023-11-29 05:44:35,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 55 transitions, 192 flow [2023-11-29 05:44:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:44:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:44:35,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2023-11-29 05:44:35,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7696969696969697 [2023-11-29 05:44:35,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 127 transitions. [2023-11-29 05:44:35,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 127 transitions. [2023-11-29 05:44:35,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:35,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 127 transitions. [2023-11-29 05:44:35,425 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-29 05:44:35,426 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-29 05:44:35,426 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-29 05:44:35,427 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 96 flow. Second operand 3 states and 127 transitions. [2023-11-29 05:44:35,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 55 transitions, 192 flow [2023-11-29 05:44:35,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 55 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:35,429 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 92 flow [2023-11-29 05:44:35,429 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-29 05:44:35,430 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -9 predicate places. [2023-11-29 05:44:35,430 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 92 flow [2023-11-29 05:44:35,430 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-29 05:44:35,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:35,431 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-29 05:44:35,433 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 05:44:35,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,631 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-29 05:44:35,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1440704652, now seen corresponding path program 1 times [2023-11-29 05:44:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:35,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552785350] [2023-11-29 05:44:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:35,632 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-29 05:44:35,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:35,634 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:35,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:44:35,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:35,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:44:35,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:35,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:35,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552785350] [2023-11-29 05:44:35,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552785350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:35,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:35,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:44:35,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604133737] [2023-11-29 05:44:35,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:35,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:44:35,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:44:35,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:44:35,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:35,821 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-29 05:44:35,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:35,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:35,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:36,245 INFO L124 PetriNetUnfolderBase]: 1361/2444 cut-off events. [2023-11-29 05:44:36,245 INFO L125 PetriNetUnfolderBase]: For 128/128 co-relation queries the response was YES. [2023-11-29 05:44:36,251 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-29 05:44:36,268 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 40 selfloop transitions, 5 changer transitions 1/64 dead transitions. [2023-11-29 05:44:36,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 238 flow [2023-11-29 05:44:36,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:44:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:44:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2023-11-29 05:44:36,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7090909090909091 [2023-11-29 05:44:36,270 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 156 transitions. [2023-11-29 05:44:36,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 156 transitions. [2023-11-29 05:44:36,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:36,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 156 transitions. [2023-11-29 05:44:36,272 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-29 05:44:36,273 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-29 05:44:36,273 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-29 05:44:36,273 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 92 flow. Second operand 4 states and 156 transitions. [2023-11-29 05:44:36,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 238 flow [2023-11-29 05:44:36,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 230 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:36,276 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 122 flow [2023-11-29 05:44:36,276 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-29 05:44:36,277 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -7 predicate places. [2023-11-29 05:44:36,277 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 122 flow [2023-11-29 05:44:36,277 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-29 05:44:36,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:36,278 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-29 05:44:36,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:36,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:36,481 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-29 05:44:36,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -135359667, now seen corresponding path program 1 times [2023-11-29 05:44:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:36,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480878659] [2023-11-29 05:44:36,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:36,483 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-29 05:44:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:36,484 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:36,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:36,603 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:44:36,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:36,654 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-29 05:44:36,655 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:36,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:36,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480878659] [2023-11-29 05:44:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480878659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:36,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:44:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553229293] [2023-11-29 05:44:36,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:36,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:44:36,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:44:36,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:44:36,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:36,678 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-29 05:44:36,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:36,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:36,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:36,992 INFO L124 PetriNetUnfolderBase]: 877/1596 cut-off events. [2023-11-29 05:44:36,992 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2023-11-29 05:44:36,997 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-29 05:44:37,007 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 50 selfloop transitions, 8 changer transitions 1/77 dead transitions. [2023-11-29 05:44:37,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 77 transitions, 327 flow [2023-11-29 05:44:37,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:44:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:44:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2023-11-29 05:44:37,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7127272727272728 [2023-11-29 05:44:37,010 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 196 transitions. [2023-11-29 05:44:37,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 196 transitions. [2023-11-29 05:44:37,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:37,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 196 transitions. [2023-11-29 05:44:37,012 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-29 05:44:37,014 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-29 05:44:37,014 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-29 05:44:37,014 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 122 flow. Second operand 5 states and 196 transitions. [2023-11-29 05:44:37,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 77 transitions, 327 flow [2023-11-29 05:44:37,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 317 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:44:37,018 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 162 flow [2023-11-29 05:44:37,019 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-29 05:44:37,020 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2023-11-29 05:44:37,020 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 162 flow [2023-11-29 05:44:37,020 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-29 05:44:37,020 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:37,021 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-29 05:44:37,024 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:37,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:37,221 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-29 05:44:37,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:37,222 INFO L85 PathProgramCache]: Analyzing trace with hash 222688736, now seen corresponding path program 1 times [2023-11-29 05:44:37,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:37,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017827834] [2023-11-29 05:44:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:37,223 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-29 05:44:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:37,225 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:37,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:37,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:44:37,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:37,440 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-29 05:44:37,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:37,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:37,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017827834] [2023-11-29 05:44:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017827834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:37,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:37,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:44:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629177506] [2023-11-29 05:44:37,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:37,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:37,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 55 [2023-11-29 05:44:37,453 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-29 05:44:37,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:37,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 55 [2023-11-29 05:44:37,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:37,783 INFO L124 PetriNetUnfolderBase]: 489/868 cut-off events. [2023-11-29 05:44:37,783 INFO L125 PetriNetUnfolderBase]: For 730/730 co-relation queries the response was YES. [2023-11-29 05:44:37,786 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-29 05:44:37,791 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 44 selfloop transitions, 11 changer transitions 1/74 dead transitions. [2023-11-29 05:44:37,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 74 transitions, 338 flow [2023-11-29 05:44:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:44:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 220 transitions. [2023-11-29 05:44:37,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:44:37,793 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 220 transitions. [2023-11-29 05:44:37,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 220 transitions. [2023-11-29 05:44:37,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:37,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 220 transitions. [2023-11-29 05:44:37,795 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-29 05:44:37,796 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-29 05:44:37,797 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-29 05:44:37,797 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 162 flow. Second operand 6 states and 220 transitions. [2023-11-29 05:44:37,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 74 transitions, 338 flow [2023-11-29 05:44:37,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 313 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-29 05:44:37,802 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 176 flow [2023-11-29 05:44:37,802 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-29 05:44:37,803 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 0 predicate places. [2023-11-29 05:44:37,804 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 176 flow [2023-11-29 05:44:37,804 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-29 05:44:37,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:37,804 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-29 05:44:37,809 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 05:44:38,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:38,008 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-29 05:44:38,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:38,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1240809333, now seen corresponding path program 1 times [2023-11-29 05:44:38,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:38,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925733702] [2023-11-29 05:44:38,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:38,009 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-29 05:44:38,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:38,010 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:38,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:38,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:44:38,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:38,889 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t918~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t916~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t917~0#1.base_41| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t916~0#1.base_41| (_ bv1 1)))) (and (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t917~0#1.base_41|)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t916~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t917~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t918~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t916~0#1.base_41|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t917~0#1.base_41| (_ bv1 1)) |v_ULTIMATE.start_main_~#t918~0#1.base_43|))))) is different from true [2023-11-29 05:44:38,891 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-29 05:44:38,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:38,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:38,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925733702] [2023-11-29 05:44:38,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925733702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:38,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:38,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:44:38,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049931552] [2023-11-29 05:44:38,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:38,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:38,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:38,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:38,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-29 05:44:38,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 55 [2023-11-29 05:44:38,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:38,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:38,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 55 [2023-11-29 05:44:38,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:39,226 INFO L124 PetriNetUnfolderBase]: 278/615 cut-off events. [2023-11-29 05:44:39,226 INFO L125 PetriNetUnfolderBase]: For 164/170 co-relation queries the response was YES. [2023-11-29 05:44:39,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 615 events. 278/615 cut-off events. For 164/170 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3093 event pairs, 59 based on Foata normal form. 8/581 useless extension candidates. Maximal degree in co-relation 1269. Up to 383 conditions per place. [2023-11-29 05:44:39,232 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 29 selfloop transitions, 7 changer transitions 0/60 dead transitions. [2023-11-29 05:44:39,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 274 flow [2023-11-29 05:44:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:44:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2023-11-29 05:44:39,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49393939393939396 [2023-11-29 05:44:39,235 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 163 transitions. [2023-11-29 05:44:39,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 163 transitions. [2023-11-29 05:44:39,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:39,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 163 transitions. [2023-11-29 05:44:39,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 27.166666666666668) internal successors, (163), 6 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:39,238 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-29 05:44:39,238 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-29 05:44:39,238 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 176 flow. Second operand 6 states and 163 transitions. [2023-11-29 05:44:39,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 274 flow [2023-11-29 05:44:39,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 60 transitions, 218 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-29 05:44:39,241 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 152 flow [2023-11-29 05:44:39,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=152, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-11-29 05:44:39,242 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2023-11-29 05:44:39,243 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 152 flow [2023-11-29 05:44:39,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.166666666666668) internal successors, (145), 6 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:39,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:39,243 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-29 05:44:39,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:39,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:39,444 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-29 05:44:39,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1788532673, now seen corresponding path program 1 times [2023-11-29 05:44:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382998242] [2023-11-29 05:44:39,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:44:39,445 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-29 05:44:39,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:39,447 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:39,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:44:39,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:44:39,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:39,694 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-29 05:44:39,695 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:39,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382998242] [2023-11-29 05:44:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382998242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:39,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:39,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169024662] [2023-11-29 05:44:39,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:39,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:39,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:39,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 05:44:39,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 152 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-29 05:44:39,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:39,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 05:44:39,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:40,119 INFO L124 PetriNetUnfolderBase]: 660/1267 cut-off events. [2023-11-29 05:44:40,120 INFO L125 PetriNetUnfolderBase]: For 372/412 co-relation queries the response was YES. [2023-11-29 05:44:40,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1267 events. 660/1267 cut-off events. For 372/412 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 6787 event pairs, 140 based on Foata normal form. 8/1218 useless extension candidates. Maximal degree in co-relation 2931. Up to 538 conditions per place. [2023-11-29 05:44:40,131 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 53 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-11-29 05:44:40,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 376 flow [2023-11-29 05:44:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:40,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:44:40,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 221 transitions. [2023-11-29 05:44:40,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6696969696969697 [2023-11-29 05:44:40,134 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 221 transitions. [2023-11-29 05:44:40,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 221 transitions. [2023-11-29 05:44:40,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:40,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 221 transitions. [2023-11-29 05:44:40,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.833333333333336) internal successors, (221), 6 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:40,137 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-29 05:44:40,138 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-29 05:44:40,138 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 152 flow. Second operand 6 states and 221 transitions. [2023-11-29 05:44:40,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 376 flow [2023-11-29 05:44:40,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 358 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:44:40,142 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 181 flow [2023-11-29 05:44:40,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-11-29 05:44:40,143 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 3 predicate places. [2023-11-29 05:44:40,143 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 181 flow [2023-11-29 05:44:40,144 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-29 05:44:40,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:40,144 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-29 05:44:40,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:40,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:40,348 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-29 05:44:40,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:40,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1483174993, now seen corresponding path program 2 times [2023-11-29 05:44:40,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:40,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081864] [2023-11-29 05:44:40,350 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:44:40,350 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-29 05:44:40,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:40,351 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:40,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:40,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:44:40,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:44:40,485 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 05:44:40,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:40,958 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-29 05:44:40,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:40,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081864] [2023-11-29 05:44:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:40,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:44:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726230060] [2023-11-29 05:44:40,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:40,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:44:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:44:40,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:44:40,980 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 55 [2023-11-29 05:44:40,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 181 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-29 05:44:40,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:40,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 55 [2023-11-29 05:44:40,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:41,595 INFO L124 PetriNetUnfolderBase]: 793/1581 cut-off events. [2023-11-29 05:44:41,595 INFO L125 PetriNetUnfolderBase]: For 607/650 co-relation queries the response was YES. [2023-11-29 05:44:41,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3907 conditions, 1581 events. 793/1581 cut-off events. For 607/650 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 9264 event pairs, 204 based on Foata normal form. 8/1508 useless extension candidates. Maximal degree in co-relation 3891. Up to 667 conditions per place. [2023-11-29 05:44:41,609 INFO L140 encePairwiseOnDemand]: 46/55 looper letters, 56 selfloop transitions, 12 changer transitions 0/96 dead transitions. [2023-11-29 05:44:41,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 469 flow [2023-11-29 05:44:41,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:44:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 05:44:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2023-11-29 05:44:41,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6606060606060606 [2023-11-29 05:44:41,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 327 transitions. [2023-11-29 05:44:41,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 327 transitions. [2023-11-29 05:44:41,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:41,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 327 transitions. [2023-11-29 05:44:41,615 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-29 05:44:41,617 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-29 05:44:41,617 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-29 05:44:41,617 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 181 flow. Second operand 9 states and 327 transitions. [2023-11-29 05:44:41,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 469 flow [2023-11-29 05:44:41,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 96 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:44:41,623 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 274 flow [2023-11-29 05:44:41,623 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-29 05:44:41,624 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 14 predicate places. [2023-11-29 05:44:41,624 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 274 flow [2023-11-29 05:44:41,625 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-29 05:44:41,625 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:41,625 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-29 05:44:41,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:41,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:41,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-29 05:44:41,826 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1801357385, now seen corresponding path program 3 times [2023-11-29 05:44:41,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303437718] [2023-11-29 05:44:41,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:44:41,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-29 05:44:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:41,828 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:41,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:41,974 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:44:41,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:44:41,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:44:41,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:44:42,055 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-29 05:44:42,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:44:42,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:44:42,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1303437718] [2023-11-29 05:44:42,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1303437718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:44:42,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:44:42,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:44:42,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235000178] [2023-11-29 05:44:42,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:44:42,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:44:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:44:42,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:44:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:44:42,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 55 [2023-11-29 05:44:42,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 274 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-29 05:44:42,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:44:42,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 55 [2023-11-29 05:44:42,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:44:42,646 INFO L124 PetriNetUnfolderBase]: 1592/3190 cut-off events. [2023-11-29 05:44:42,646 INFO L125 PetriNetUnfolderBase]: For 2218/2304 co-relation queries the response was YES. [2023-11-29 05:44:42,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 3190 events. 1592/3190 cut-off events. For 2218/2304 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 21881 event pairs, 490 based on Foata normal form. 10/3058 useless extension candidates. Maximal degree in co-relation 8554. Up to 1315 conditions per place. [2023-11-29 05:44:42,682 INFO L140 encePairwiseOnDemand]: 49/55 looper letters, 62 selfloop transitions, 14 changer transitions 0/102 dead transitions. [2023-11-29 05:44:42,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 102 transitions, 638 flow [2023-11-29 05:44:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:44:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:44:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 216 transitions. [2023-11-29 05:44:42,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6545454545454545 [2023-11-29 05:44:42,685 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 216 transitions. [2023-11-29 05:44:42,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 216 transitions. [2023-11-29 05:44:42,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:44:42,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 216 transitions. [2023-11-29 05:44:42,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 36.0) internal successors, (216), 6 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:44:42,687 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-29 05:44:42,688 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-29 05:44:42,688 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 274 flow. Second operand 6 states and 216 transitions. [2023-11-29 05:44:42,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 102 transitions, 638 flow [2023-11-29 05:44:42,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 102 transitions, 627 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 05:44:42,705 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 457 flow [2023-11-29 05:44:42,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=457, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-11-29 05:44:42,706 INFO L281 CegarLoopForPetriNet]: 60 programPoint places, 20 predicate places. [2023-11-29 05:44:42,706 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 457 flow [2023-11-29 05:44:42,706 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-29 05:44:42,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:44:42,707 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-29 05:44:42,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:42,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:42,907 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-29 05:44:42,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:44:42,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1816072065, now seen corresponding path program 4 times [2023-11-29 05:44:42,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:44:42,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124749255] [2023-11-29 05:44:42,908 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:44:42,908 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-29 05:44:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:44:42,909 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:42,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:43,100 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:44:43,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:44:43,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:44:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:44:43,273 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:44:43,273 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:44:43,274 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-29 05:44:43,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-29 05:44:43,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-29 05:44:43,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-29 05:44:43,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-29 05:44:43,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-29 05:44:43,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-29 05:44:43,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-29 05:44:43,283 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 05:44:43,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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-29 05:44:43,479 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:44:43,485 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:44:43,485 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:44:43,547 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 05:44:43,550 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:44:43,552 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:44:43,567 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:44:43,569 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:44:43,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:44:43 BasicIcfg [2023-11-29 05:44:43,585 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:44:43,585 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:44:43,585 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:44:43,586 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:44:43,586 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:44:29" (3/4) ... [2023-11-29 05:44:43,588 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:44:43,590 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:44:43,591 INFO L158 Benchmark]: Toolchain (without parser) took 15551.41ms. Allocated memory was 79.7MB in the beginning and 270.5MB in the end (delta: 190.8MB). Free memory was 48.8MB in the beginning and 207.8MB in the end (delta: -159.0MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,591 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 56.6MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:44:43,591 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.61ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 42.1MB in the end (delta: 6.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.35ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,593 INFO L158 Benchmark]: Boogie Preprocessor took 69.42ms. Allocated memory is still 79.7MB. Free memory was 39.5MB in the beginning and 36.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,593 INFO L158 Benchmark]: RCFGBuilder took 967.49ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 61.9MB in the end (delta: -26.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,594 INFO L158 Benchmark]: TraceAbstraction took 13805.28ms. Allocated memory was 96.5MB in the beginning and 270.5MB in the end (delta: 174.1MB). Free memory was 61.4MB in the beginning and 208.8MB in the end (delta: -147.4MB). Peak memory consumption was 168.7MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,594 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 270.5MB. Free memory was 208.8MB in the beginning and 207.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:44:43,597 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.28ms. Allocated memory is still 56.6MB. Free memory is still 33.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.61ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 42.1MB in the end (delta: 6.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.35ms. Allocated memory is still 79.7MB. Free memory was 42.1MB in the beginning and 39.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.42ms. Allocated memory is still 79.7MB. Free memory was 39.5MB in the beginning and 36.2MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 967.49ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 35.9MB in the beginning and 61.9MB in the end (delta: -26.0MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13805.28ms. Allocated memory was 96.5MB in the beginning and 270.5MB in the end (delta: 174.1MB). Free memory was 61.4MB in the beginning and 208.8MB in the end (delta: -147.4MB). Peak memory consumption was 168.7MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 270.5MB. Free memory was 208.8MB in the beginning and 207.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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}, 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}, 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={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}, 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}, 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] [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=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=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=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] [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=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: 13.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 436 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 56 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1403 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 43 mSDtfsCounter, 1403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=457occurred in iteration=14, InterpolantAutomatonStates: 63, 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, 1.8s InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 233 ConstructedInterpolants, 1 QuantifiedInterpolants, 1812 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1653 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-29 05:44:43,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f01cd208-8aa3-4060-ac6f-48856002be3b/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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