./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme --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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:45:56,128 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:45:56,208 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 10:45:56,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:45:56,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:45:56,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:45:56,249 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:45:56,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:45:56,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:45:56,255 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:45:56,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:45:56,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:45:56,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:45:56,258 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:45:56,258 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:45:56,259 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:45:56,260 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:45:56,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:45:56,261 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:45:56,261 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:45:56,262 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:45:56,266 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:45:56,267 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:45:56,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:45:56,271 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:45:56,271 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:45:56,272 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:45:56,272 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:45:56,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:45:56,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:45:56,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:45:56,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:45:56,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:45:56,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:45:56,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:45:56,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 10:45:56,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 10:45:56,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:45:56,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:45:56,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:45:56,277 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:45:56,278 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_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/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_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme 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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2023-11-26 10:45:56,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:45:56,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:45:56,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:45:56,617 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:45:56,618 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:45:56,619 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/rfi010.i [2023-11-26 10:45:59,818 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:46:00,091 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:46:00,092 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/sv-benchmarks/c/pthread-wmm/rfi010.i [2023-11-26 10:46:00,110 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/72086a7f7/e63e9b4c10974c77925a7df1c808d200/FLAGc84710b65 [2023-11-26 10:46:00,125 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/72086a7f7/e63e9b4c10974c77925a7df1c808d200 [2023-11-26 10:46:00,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:46:00,130 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:46:00,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:00,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:46:00,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:46:00,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:00,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61e2bc1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00, skipping insertion in model container [2023-11-26 10:46:00,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:00,191 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:46:00,733 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:00,751 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:46:00,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:00,907 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:00,907 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:00,956 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:46:00,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00 WrapperNode [2023-11-26 10:46:00,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:00,958 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:00,959 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:46:00,959 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:46:00,967 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,091 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2023-11-26 10:46:01,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:01,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:46:01,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:46:01,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:46:01,106 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,107 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,122 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,159 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-26 10:46:01,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,173 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,185 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,200 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,204 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:46:01,205 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:46:01,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:46:01,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:46:01,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (1/1) ... [2023-11-26 10:46:01,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:01,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:01,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:46:01,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:46:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 10:46:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 10:46:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 10:46:01,294 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:46:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:46:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:46:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:46:01,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:46:01,296 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:46:01,296 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:46:01,297 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:46:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 10:46:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 10:46:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 10:46:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:46:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:46:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:46:01,301 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:46:01,476 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:46:01,479 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:46:01,843 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:46:02,128 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:46:02,129 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:46:02,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:02 BoogieIcfgContainer [2023-11-26 10:46:02,130 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:46:02,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:46:02,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:46:02,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:46:02,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:00" (1/3) ... [2023-11-26 10:46:02,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f193a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:02, skipping insertion in model container [2023-11-26 10:46:02,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:00" (2/3) ... [2023-11-26 10:46:02,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f193a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:02, skipping insertion in model container [2023-11-26 10:46:02,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:02" (3/3) ... [2023-11-26 10:46:02,145 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2023-11-26 10:46:02,166 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:46:02,166 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 10:46:02,167 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:46:02,223 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:46:02,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 10:46:02,360 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-26 10:46:02,360 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:02,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-26 10:46:02,366 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 10:46:02,374 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-26 10:46:02,387 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:02,394 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;@193a0bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:02,394 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 10:46:02,397 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:02,397 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:46:02,397 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:02,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:02,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:02,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:02,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:02,404 INFO L85 PathProgramCache]: Analyzing trace with hash 12468, now seen corresponding path program 1 times [2023-11-26 10:46:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:02,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692701355] [2023-11-26 10:46:02,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:02,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:02,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-26 10:46:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:02,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692701355] [2023-11-26 10:46:02,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692701355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:02,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:02,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:02,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689063259] [2023-11-26 10:46:02,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:02,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:02,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:02,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:02,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:02,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:02,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:02,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:02,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:03,078 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-26 10:46:03,078 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:46:03,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 490 events. 203/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3068 event pairs, 149 based on Foata normal form. 36/485 useless extension candidates. Maximal degree in co-relation 844. Up to 265 conditions per place. [2023-11-26 10:46:03,087 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-26 10:46:03,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-26 10:46:03,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:03,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:03,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:03,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:03,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:03,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,115 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:03,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-26 10:46:03,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:03,122 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-26 10:46:03,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-26 10:46:03,128 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-26 10:46:03,128 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-26 10:46:03,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:03,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:03,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 10:46:03,130 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:03,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 12469, now seen corresponding path program 1 times [2023-11-26 10:46:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:03,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079072111] [2023-11-26 10:46:03,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:03,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:03,293 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-26 10:46:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079072111] [2023-11-26 10:46:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079072111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:03,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:03,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:03,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714819877] [2023-11-26 10:46:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:03,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:03,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:03,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:03,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 10:46:03,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:03,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 10:46:03,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:03,574 INFO L124 PetriNetUnfolderBase]: 203/489 cut-off events. [2023-11-26 10:46:03,575 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 10:46:03,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 489 events. 203/489 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3067 event pairs, 149 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 862. Up to 264 conditions per place. [2023-11-26 10:46:03,584 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-26 10:46:03,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-26 10:46:03,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:03,590 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:03,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:03,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:03,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:03,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,599 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,599 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:03,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-26 10:46:03,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:03,607 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-26 10:46:03,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-26 10:46:03,611 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-26 10:46:03,612 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-26 10:46:03,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:03,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:03,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 10:46:03,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:03,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:03,622 INFO L85 PathProgramCache]: Analyzing trace with hash 371783462, now seen corresponding path program 1 times [2023-11-26 10:46:03,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:03,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729113226] [2023-11-26 10:46:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:03,732 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-26 10:46:03,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:03,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729113226] [2023-11-26 10:46:03,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729113226] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:03,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:03,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:03,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322135707] [2023-11-26 10:46:03,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:03,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:03,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:03,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:03,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:03,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:03,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:03,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:03,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:03,898 INFO L124 PetriNetUnfolderBase]: 205/482 cut-off events. [2023-11-26 10:46:03,899 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 10:46:03,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 871 conditions, 482 events. 205/482 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2996 event pairs, 155 based on Foata normal form. 0/446 useless extension candidates. Maximal degree in co-relation 860. Up to 265 conditions per place. [2023-11-26 10:46:03,903 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-26 10:46:03,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-26 10:46:03,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:03,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:03,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-26 10:46:03,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-26 10:46:03,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-26 10:46:03,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-26 10:46:03,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:03,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-26 10:46:03,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,909 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,909 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-26 10:46:03,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-26 10:46:03,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:03,912 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-26 10:46:03,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-26 10:46:03,913 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 10:46:03,913 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-26 10:46:03,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:03,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:03,914 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:03,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 10:46:03,915 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:03,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 371783463, now seen corresponding path program 1 times [2023-11-26 10:46:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:03,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211428297] [2023-11-26 10:46:03,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:03,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:03,993 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-26 10:46:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:03,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211428297] [2023-11-26 10:46:03,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211428297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:03,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:03,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:03,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383140970] [2023-11-26 10:46:03,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:03,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:03,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:03,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:04,005 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 10:46:04,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:04,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 10:46:04,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:04,145 INFO L124 PetriNetUnfolderBase]: 203/477 cut-off events. [2023-11-26 10:46:04,145 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:46:04,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 477 events. 203/477 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2979 event pairs, 153 based on Foata normal form. 3/446 useless extension candidates. Maximal degree in co-relation 853. Up to 260 conditions per place. [2023-11-26 10:46:04,150 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-26 10:46:04,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-26 10:46:04,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:04,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:04,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:04,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:04,152 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:04,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:04,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:04,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:04,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:04,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,155 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:04,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-26 10:46:04,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:04,158 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-26 10:46:04,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-26 10:46:04,159 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 10:46:04,160 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-26 10:46:04,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:04,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:04,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 10:46:04,161 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:04,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:04,162 INFO L85 PathProgramCache]: Analyzing trace with hash -919191687, now seen corresponding path program 1 times [2023-11-26 10:46:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:04,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672113393] [2023-11-26 10:46:04,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:04,285 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-26 10:46:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:04,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672113393] [2023-11-26 10:46:04,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672113393] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:04,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539807600] [2023-11-26 10:46:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:04,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:04,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 10:46:04,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:04,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 10:46:04,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:04,414 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-11-26 10:46:04,414 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-26 10:46:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 371 events. 166/371 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2043 event pairs, 18 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 683. Up to 245 conditions per place. [2023-11-26 10:46:04,417 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-26 10:46:04,418 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 146 flow [2023-11-26 10:46:04,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-26 10:46:04,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2023-11-26 10:46:04,420 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-26 10:46:04,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-26 10:46:04,420 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:04,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-26 10:46:04,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:04,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,422 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,423 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 93 transitions. [2023-11-26 10:46:04,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 146 flow [2023-11-26 10:46:04,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:04,425 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-26 10:46:04,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-26 10:46:04,426 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-26 10:46:04,426 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-26 10:46:04,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:04,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:04,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 10:46:04,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:04,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:04,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1015152632, now seen corresponding path program 1 times [2023-11-26 10:46:04,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:04,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368863553] [2023-11-26 10:46:04,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:04,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:04,712 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-26 10:46:04,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:04,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368863553] [2023-11-26 10:46:04,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368863553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:04,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:04,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736694027] [2023-11-26 10:46:04,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:04,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:04,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:04,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:04,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:04,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:04,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:04,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:04,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:04,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:05,012 INFO L124 PetriNetUnfolderBase]: 144/352 cut-off events. [2023-11-26 10:46:05,013 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-26 10:46:05,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 352 events. 144/352 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1979 event pairs, 120 based on Foata normal form. 15/357 useless extension candidates. Maximal degree in co-relation 630. Up to 215 conditions per place. [2023-11-26 10:46:05,016 INFO L140 encePairwiseOnDemand]: 39/43 looper letters, 16 selfloop transitions, 2 changer transitions 7/39 dead transitions. [2023-11-26 10:46:05,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 39 transitions, 138 flow [2023-11-26 10:46:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:05,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2023-11-26 10:46:05,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2023-11-26 10:46:05,019 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 126 transitions. [2023-11-26 10:46:05,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 126 transitions. [2023-11-26 10:46:05,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:05,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 126 transitions. [2023-11-26 10:46:05,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:05,024 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:05,024 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 5 states and 126 transitions. [2023-11-26 10:46:05,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 39 transitions, 138 flow [2023-11-26 10:46:05,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 39 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:05,027 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-26 10:46:05,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-26 10:46:05,031 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-26 10:46:05,031 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-26 10:46:05,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:05,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:05,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 10:46:05,032 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:05,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1015152547, now seen corresponding path program 1 times [2023-11-26 10:46:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889411769] [2023-11-26 10:46:05,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:05,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:05,337 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-26 10:46:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:05,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889411769] [2023-11-26 10:46:05,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889411769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:05,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:05,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:05,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012362308] [2023-11-26 10:46:05,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:05,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:05,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:05,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:05,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:05,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:05,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:05,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:05,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:05,654 INFO L124 PetriNetUnfolderBase]: 252/542 cut-off events. [2023-11-26 10:46:05,654 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-26 10:46:05,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1006 conditions, 542 events. 252/542 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3170 event pairs, 82 based on Foata normal form. 0/515 useless extension candidates. Maximal degree in co-relation 995. Up to 278 conditions per place. [2023-11-26 10:46:05,658 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 22 selfloop transitions, 3 changer transitions 33/70 dead transitions. [2023-11-26 10:46:05,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 70 transitions, 268 flow [2023-11-26 10:46:05,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 10:46:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 10:46:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 212 transitions. [2023-11-26 10:46:05,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6162790697674418 [2023-11-26 10:46:05,661 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 212 transitions. [2023-11-26 10:46:05,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 212 transitions. [2023-11-26 10:46:05,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:05,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 212 transitions. [2023-11-26 10:46:05,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 26.5) internal successors, (212), 8 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,665 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 43.0) internal successors, (387), 9 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,665 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 8 states and 212 transitions. [2023-11-26 10:46:05,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 70 transitions, 268 flow [2023-11-26 10:46:05,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 70 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:05,667 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 98 flow [2023-11-26 10:46:05,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=98, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-11-26 10:46:05,668 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2023-11-26 10:46:05,668 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 98 flow [2023-11-26 10:46:05,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:05,669 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-26 10:46:05,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 10:46:05,669 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:05,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -98832090, now seen corresponding path program 1 times [2023-11-26 10:46:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120170509] [2023-11-26 10:46:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:05,857 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-26 10:46:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120170509] [2023-11-26 10:46:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120170509] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:05,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499975952] [2023-11-26 10:46:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:46:05,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:05,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:46:05,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:46:05,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:05,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:05,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:05,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:05,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:06,040 INFO L124 PetriNetUnfolderBase]: 195/419 cut-off events. [2023-11-26 10:46:06,040 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2023-11-26 10:46:06,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1035 conditions, 419 events. 195/419 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2039 event pairs, 25 based on Foata normal form. 24/439 useless extension candidates. Maximal degree in co-relation 1019. Up to 195 conditions per place. [2023-11-26 10:46:06,045 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 33 selfloop transitions, 4 changer transitions 1/49 dead transitions. [2023-11-26 10:46:06,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 237 flow [2023-11-26 10:46:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:46:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:46:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2023-11-26 10:46:06,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2023-11-26 10:46:06,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 114 transitions. [2023-11-26 10:46:06,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 114 transitions. [2023-11-26 10:46:06,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:06,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 114 transitions. [2023-11-26 10:46:06,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,053 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 98 flow. Second operand 4 states and 114 transitions. [2023-11-26 10:46:06,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 237 flow [2023-11-26 10:46:06,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 230 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-26 10:46:06,058 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 117 flow [2023-11-26 10:46:06,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-11-26 10:46:06,062 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-26 10:46:06,063 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 117 flow [2023-11-26 10:46:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:06,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:06,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 10:46:06,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:06,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:06,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1467223558, now seen corresponding path program 1 times [2023-11-26 10:46:06,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:06,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103035202] [2023-11-26 10:46:06,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:06,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:06,362 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-26 10:46:06,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:06,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103035202] [2023-11-26 10:46:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103035202] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 10:46:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965211393] [2023-11-26 10:46:06,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:06,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:06,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 117 flow. Second operand has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:06,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:06,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:06,603 INFO L124 PetriNetUnfolderBase]: 153/348 cut-off events. [2023-11-26 10:46:06,603 INFO L125 PetriNetUnfolderBase]: For 206/208 co-relation queries the response was YES. [2023-11-26 10:46:06,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 348 events. 153/348 cut-off events. For 206/208 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1659 event pairs, 49 based on Foata normal form. 12/354 useless extension candidates. Maximal degree in co-relation 862. Up to 192 conditions per place. [2023-11-26 10:46:06,606 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 20 selfloop transitions, 3 changer transitions 17/54 dead transitions. [2023-11-26 10:46:06,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 261 flow [2023-11-26 10:46:06,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:46:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 10:46:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2023-11-26 10:46:06,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5780730897009967 [2023-11-26 10:46:06,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 174 transitions. [2023-11-26 10:46:06,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 174 transitions. [2023-11-26 10:46:06,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:06,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 174 transitions. [2023-11-26 10:46:06,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.857142857142858) internal successors, (174), 7 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,611 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,611 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 117 flow. Second operand 7 states and 174 transitions. [2023-11-26 10:46:06,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 261 flow [2023-11-26 10:46:06,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 246 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:06,616 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 127 flow [2023-11-26 10:46:06,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2023-11-26 10:46:06,617 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-11-26 10:46:06,617 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 127 flow [2023-11-26 10:46:06,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:06,618 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:06,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 10:46:06,618 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:06,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash -818523869, now seen corresponding path program 1 times [2023-11-26 10:46:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441378258] [2023-11-26 10:46:06,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:06,955 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-26 10:46:06,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:06,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441378258] [2023-11-26 10:46:06,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441378258] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:06,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:06,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:06,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47718399] [2023-11-26 10:46:06,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:06,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:06,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:06,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:06,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:06,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:06,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:06,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:06,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:06,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:07,105 INFO L124 PetriNetUnfolderBase]: 97/215 cut-off events. [2023-11-26 10:46:07,105 INFO L125 PetriNetUnfolderBase]: For 179/179 co-relation queries the response was YES. [2023-11-26 10:46:07,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 215 events. 97/215 cut-off events. For 179/179 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 759 event pairs, 17 based on Foata normal form. 16/227 useless extension candidates. Maximal degree in co-relation 562. Up to 86 conditions per place. [2023-11-26 10:46:07,108 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 28 selfloop transitions, 6 changer transitions 1/46 dead transitions. [2023-11-26 10:46:07,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 46 transitions, 240 flow [2023-11-26 10:46:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2023-11-26 10:46:07,109 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2023-11-26 10:46:07,109 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 130 transitions. [2023-11-26 10:46:07,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 130 transitions. [2023-11-26 10:46:07,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:07,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 130 transitions. [2023-11-26 10:46:07,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:07,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:07,112 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 127 flow. Second operand 5 states and 130 transitions. [2023-11-26 10:46:07,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 46 transitions, 240 flow [2023-11-26 10:46:07,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 200 flow, removed 14 selfloop flow, removed 9 redundant places. [2023-11-26 10:46:07,117 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 119 flow [2023-11-26 10:46:07,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-26 10:46:07,119 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-26 10:46:07,119 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 119 flow [2023-11-26 10:46:07,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:07,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:07,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 10:46:07,120 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:07,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash -232405404, now seen corresponding path program 1 times [2023-11-26 10:46:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:07,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318852137] [2023-11-26 10:46:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:07,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:07,534 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-26 10:46:07,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:07,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318852137] [2023-11-26 10:46:07,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318852137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:07,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:07,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:46:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254957978] [2023-11-26 10:46:07,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:07,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:07,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:07,543 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2023-11-26 10:46:07,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 119 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:07,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2023-11-26 10:46:07,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:07,761 INFO L124 PetriNetUnfolderBase]: 116/290 cut-off events. [2023-11-26 10:46:07,762 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2023-11-26 10:46:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 677 conditions, 290 events. 116/290 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1149 event pairs, 29 based on Foata normal form. 4/285 useless extension candidates. Maximal degree in co-relation 660. Up to 127 conditions per place. [2023-11-26 10:46:07,764 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 25 selfloop transitions, 7 changer transitions 14/59 dead transitions. [2023-11-26 10:46:07,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 279 flow [2023-11-26 10:46:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 10:46:07,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 10:46:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2023-11-26 10:46:07,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2023-11-26 10:46:07,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 172 transitions. [2023-11-26 10:46:07,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 172 transitions. [2023-11-26 10:46:07,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:07,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 172 transitions. [2023-11-26 10:46:07,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,772 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 43.0) internal successors, (344), 8 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,772 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 119 flow. Second operand 7 states and 172 transitions. [2023-11-26 10:46:07,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 279 flow [2023-11-26 10:46:07,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 245 flow, removed 8 selfloop flow, removed 6 redundant places. [2023-11-26 10:46:07,776 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 127 flow [2023-11-26 10:46:07,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2023-11-26 10:46:07,777 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2023-11-26 10:46:07,777 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 127 flow [2023-11-26 10:46:07,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:07,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:07,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:07,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 10:46:07,778 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:07,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 2086192680, now seen corresponding path program 2 times [2023-11-26 10:46:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72460842] [2023-11-26 10:46:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:07,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:08,104 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-26 10:46:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:08,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72460842] [2023-11-26 10:46:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72460842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:46:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999723150] [2023-11-26 10:46:08,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:08,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:08,114 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 43 [2023-11-26 10:46:08,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 127 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:08,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 43 [2023-11-26 10:46:08,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:08,324 INFO L124 PetriNetUnfolderBase]: 123/310 cut-off events. [2023-11-26 10:46:08,324 INFO L125 PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES. [2023-11-26 10:46:08,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 310 events. 123/310 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1283 event pairs, 43 based on Foata normal form. 4/299 useless extension candidates. Maximal degree in co-relation 675. Up to 105 conditions per place. [2023-11-26 10:46:08,327 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 20 selfloop transitions, 1 changer transitions 19/53 dead transitions. [2023-11-26 10:46:08,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 250 flow [2023-11-26 10:46:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:46:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:46:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2023-11-26 10:46:08,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5736434108527132 [2023-11-26 10:46:08,329 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 148 transitions. [2023-11-26 10:46:08,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 148 transitions. [2023-11-26 10:46:08,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:08,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 148 transitions. [2023-11-26 10:46:08,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 24.666666666666668) internal successors, (148), 6 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,332 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,332 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 127 flow. Second operand 6 states and 148 transitions. [2023-11-26 10:46:08,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 250 flow [2023-11-26 10:46:08,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 241 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-26 10:46:08,336 INFO L231 Difference]: Finished difference. Result has 53 places, 31 transitions, 102 flow [2023-11-26 10:46:08,336 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=53, PETRI_TRANSITIONS=31} [2023-11-26 10:46:08,337 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2023-11-26 10:46:08,338 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 31 transitions, 102 flow [2023-11-26 10:46:08,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:08,338 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:08,338 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:08,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 10:46:08,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:08,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:08,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1740331664, now seen corresponding path program 3 times [2023-11-26 10:46:08,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:08,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52267885] [2023-11-26 10:46:08,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:08,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:09,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 10:46:09,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 10:46:09,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52267885] [2023-11-26 10:46:09,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52267885] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:09,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:09,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:46:09,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017722218] [2023-11-26 10:46:09,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:09,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:46:09,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 10:46:09,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:46:09,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:46:09,702 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:09,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 31 transitions, 102 flow. Second operand has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:09,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:09,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:09,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:10,017 INFO L124 PetriNetUnfolderBase]: 68/194 cut-off events. [2023-11-26 10:46:10,018 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-26 10:46:10,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 430 conditions, 194 events. 68/194 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 656 event pairs, 26 based on Foata normal form. 4/189 useless extension candidates. Maximal degree in co-relation 411. Up to 72 conditions per place. [2023-11-26 10:46:10,020 INFO L140 encePairwiseOnDemand]: 34/43 looper letters, 15 selfloop transitions, 4 changer transitions 17/51 dead transitions. [2023-11-26 10:46:10,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 51 transitions, 224 flow [2023-11-26 10:46:10,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:46:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:46:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 237 transitions. [2023-11-26 10:46:10,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5511627906976744 [2023-11-26 10:46:10,022 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 237 transitions. [2023-11-26 10:46:10,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 237 transitions. [2023-11-26 10:46:10,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:10,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 237 transitions. [2023-11-26 10:46:10,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:10,025 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:10,026 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:10,026 INFO L175 Difference]: Start difference. First operand has 53 places, 31 transitions, 102 flow. Second operand 10 states and 237 transitions. [2023-11-26 10:46:10,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 51 transitions, 224 flow [2023-11-26 10:46:10,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 51 transitions, 197 flow, removed 11 selfloop flow, removed 7 redundant places. [2023-11-26 10:46:10,029 INFO L231 Difference]: Finished difference. Result has 56 places, 31 transitions, 105 flow [2023-11-26 10:46:10,029 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=105, PETRI_PLACES=56, PETRI_TRANSITIONS=31} [2023-11-26 10:46:10,030 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2023-11-26 10:46:10,030 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 31 transitions, 105 flow [2023-11-26 10:46:10,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 21.555555555555557) internal successors, (194), 9 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:10,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:10,031 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 10:46:10,031 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:10,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1194306984, now seen corresponding path program 4 times [2023-11-26 10:46:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 10:46:10,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641976171] [2023-11-26 10:46:10,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:10,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 10:46:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:10,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:10,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:10,200 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 10:46:10,201 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:10,202 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 10:46:10,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 10:46:10,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 10:46:10,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 10:46:10,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 10:46:10,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 10:46:10,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 10:46:10,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 10:46:10,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 10:46:10,206 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 10:46:10,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 10:46:10,207 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:10,227 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:46:10,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:46:10,277 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:10,279 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 10:46:10,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:46:10,288 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:46:10,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:10 BasicIcfg [2023-11-26 10:46:10,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:46:10,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:46:10,304 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:46:10,304 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:46:10,305 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:02" (3/4) ... [2023-11-26 10:46:10,306 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:46:10,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:46:10,308 INFO L158 Benchmark]: Toolchain (without parser) took 10178.74ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 110.1MB in the beginning and 191.7MB in the end (delta: -81.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:10,309 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:10,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 825.51ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 125.2MB in the end (delta: -15.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2023-11-26 10:46:10,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.42ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 122.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:10,310 INFO L158 Benchmark]: Boogie Preprocessor took 110.95ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 118.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:10,311 INFO L158 Benchmark]: RCFGBuilder took 924.87ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 70.7MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:10,311 INFO L158 Benchmark]: TraceAbstraction took 8166.61ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 69.9MB in the beginning and 191.7MB in the end (delta: -121.8MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. [2023-11-26 10:46:10,311 INFO L158 Benchmark]: Witness Printer took 4.36ms. Allocated memory is still 234.9MB. Free memory is still 191.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:10,313 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.20ms. Allocated memory is still 119.5MB. Free memory was 85.3MB in the beginning and 85.3MB in the end (delta: 30.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 825.51ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 125.2MB in the end (delta: -15.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.42ms. Allocated memory is still 157.3MB. Free memory was 125.2MB in the beginning and 122.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 110.95ms. Allocated memory is still 157.3MB. Free memory was 122.3MB in the beginning and 118.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 924.87ms. Allocated memory is still 157.3MB. Free memory was 118.9MB in the beginning and 70.7MB in the end (delta: 48.2MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8166.61ms. Allocated memory was 157.3MB in the beginning and 234.9MB in the end (delta: 77.6MB). Free memory was 69.9MB in the beginning and 191.7MB in the end (delta: -121.8MB). Peak memory consumption was 87.9MB. Max. memory is 16.1GB. * Witness Printer took 4.36ms. Allocated memory is still 234.9MB. Free memory is still 191.7MB. 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~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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi010.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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 5 procedures, 61 locations, 10 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: 7.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 328 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 13 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127occurred in iteration=9, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 1186 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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-26 10:46:10,340 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme --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 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 10:46:13,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 10:46:13,241 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 10:46:13,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 10:46:13,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 10:46:13,309 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 10:46:13,310 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 10:46:13,311 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 10:46:13,312 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 10:46:13,317 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 10:46:13,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 10:46:13,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 10:46:13,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 10:46:13,322 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 10:46:13,322 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 10:46:13,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 10:46:13,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 10:46:13,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 10:46:13,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 10:46:13,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 10:46:13,326 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 10:46:13,327 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 10:46:13,327 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 10:46:13,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 10:46:13,328 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 10:46:13,329 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 10:46:13,329 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 10:46:13,330 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 10:46:13,330 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 10:46:13,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 10:46:13,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 10:46:13,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 10:46:13,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 10:46:13,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 10:46:13,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:13,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 10:46:13,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 10:46:13,336 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 10:46:13,337 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 10:46:13,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 10:46:13,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 10:46:13,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 10:46:13,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 10:46:13,338 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 10:46:13,339 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_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/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_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme 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 -> 582aea72bf150e6792f444cf029a22a25cb033a365b198fc215f246088fb4d39 [2023-11-26 10:46:13,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 10:46:13,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 10:46:13,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 10:46:13,790 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 10:46:13,791 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 10:46:13,792 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/rfi010.i [2023-11-26 10:46:16,909 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 10:46:17,292 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 10:46:17,292 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/sv-benchmarks/c/pthread-wmm/rfi010.i [2023-11-26 10:46:17,323 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/135202350/c71d6ce48536484fb484d4fb778da4ed/FLAG0c7b88818 [2023-11-26 10:46:17,346 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/data/135202350/c71d6ce48536484fb484d4fb778da4ed [2023-11-26 10:46:17,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 10:46:17,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 10:46:17,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:17,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 10:46:17,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 10:46:17,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:17" (1/1) ... [2023-11-26 10:46:17,369 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771989ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:17, skipping insertion in model container [2023-11-26 10:46:17,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 10:46:17" (1/1) ... [2023-11-26 10:46:17,438 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 10:46:18,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:18,091 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 10:46:18,174 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 10:46:18,215 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:18,215 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 10:46:18,224 INFO L206 MainTranslator]: Completed translation [2023-11-26 10:46:18,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18 WrapperNode [2023-11-26 10:46:18,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 10:46:18,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:18,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 10:46:18,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 10:46:18,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,294 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2023-11-26 10:46:18,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 10:46:18,296 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 10:46:18,296 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 10:46:18,296 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 10:46:18,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,314 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,333 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2023-11-26 10:46:18,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,354 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 10:46:18,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 10:46:18,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 10:46:18,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 10:46:18,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (1/1) ... [2023-11-26 10:46:18,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 10:46:18,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 10:46:18,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 10:46:18,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 10:46:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 10:46:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 10:46:18,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 10:46:18,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 10:46:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 10:46:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 10:46:18,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 10:46:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 10:46:18,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 10:46:18,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 10:46:18,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 10:46:18,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 10:46:18,469 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 10:46:18,693 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 10:46:18,695 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 10:46:19,101 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 10:46:19,458 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 10:46:19,459 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 10:46:19,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:19 BoogieIcfgContainer [2023-11-26 10:46:19,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 10:46:19,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 10:46:19,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 10:46:19,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 10:46:19,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 10:46:17" (1/3) ... [2023-11-26 10:46:19,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9e4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:19, skipping insertion in model container [2023-11-26 10:46:19,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 10:46:18" (2/3) ... [2023-11-26 10:46:19,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f9e4d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 10:46:19, skipping insertion in model container [2023-11-26 10:46:19,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:19" (3/3) ... [2023-11-26 10:46:19,473 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi010.i [2023-11-26 10:46:19,495 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 10:46:19,495 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-26 10:46:19,495 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 10:46:19,560 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 10:46:19,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 10:46:19,651 INFO L124 PetriNetUnfolderBase]: 2/41 cut-off events. [2023-11-26 10:46:19,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:19,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 41 events. 2/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2023-11-26 10:46:19,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 43 transitions, 94 flow [2023-11-26 10:46:19,685 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 41 transitions, 88 flow [2023-11-26 10:46:19,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 10:46:19,712 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;@56f679cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 10:46:19,712 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-26 10:46:19,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 10:46:19,716 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 10:46:19,717 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 10:46:19,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:19,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:19,719 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:19,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash 12532, now seen corresponding path program 1 times [2023-11-26 10:46:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:19,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24576094] [2023-11-26 10:46:19,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:19,746 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-26 10:46:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:19,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:19,772 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:19,891 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:46:19,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:19,975 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-26 10:46:19,989 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-26 10:46:19,989 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:19,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:19,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24576094] [2023-11-26 10:46:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24576094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:19,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596978274] [2023-11-26 10:46:19,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:20,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:20,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:20,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:20,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:20,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:20,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:20,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:20,380 INFO L124 PetriNetUnfolderBase]: 203/490 cut-off events. [2023-11-26 10:46:20,380 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-26 10:46:20,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 490 events. 203/490 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3068 event pairs, 149 based on Foata normal form. 36/485 useless extension candidates. Maximal degree in co-relation 844. Up to 265 conditions per place. [2023-11-26 10:46:20,389 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-26 10:46:20,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 44 transitions, 146 flow [2023-11-26 10:46:20,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:20,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:20,402 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:20,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:20,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:20,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,414 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,416 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 88 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:20,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 44 transitions, 146 flow [2023-11-26 10:46:20,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:20,423 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 82 flow [2023-11-26 10:46:20,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-26 10:46:20,428 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -2 predicate places. [2023-11-26 10:46:20,429 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 82 flow [2023-11-26 10:46:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:20,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 10:46:20,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:20,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:20,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:20,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 12533, now seen corresponding path program 1 times [2023-11-26 10:46:20,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309270012] [2023-11-26 10:46:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:20,636 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-26 10:46:20,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:20,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:20,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:20,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:46:20,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:20,742 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-26 10:46:20,758 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-26 10:46:20,758 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:20,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309270012] [2023-11-26 10:46:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1309270012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:20,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701489751] [2023-11-26 10:46:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:20,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:20,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:20,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:20,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:20,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 10:46:20,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:20,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 10:46:20,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:20,979 INFO L124 PetriNetUnfolderBase]: 203/489 cut-off events. [2023-11-26 10:46:20,979 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 10:46:20,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 489 events. 203/489 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3067 event pairs, 149 based on Foata normal form. 1/449 useless extension candidates. Maximal degree in co-relation 862. Up to 264 conditions per place. [2023-11-26 10:46:20,987 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-26 10:46:20,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 43 transitions, 144 flow [2023-11-26 10:46:20,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:20,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:20,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:20,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:20,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:20,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:20,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,994 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 82 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:20,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 43 transitions, 144 flow [2023-11-26 10:46:20,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:20,997 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 80 flow [2023-11-26 10:46:20,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-11-26 10:46:20,999 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-11-26 10:46:20,999 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 80 flow [2023-11-26 10:46:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:20,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:21,009 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:21,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,202 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:21,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,203 INFO L85 PathProgramCache]: Analyzing trace with hash 373692072, now seen corresponding path program 1 times [2023-11-26 10:46:21,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:21,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089980802] [2023-11-26 10:46:21,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,204 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-26 10:46:21,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:21,205 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:46:21,364 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:21,379 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-26 10:46:21,388 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-26 10:46:21,388 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:21,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:21,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089980802] [2023-11-26 10:46:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089980802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:21,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757711966] [2023-11-26 10:46:21,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 43 [2023-11-26 10:46:21,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 43 [2023-11-26 10:46:21,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:21,610 INFO L124 PetriNetUnfolderBase]: 205/488 cut-off events. [2023-11-26 10:46:21,611 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 10:46:21,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 488 events. 205/488 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3070 event pairs, 99 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 866. Up to 265 conditions per place. [2023-11-26 10:46:21,617 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 24 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-26 10:46:21,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 144 flow [2023-11-26 10:46:21,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:21,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2023-11-26 10:46:21,625 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6744186046511628 [2023-11-26 10:46:21,625 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 87 transitions. [2023-11-26 10:46:21,625 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 87 transitions. [2023-11-26 10:46:21,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:21,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 87 transitions. [2023-11-26 10:46:21,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,630 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,631 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 80 flow. Second operand 3 states and 87 transitions. [2023-11-26 10:46:21,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 144 flow [2023-11-26 10:46:21,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:21,634 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 78 flow [2023-11-26 10:46:21,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2023-11-26 10:46:21,636 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 10:46:21,636 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 78 flow [2023-11-26 10:46:21,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:21,637 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 10:46:21,649 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:21,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,841 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:21,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:21,842 INFO L85 PathProgramCache]: Analyzing trace with hash 373692073, now seen corresponding path program 1 times [2023-11-26 10:46:21,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:21,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722936296] [2023-11-26 10:46:21,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:21,844 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-26 10:46:21,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:21,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:21,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:46:21,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:21,951 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-26 10:46:21,965 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-26 10:46:21,965 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:21,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:21,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722936296] [2023-11-26 10:46:21,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722936296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:21,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:21,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 10:46:21,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186250894] [2023-11-26 10:46:21,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:21,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:21,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:21,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:21,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:21,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 10:46:21,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:21,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:21,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 10:46:21,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:22,164 INFO L124 PetriNetUnfolderBase]: 203/477 cut-off events. [2023-11-26 10:46:22,165 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-26 10:46:22,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 863 conditions, 477 events. 203/477 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2987 event pairs, 153 based on Foata normal form. 3/445 useless extension candidates. Maximal degree in co-relation 853. Up to 260 conditions per place. [2023-11-26 10:46:22,170 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 23 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2023-11-26 10:46:22,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 41 transitions, 140 flow [2023-11-26 10:46:22,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:22,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2023-11-26 10:46:22,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2023-11-26 10:46:22,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 89 transitions. [2023-11-26 10:46:22,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 89 transitions. [2023-11-26 10:46:22,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:22,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 89 transitions. [2023-11-26 10:46:22,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:22,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,175 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,175 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 78 flow. Second operand 3 states and 89 transitions. [2023-11-26 10:46:22,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 41 transitions, 140 flow [2023-11-26 10:46:22,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:22,182 INFO L231 Difference]: Finished difference. Result has 41 places, 34 transitions, 76 flow [2023-11-26 10:46:22,183 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=34} [2023-11-26 10:46:22,184 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2023-11-26 10:46:22,185 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 34 transitions, 76 flow [2023-11-26 10:46:22,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:22,186 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:22,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:22,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:22,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 105635961, now seen corresponding path program 1 times [2023-11-26 10:46:22,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:22,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627587216] [2023-11-26 10:46:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:22,391 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-26 10:46:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:22,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:22,490 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 10:46:22,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:22,510 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-26 10:46:22,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:22,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627587216] [2023-11-26 10:46:22,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627587216] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:22,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:22,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 10:46:22,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340658922] [2023-11-26 10:46:22,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:22,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 10:46:22,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:22,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 10:46:22,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 10:46:22,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 43 [2023-11-26 10:46:22,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:22,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 43 [2023-11-26 10:46:22,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:22,660 INFO L124 PetriNetUnfolderBase]: 166/371 cut-off events. [2023-11-26 10:46:22,660 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-26 10:46:22,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 371 events. 166/371 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2059 event pairs, 18 based on Foata normal form. 0/365 useless extension candidates. Maximal degree in co-relation 683. Up to 245 conditions per place. [2023-11-26 10:46:22,664 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 22 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-26 10:46:22,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 42 transitions, 146 flow [2023-11-26 10:46:22,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 10:46:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 10:46:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2023-11-26 10:46:22,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2023-11-26 10:46:22,666 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 93 transitions. [2023-11-26 10:46:22,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 93 transitions. [2023-11-26 10:46:22,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:22,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 93 transitions. [2023-11-26 10:46:22,667 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 10:46:22,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 43.0) internal successors, (172), 4 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,669 INFO L175 Difference]: Start difference. First operand has 41 places, 34 transitions, 76 flow. Second operand 3 states and 93 transitions. [2023-11-26 10:46:22,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 42 transitions, 146 flow [2023-11-26 10:46:22,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 140 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:22,671 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 72 flow [2023-11-26 10:46:22,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2023-11-26 10:46:22,672 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -6 predicate places. [2023-11-26 10:46:22,672 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 72 flow [2023-11-26 10:46:22,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:22,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:22,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:22,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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)] Ended with exit code 0 [2023-11-26 10:46:22,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,876 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:22,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:22,877 INFO L85 PathProgramCache]: Analyzing trace with hash 408454714, now seen corresponding path program 1 times [2023-11-26 10:46:22,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602428057] [2023-11-26 10:46:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:22,878 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-26 10:46:22,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:22,880 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:22,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:22,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 10:46:22,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:23,027 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-26 10:46:23,027 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:23,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602428057] [2023-11-26 10:46:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602428057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:23,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116817627] [2023-11-26 10:46:23,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:23,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 10:46:23,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:23,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 10:46:23,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 10:46:23,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:23,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:23,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:23,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:23,236 INFO L124 PetriNetUnfolderBase]: 213/485 cut-off events. [2023-11-26 10:46:23,237 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-11-26 10:46:23,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 485 events. 213/485 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2509 event pairs, 31 based on Foata normal form. 24/505 useless extension candidates. Maximal degree in co-relation 902. Up to 229 conditions per place. [2023-11-26 10:46:23,241 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 32 selfloop transitions, 4 changer transitions 1/50 dead transitions. [2023-11-26 10:46:23,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 50 transitions, 188 flow [2023-11-26 10:46:23,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 10:46:23,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 10:46:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2023-11-26 10:46:23,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2023-11-26 10:46:23,245 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 115 transitions. [2023-11-26 10:46:23,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 115 transitions. [2023-11-26 10:46:23,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:23,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 115 transitions. [2023-11-26 10:46:23,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,249 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 43.0) internal successors, (215), 5 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,249 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 72 flow. Second operand 4 states and 115 transitions. [2023-11-26 10:46:23,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 50 transitions, 188 flow [2023-11-26 10:46:23,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:23,253 INFO L231 Difference]: Finished difference. Result has 42 places, 34 transitions, 94 flow [2023-11-26 10:46:23,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2023-11-26 10:46:23,258 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2023-11-26 10:46:23,258 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 94 flow [2023-11-26 10:46:23,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:23,268 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:23,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:23,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:23,463 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:23,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1163708945, now seen corresponding path program 1 times [2023-11-26 10:46:23,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:23,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877198119] [2023-11-26 10:46:23,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:23,464 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-26 10:46:23,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:23,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:23,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:23,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 10:46:23,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:23,649 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-26 10:46:23,649 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:23,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:23,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877198119] [2023-11-26 10:46:23,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877198119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:23,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:23,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 10:46:23,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321657890] [2023-11-26 10:46:23,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:23,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:23,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:23,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 10:46:23,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:23,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:23,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:23,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:23,820 INFO L124 PetriNetUnfolderBase]: 101/231 cut-off events. [2023-11-26 10:46:23,821 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 10:46:23,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 231 events. 101/231 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 822 event pairs, 21 based on Foata normal form. 16/243 useless extension candidates. Maximal degree in co-relation 512. Up to 86 conditions per place. [2023-11-26 10:46:23,823 INFO L140 encePairwiseOnDemand]: 38/43 looper letters, 27 selfloop transitions, 6 changer transitions 1/47 dead transitions. [2023-11-26 10:46:23,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 47 transitions, 193 flow [2023-11-26 10:46:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:23,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2023-11-26 10:46:23,828 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6093023255813953 [2023-11-26 10:46:23,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 131 transitions. [2023-11-26 10:46:23,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 131 transitions. [2023-11-26 10:46:23,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:23,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 131 transitions. [2023-11-26 10:46:23,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:23,833 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:23,834 INFO L175 Difference]: Start difference. First operand has 42 places, 34 transitions, 94 flow. Second operand 5 states and 131 transitions. [2023-11-26 10:46:23,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 47 transitions, 193 flow [2023-11-26 10:46:23,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 184 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 10:46:23,837 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 110 flow [2023-11-26 10:46:23,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-26 10:46:23,838 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-11-26 10:46:23,838 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 110 flow [2023-11-26 10:46:23,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:23,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:23,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:23,844 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:24,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:24,043 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:24,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:24,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1468599163, now seen corresponding path program 1 times [2023-11-26 10:46:24,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:24,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915628889] [2023-11-26 10:46:24,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:24,045 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-26 10:46:24,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:24,046 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:24,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:24,207 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-26 10:46:24,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:24,621 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1761~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1762~0#1.base_43| (_ BitVec 32))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1761~0#1.base_47| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1762~0#1.base_43| (_ bv0 1))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1761~0#1.base_47| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1762~0#1.base_43|) (_ bv0 1)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1761~0#1.base_47|) (_ bv0 1)))) is different from true [2023-11-26 10:46:24,622 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-26 10:46:24,622 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:24,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:24,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915628889] [2023-11-26 10:46:24,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915628889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:24,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:24,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 10:46:24,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482813897] [2023-11-26 10:46:24,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:24,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 10:46:24,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:24,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 10:46:24,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-26 10:46:24,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 43 [2023-11-26 10:46:24,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-26 10:46:24,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:24,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 43 [2023-11-26 10:46:24,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:24,795 INFO L124 PetriNetUnfolderBase]: 60/169 cut-off events. [2023-11-26 10:46:24,795 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2023-11-26 10:46:24,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 169 events. 60/169 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 610 event pairs, 21 based on Foata normal form. 4/166 useless extension candidates. Maximal degree in co-relation 345. Up to 107 conditions per place. [2023-11-26 10:46:24,797 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 20 selfloop transitions, 5 changer transitions 0/40 dead transitions. [2023-11-26 10:46:24,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 40 transitions, 172 flow [2023-11-26 10:46:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 10:46:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 10:46:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2023-11-26 10:46:24,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697674418604651 [2023-11-26 10:46:24,800 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 101 transitions. [2023-11-26 10:46:24,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 101 transitions. [2023-11-26 10:46:24,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:24,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 101 transitions. [2023-11-26 10:46:24,801 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:24,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:24,802 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 43.0) internal successors, (258), 6 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-26 10:46:24,802 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 110 flow. Second operand 5 states and 101 transitions. [2023-11-26 10:46:24,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 40 transitions, 172 flow [2023-11-26 10:46:24,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 144 flow, removed 5 selfloop flow, removed 6 redundant places. [2023-11-26 10:46:24,805 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 105 flow [2023-11-26 10:46:24,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=105, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-11-26 10:46:24,806 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-11-26 10:46:24,807 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 105 flow [2023-11-26 10:46:24,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 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-26 10:46:24,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:24,807 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:24,811 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,011 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:25,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:25,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2053459720, now seen corresponding path program 1 times [2023-11-26 10:46:25,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:25,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133418688] [2023-11-26 10:46:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 10:46:25,013 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-26 10:46:25,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:25,015 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,029 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 10:46:25,158 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-26 10:46:25,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:25,229 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-26 10:46:25,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:25,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:25,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133418688] [2023-11-26 10:46:25,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133418688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:25,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 10:46:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153548396] [2023-11-26 10:46:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:25,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 10:46:25,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:25,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 10:46:25,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 10:46:25,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 43 [2023-11-26 10:46:25,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 105 flow. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:25,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:25,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 43 [2023-11-26 10:46:25,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:25,496 INFO L124 PetriNetUnfolderBase]: 128/338 cut-off events. [2023-11-26 10:46:25,497 INFO L125 PetriNetUnfolderBase]: For 98/102 co-relation queries the response was YES. [2023-11-26 10:46:25,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 338 events. 128/338 cut-off events. For 98/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1456 event pairs, 33 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 738. Up to 145 conditions per place. [2023-11-26 10:46:25,524 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 40 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-11-26 10:46:25,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 270 flow [2023-11-26 10:46:25,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 10:46:25,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 10:46:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2023-11-26 10:46:25,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2023-11-26 10:46:25,527 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 156 transitions. [2023-11-26 10:46:25,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 156 transitions. [2023-11-26 10:46:25,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:25,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 156 transitions. [2023-11-26 10:46:25,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.0) internal successors, (156), 6 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-26 10:46:25,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:25,530 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 43.0) internal successors, (301), 7 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:25,530 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 105 flow. Second operand 6 states and 156 transitions. [2023-11-26 10:46:25,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 270 flow [2023-11-26 10:46:25,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 10:46:25,533 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 137 flow [2023-11-26 10:46:25,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-11-26 10:46:25,534 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-11-26 10:46:25,534 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 137 flow [2023-11-26 10:46:25,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 6 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:25,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:25,535 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:25,542 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:25,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:25,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:25,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1338723952, now seen corresponding path program 2 times [2023-11-26 10:46:25,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:25,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [931284574] [2023-11-26 10:46:25,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 10:46:25,745 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-26 10:46:25,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:25,746 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:25,878 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 10:46:25,878 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 10:46:25,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-26 10:46:25,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 10:46:26,832 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-26 10:46:26,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 10:46:26,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 10:46:26,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [931284574] [2023-11-26 10:46:26,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [931284574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 10:46:26,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 10:46:26,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 10:46:26,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967043437] [2023-11-26 10:46:26,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 10:46:26,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 10:46:26,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 10:46:26,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 10:46:26,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-26 10:46:26,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 43 [2023-11-26 10:46:26,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 137 flow. Second operand has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:26,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 10:46:26,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 43 [2023-11-26 10:46:26,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 10:46:27,231 INFO L124 PetriNetUnfolderBase]: 162/437 cut-off events. [2023-11-26 10:46:27,232 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2023-11-26 10:46:27,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 437 events. 162/437 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2151 event pairs, 22 based on Foata normal form. 4/428 useless extension candidates. Maximal degree in co-relation 1075. Up to 167 conditions per place. [2023-11-26 10:46:27,236 INFO L140 encePairwiseOnDemand]: 33/43 looper letters, 39 selfloop transitions, 13 changer transitions 0/70 dead transitions. [2023-11-26 10:46:27,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 70 transitions, 353 flow [2023-11-26 10:46:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-26 10:46:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-26 10:46:27,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 253 transitions. [2023-11-26 10:46:27,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5883720930232558 [2023-11-26 10:46:27,239 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 253 transitions. [2023-11-26 10:46:27,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 253 transitions. [2023-11-26 10:46:27,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 10:46:27,239 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 253 transitions. [2023-11-26 10:46:27,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 25.3) internal successors, (253), 10 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:27,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:27,242 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 43.0) internal successors, (473), 11 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:27,242 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 137 flow. Second operand 10 states and 253 transitions. [2023-11-26 10:46:27,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 70 transitions, 353 flow [2023-11-26 10:46:27,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 70 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 10:46:27,247 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 232 flow [2023-11-26 10:46:27,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=43, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=232, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-11-26 10:46:27,248 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 17 predicate places. [2023-11-26 10:46:27,248 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 232 flow [2023-11-26 10:46:27,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 22.555555555555557) internal successors, (203), 9 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 10:46:27,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 10:46:27,249 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:27,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:27,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:27,452 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-26 10:46:27,453 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 10:46:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1068245526, now seen corresponding path program 3 times [2023-11-26 10:46:27,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 10:46:27,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683672717] [2023-11-26 10:46:27,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 10:46:27,454 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-26 10:46:27,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 10:46:27,455 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:27,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:27,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 10:46:27,609 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 10:46:27,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 10:46:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 10:46:27,773 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 10:46:27,774 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 10:46:27,775 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-26 10:46:27,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-26 10:46:27,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-26 10:46:27,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-26 10:46:27,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-26 10:46:27,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-26 10:46:27,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-26 10:46:27,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-26 10:46:27,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-26 10:46:27,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-26 10:46:27,788 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-26 10:46:27,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/mathsat -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-26 10:46:27,983 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 10:46:27,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 10:46:27,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 10:46:28,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 10:46:28,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 10:46:28,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:46:28,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 10:46:28,101 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 10:46:28 BasicIcfg [2023-11-26 10:46:28,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 10:46:28,106 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 10:46:28,106 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 10:46:28,107 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 10:46:28,107 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 10:46:19" (3/4) ... [2023-11-26 10:46:28,109 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 10:46:28,110 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 10:46:28,118 INFO L158 Benchmark]: Toolchain (without parser) took 10755.33ms. Allocated memory was 77.6MB in the beginning and 163.6MB in the end (delta: 86.0MB). Free memory was 52.7MB in the beginning and 61.4MB in the end (delta: -8.7MB). Peak memory consumption was 78.7MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,118 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 15.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 10:46:28,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 864.44ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 45.2MB in the end (delta: 7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.15ms. Allocated memory is still 77.6MB. Free memory was 45.2MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,120 INFO L158 Benchmark]: Boogie Preprocessor took 73.57ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 38.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,120 INFO L158 Benchmark]: RCFGBuilder took 1091.07ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 38.9MB in the beginning and 58.6MB in the end (delta: -19.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,121 INFO L158 Benchmark]: TraceAbstraction took 8641.87ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 57.9MB in the beginning and 62.4MB in the end (delta: -4.5MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,121 INFO L158 Benchmark]: Witness Printer took 4.58ms. Allocated memory is still 163.6MB. Free memory was 62.4MB in the beginning and 61.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 10:46:28,125 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.35ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 15.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 864.44ms. Allocated memory is still 77.6MB. Free memory was 52.5MB in the beginning and 45.2MB in the end (delta: 7.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.15ms. Allocated memory is still 77.6MB. Free memory was 45.2MB in the beginning and 42.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.57ms. Allocated memory is still 77.6MB. Free memory was 42.3MB in the beginning and 38.9MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1091.07ms. Allocated memory was 77.6MB in the beginning and 94.4MB in the end (delta: 16.8MB). Free memory was 38.9MB in the beginning and 58.6MB in the end (delta: -19.7MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8641.87ms. Allocated memory was 94.4MB in the beginning and 163.6MB in the end (delta: 69.2MB). Free memory was 57.9MB in the beginning and 62.4MB in the end (delta: -4.5MB). Peak memory consumption was 63.1MB. Max. memory is 16.1GB. * Witness Printer took 4.58ms. Allocated memory is still 163.6MB. Free memory was 62.4MB in the beginning and 61.4MB 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~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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1761; [L824] FCALL, FORK 0 pthread_create(&t1761, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L825] 0 pthread_t t1762; [L826] FCALL, FORK 0 pthread_create(&t1762, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 2 y$w_buff1 = y$w_buff0 [L772] 2 y$w_buff0 = 1 [L773] 2 y$w_buff1_used = y$w_buff0_used [L774] 2 y$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 y$flush_delayed = weak$$choice2 [L785] 2 y$mem_tmp = y [L786] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L787] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L788] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L789] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L790] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L792] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = y [L794] 2 y = y$flush_delayed ? y$mem_tmp : y [L795] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L798] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 y$flush_delayed = weak$$choice2 [L749] 1 y$mem_tmp = y [L750] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L751] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L752] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L753] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L754] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L756] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = y [L758] 1 y = y$flush_delayed ? y$mem_tmp : y [L759] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L801] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L802] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L803] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L804] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L805] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L808] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L828] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L830] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L830] RET 0 assume_abort_if_not(main$tmp_guard0) [L832] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L833] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L834] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L835] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L836] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L839] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1761={5:0}, t1762={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L841] 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=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L18] 0 __assert_fail ("0", "rfi010.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 821]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 824]: 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: 826]: 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 5 procedures, 61 locations, 10 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: 8.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 258 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 211 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 755 IncrementalHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 6 mSDtfsCounter, 755 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=232occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 166 NumberOfCodeBlocks, 166 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 129 ConstructedInterpolants, 1 QuantifiedInterpolants, 991 SizeOfPredicates, 11 NumberOfNonLiveVariables, 956 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 10:46:28,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e2892572-15fe-49ca-ab39-86a2058b9b76/bin/uautomizer-verify-VRDe98Ueme/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