./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff 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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu --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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:54:46,164 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:54:46,289 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 07:54:46,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:54:46,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:54:46,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:54:46,349 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:54:46,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:54:46,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:54:46,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:54:46,358 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:54:46,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:54:46,359 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:54:46,361 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:54:46,362 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:54:46,362 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:54:46,363 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:54:46,363 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:54:46,364 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:54:46,364 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:54:46,365 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:54:46,365 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:54:46,366 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:54:46,366 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:54:46,367 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:54:46,367 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:54:46,369 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:54:46,369 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:54:46,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:54:46,370 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:46,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:54:46,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:54:46,372 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:54:46,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:54:46,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:54:46,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:54:46,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:54:46,374 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:54:46,374 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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu 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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-19 07:54:46,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:54:46,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:54:46,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:54:46,805 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:54:46,806 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:54:46,807 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:54:49,888 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:54:50,243 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:54:50,243 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:54:50,270 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/6605d3748/b11628b42009434d8a1522ac568dd6cd/FLAG3ffb7922c [2023-11-19 07:54:50,290 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/6605d3748/b11628b42009434d8a1522ac568dd6cd [2023-11-19 07:54:50,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:54:50,299 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:54:50,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:50,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:54:50,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:54:50,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:50" (1/1) ... [2023-11-19 07:54:50,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5343004f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:50, skipping insertion in model container [2023-11-19 07:54:50,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:54:50" (1/1) ... [2023-11-19 07:54:50,397 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:54:50,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:50,917 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:54:51,000 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:54:51,046 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:54:51,046 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:54:51,055 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:54:51,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51 WrapperNode [2023-11-19 07:54:51,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:54:51,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:51,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:54:51,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:54:51,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,123 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2023-11-19 07:54:51,124 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:54:51,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:54:51,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:54:51,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:54:51,146 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,146 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,151 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,171 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,174 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:54:51,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:54:51,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:54:51,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:54:51,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (1/1) ... [2023-11-19 07:54:51,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:54:51,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:54:51,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:54:51,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:54:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:54:51,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:54:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:54:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:54:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:54:51,278 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:54:51,278 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:54:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:54:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:54:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:54:51,279 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:54:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:54:51,279 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:54:51,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:54:51,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:54:51,282 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:54:51,530 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:54:51,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:54:51,953 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:54:52,199 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:54:52,200 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:54:52,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:52 BoogieIcfgContainer [2023-11-19 07:54:52,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:54:52,211 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:54:52,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:54:52,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:54:52,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:54:50" (1/3) ... [2023-11-19 07:54:52,218 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3814f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:52, skipping insertion in model container [2023-11-19 07:54:52,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:54:51" (2/3) ... [2023-11-19 07:54:52,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3814f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:54:52, skipping insertion in model container [2023-11-19 07:54:52,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:52" (3/3) ... [2023-11-19 07:54:52,223 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:54:52,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:54:52,248 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 07:54:52,248 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:54:52,315 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:54:52,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 126 transitions, 264 flow [2023-11-19 07:54:52,432 INFO L124 PetriNetUnfolderBase]: 4/123 cut-off events. [2023-11-19 07:54:52,432 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:52,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 4/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-19 07:54:52,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 126 transitions, 264 flow [2023-11-19 07:54:52,446 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 123 transitions, 255 flow [2023-11-19 07:54:52,450 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:54:52,466 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 123 transitions, 255 flow [2023-11-19 07:54:52,469 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 123 transitions, 255 flow [2023-11-19 07:54:52,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 123 transitions, 255 flow [2023-11-19 07:54:52,533 INFO L124 PetriNetUnfolderBase]: 4/123 cut-off events. [2023-11-19 07:54:52,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:52,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 4/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-19 07:54:52,539 INFO L119 LiptonReduction]: Number of co-enabled transitions 2686 [2023-11-19 07:54:57,475 INFO L134 LiptonReduction]: Checked pairs total: 6367 [2023-11-19 07:54:57,476 INFO L136 LiptonReduction]: Total number of compositions: 125 [2023-11-19 07:54:57,495 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:54:57,507 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;@656a3d8b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:54:57,507 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 07:54:57,510 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:54:57,510 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 07:54:57,511 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:57,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:57,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:54:57,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:54:57,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times [2023-11-19 07:54:57,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:57,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141627027] [2023-11-19 07:54:57,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:57,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:57,700 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-19 07:54:57,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:57,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141627027] [2023-11-19 07:54:57,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141627027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:54:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735122549] [2023-11-19 07:54:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:57,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:54:57,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:57,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:54:57,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:54:57,768 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 251 [2023-11-19 07:54:57,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:57,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:57,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 251 [2023-11-19 07:54:57,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:58,627 INFO L124 PetriNetUnfolderBase]: 1616/2377 cut-off events. [2023-11-19 07:54:58,628 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-19 07:54:58,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4801 conditions, 2377 events. 1616/2377 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 11019 event pairs, 1616 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 4790. Up to 2368 conditions per place. [2023-11-19 07:54:58,664 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-19 07:54:58,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-11-19 07:54:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:54:58,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:54:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 252 transitions. [2023-11-19 07:54:58,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.50199203187251 [2023-11-19 07:54:58,692 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 252 transitions. [2023-11-19 07:54:58,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 252 transitions. [2023-11-19 07:54:58,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:58,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 252 transitions. [2023-11-19 07:54:58,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:58,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:58,715 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:58,717 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 252 transitions. [2023-11-19 07:54:58,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-11-19 07:54:58,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:54:58,725 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-11-19 07:54:58,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-19 07:54:58,734 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-11-19 07:54:58,734 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-11-19 07:54:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:58,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:58,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:54:58,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:54:58,737 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:54:58,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash 556124, now seen corresponding path program 1 times [2023-11-19 07:54:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:58,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525182231] [2023-11-19 07:54:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:54:59,274 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-19 07:54:59,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:54:59,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525182231] [2023-11-19 07:54:59,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525182231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:54:59,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:54:59,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:54:59,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041824086] [2023-11-19 07:54:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:54:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:54:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:54:59,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:54:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:54:59,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-11-19 07:54:59,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:59,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:54:59,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-11-19 07:54:59,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:54:59,800 INFO L124 PetriNetUnfolderBase]: 1263/2016 cut-off events. [2023-11-19 07:54:59,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:54:59,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2016 events. 1263/2016 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10962 event pairs, 204 based on Foata normal form. 0/1855 useless extension candidates. Maximal degree in co-relation 3922. Up to 1510 conditions per place. [2023-11-19 07:54:59,823 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 35 selfloop transitions, 2 changer transitions 2/41 dead transitions. [2023-11-19 07:54:59,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 170 flow [2023-11-19 07:54:59,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:54:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:54:59,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-19 07:54:59,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4913678618857902 [2023-11-19 07:54:59,832 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-19 07:54:59,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-19 07:54:59,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:54:59,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-19 07:54:59,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:59,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:59,845 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:59,845 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 370 transitions. [2023-11-19 07:54:59,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 170 flow [2023-11-19 07:54:59,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:54:59,853 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-11-19 07:54:59,854 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-11-19 07:54:59,856 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-11-19 07:54:59,856 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-11-19 07:54:59,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:54:59,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:54:59,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:54:59,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:54:59,867 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:54:59,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:54:59,869 INFO L85 PathProgramCache]: Analyzing trace with hash 709781340, now seen corresponding path program 1 times [2023-11-19 07:54:59,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:54:59,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365801914] [2023-11-19 07:54:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:54:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:54:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:00,369 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-19 07:55:00,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:00,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365801914] [2023-11-19 07:55:00,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365801914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:00,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:00,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:55:00,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809922895] [2023-11-19 07:55:00,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:00,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:00,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:00,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:00,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:00,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-19 07:55:00,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:00,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:00,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-19 07:55:00,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:01,139 INFO L124 PetriNetUnfolderBase]: 2847/4217 cut-off events. [2023-11-19 07:55:01,139 INFO L125 PetriNetUnfolderBase]: For 250/250 co-relation queries the response was YES. [2023-11-19 07:55:01,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8758 conditions, 4217 events. 2847/4217 cut-off events. For 250/250 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 21335 event pairs, 1013 based on Foata normal form. 0/4112 useless extension candidates. Maximal degree in co-relation 8754. Up to 2169 conditions per place. [2023-11-19 07:55:01,182 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-11-19 07:55:01,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 178 flow [2023-11-19 07:55:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-19 07:55:01,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701195219123506 [2023-11-19 07:55:01,186 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-19 07:55:01,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-19 07:55:01,186 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:01,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-19 07:55:01,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:01,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:01,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:01,193 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 354 transitions. [2023-11-19 07:55:01,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 178 flow [2023-11-19 07:55:01,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:55:01,197 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 106 flow [2023-11-19 07:55:01,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-11-19 07:55:01,199 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-11-19 07:55:01,200 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 106 flow [2023-11-19 07:55:01,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:01,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:01,201 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:01,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:55:01,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:01,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 528383446, now seen corresponding path program 1 times [2023-11-19 07:55:01,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:01,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240373503] [2023-11-19 07:55:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:01,533 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-19 07:55:01,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:01,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240373503] [2023-11-19 07:55:01,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240373503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:01,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:01,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313552654] [2023-11-19 07:55:01,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:01,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:01,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:01,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:01,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-19 07:55:01,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:01,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:01,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-19 07:55:01,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:02,409 INFO L124 PetriNetUnfolderBase]: 2806/4153 cut-off events. [2023-11-19 07:55:02,410 INFO L125 PetriNetUnfolderBase]: For 1760/1760 co-relation queries the response was YES. [2023-11-19 07:55:02,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10642 conditions, 4153 events. 2806/4153 cut-off events. For 1760/1760 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 20672 event pairs, 253 based on Foata normal form. 5/4158 useless extension candidates. Maximal degree in co-relation 10637. Up to 2008 conditions per place. [2023-11-19 07:55:02,457 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 44 selfloop transitions, 11 changer transitions 0/55 dead transitions. [2023-11-19 07:55:02,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 296 flow [2023-11-19 07:55:02,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:55:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:55:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-11-19 07:55:02,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46613545816733065 [2023-11-19 07:55:02,461 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-11-19 07:55:02,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-11-19 07:55:02,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:02,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-11-19 07:55:02,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:02,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:02,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:02,470 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 106 flow. Second operand 4 states and 468 transitions. [2023-11-19 07:55:02,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 296 flow [2023-11-19 07:55:02,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 07:55:02,480 INFO L231 Difference]: Finished difference. Result has 39 places, 35 transitions, 170 flow [2023-11-19 07:55:02,480 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=39, PETRI_TRANSITIONS=35} [2023-11-19 07:55:02,481 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-11-19 07:55:02,482 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 35 transitions, 170 flow [2023-11-19 07:55:02,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:02,483 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:02,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:02,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:55:02,484 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:02,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:02,484 INFO L85 PathProgramCache]: Analyzing trace with hash 528383694, now seen corresponding path program 1 times [2023-11-19 07:55:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:02,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476006532] [2023-11-19 07:55:02,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:02,689 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-19 07:55:02,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:02,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476006532] [2023-11-19 07:55:02,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476006532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:02,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:02,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910863765] [2023-11-19 07:55:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:02,709 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-19 07:55:02,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 35 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:02,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:02,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-19 07:55:02,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:03,478 INFO L124 PetriNetUnfolderBase]: 2767/4094 cut-off events. [2023-11-19 07:55:03,479 INFO L125 PetriNetUnfolderBase]: For 3549/3549 co-relation queries the response was YES. [2023-11-19 07:55:03,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11448 conditions, 4094 events. 2767/4094 cut-off events. For 3549/3549 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 20502 event pairs, 423 based on Foata normal form. 8/4102 useless extension candidates. Maximal degree in co-relation 11441. Up to 2059 conditions per place. [2023-11-19 07:55:03,576 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 50 selfloop transitions, 17 changer transitions 0/67 dead transitions. [2023-11-19 07:55:03,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 67 transitions, 416 flow [2023-11-19 07:55:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:55:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:55:03,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-11-19 07:55:03,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711155378486056 [2023-11-19 07:55:03,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-11-19 07:55:03,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-11-19 07:55:03,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:03,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-11-19 07:55:03,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 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-19 07:55:03,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:03,587 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:03,587 INFO L175 Difference]: Start difference. First operand has 39 places, 35 transitions, 170 flow. Second operand 4 states and 473 transitions. [2023-11-19 07:55:03,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 67 transitions, 416 flow [2023-11-19 07:55:03,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 416 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:55:03,603 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 304 flow [2023-11-19 07:55:03,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=304, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-11-19 07:55:03,606 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-11-19 07:55:03,607 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 304 flow [2023-11-19 07:55:03,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:03,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:03,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:03,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:55:03,608 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:03,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 528385795, now seen corresponding path program 1 times [2023-11-19 07:55:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353200268] [2023-11-19 07:55:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:55:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353200268] [2023-11-19 07:55:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353200268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:04,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:55:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286013406] [2023-11-19 07:55:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:04,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:55:04,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:04,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:55:04,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:55:04,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 251 [2023-11-19 07:55:04,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 304 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:04,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:04,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 251 [2023-11-19 07:55:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:05,094 INFO L124 PetriNetUnfolderBase]: 1857/2867 cut-off events. [2023-11-19 07:55:05,094 INFO L125 PetriNetUnfolderBase]: For 5950/6105 co-relation queries the response was YES. [2023-11-19 07:55:05,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8976 conditions, 2867 events. 1857/2867 cut-off events. For 5950/6105 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14653 event pairs, 680 based on Foata normal form. 309/3147 useless extension candidates. Maximal degree in co-relation 8966. Up to 1987 conditions per place. [2023-11-19 07:55:05,118 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 34 selfloop transitions, 3 changer transitions 24/70 dead transitions. [2023-11-19 07:55:05,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 70 transitions, 578 flow [2023-11-19 07:55:05,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:55:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 07:55:05,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-11-19 07:55:05,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050464807436919 [2023-11-19 07:55:05,122 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-11-19 07:55:05,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-11-19 07:55:05,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:05,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-11-19 07:55:05,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,130 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,131 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 304 flow. Second operand 6 states and 610 transitions. [2023-11-19 07:55:05,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 70 transitions, 578 flow [2023-11-19 07:55:05,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 70 transitions, 578 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 07:55:05,143 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 250 flow [2023-11-19 07:55:05,143 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-19 07:55:05,144 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-11-19 07:55:05,144 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 250 flow [2023-11-19 07:55:05,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,145 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:05,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:05,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:55:05,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:05,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:05,146 INFO L85 PathProgramCache]: Analyzing trace with hash -489001538, now seen corresponding path program 1 times [2023-11-19 07:55:05,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:05,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070776750] [2023-11-19 07:55:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:05,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,286 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-19 07:55:05,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:05,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070776750] [2023-11-19 07:55:05,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070776750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:05,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:05,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:55:05,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199096670] [2023-11-19 07:55:05,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:05,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:05,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:05,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:05,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:05,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-11-19 07:55:05,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:05,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-11-19 07:55:05,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:05,568 INFO L124 PetriNetUnfolderBase]: 704/1236 cut-off events. [2023-11-19 07:55:05,568 INFO L125 PetriNetUnfolderBase]: For 2244/2278 co-relation queries the response was YES. [2023-11-19 07:55:05,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3672 conditions, 1236 events. 704/1236 cut-off events. For 2244/2278 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6224 event pairs, 155 based on Foata normal form. 99/1328 useless extension candidates. Maximal degree in co-relation 3661. Up to 958 conditions per place. [2023-11-19 07:55:05,580 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 43 selfloop transitions, 4 changer transitions 0/56 dead transitions. [2023-11-19 07:55:05,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 458 flow [2023-11-19 07:55:05,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:55:05,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:55:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 355 transitions. [2023-11-19 07:55:05,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714475431606906 [2023-11-19 07:55:05,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 355 transitions. [2023-11-19 07:55:05,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 355 transitions. [2023-11-19 07:55:05,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:05,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 355 transitions. [2023-11-19 07:55:05,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,587 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,588 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 250 flow. Second operand 3 states and 355 transitions. [2023-11-19 07:55:05,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 458 flow [2023-11-19 07:55:05,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 430 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-19 07:55:05,595 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 257 flow [2023-11-19 07:55:05,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=257, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-11-19 07:55:05,596 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-11-19 07:55:05,596 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 257 flow [2023-11-19 07:55:05,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:05,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:05,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 07:55:05,598 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:05,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:05,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1324560024, now seen corresponding path program 1 times [2023-11-19 07:55:05,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477548867] [2023-11-19 07:55:05,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:05,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:05,875 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-19 07:55:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477548867] [2023-11-19 07:55:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477548867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:05,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:05,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:05,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543629597] [2023-11-19 07:55:05,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:05,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:05,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:05,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:05,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:05,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 251 [2023-11-19 07:55:05,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 257 flow. Second operand has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:05,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:05,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 251 [2023-11-19 07:55:05,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:06,299 INFO L124 PetriNetUnfolderBase]: 1202/2028 cut-off events. [2023-11-19 07:55:06,300 INFO L125 PetriNetUnfolderBase]: For 3602/3602 co-relation queries the response was YES. [2023-11-19 07:55:06,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6824 conditions, 2028 events. 1202/2028 cut-off events. For 3602/3602 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 10717 event pairs, 280 based on Foata normal form. 36/2064 useless extension candidates. Maximal degree in co-relation 6812. Up to 889 conditions per place. [2023-11-19 07:55:06,315 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 52 selfloop transitions, 14 changer transitions 6/72 dead transitions. [2023-11-19 07:55:06,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 538 flow [2023-11-19 07:55:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:55:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:55:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-11-19 07:55:06,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46713147410358563 [2023-11-19 07:55:06,318 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-11-19 07:55:06,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-11-19 07:55:06,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:06,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-11-19 07:55:06,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,324 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,325 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 257 flow. Second operand 4 states and 469 transitions. [2023-11-19 07:55:06,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 538 flow [2023-11-19 07:55:06,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:06,335 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 295 flow [2023-11-19 07:55:06,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2023-11-19 07:55:06,338 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-11-19 07:55:06,338 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 295 flow [2023-11-19 07:55:06,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 107.5) internal successors, (430), 4 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:06,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:06,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 07:55:06,339 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:06,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1242649859, now seen corresponding path program 1 times [2023-11-19 07:55:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098545085] [2023-11-19 07:55:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:06,589 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-19 07:55:06,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:06,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098545085] [2023-11-19 07:55:06,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098545085] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:06,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:06,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:55:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564728178] [2023-11-19 07:55:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:06,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:55:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:06,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:55:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:55:06,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-11-19 07:55:06,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:06,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-11-19 07:55:06,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:06,866 INFO L124 PetriNetUnfolderBase]: 441/866 cut-off events. [2023-11-19 07:55:06,866 INFO L125 PetriNetUnfolderBase]: For 1526/1545 co-relation queries the response was YES. [2023-11-19 07:55:06,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2968 conditions, 866 events. 441/866 cut-off events. For 1526/1545 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4529 event pairs, 115 based on Foata normal form. 110/965 useless extension candidates. Maximal degree in co-relation 2954. Up to 288 conditions per place. [2023-11-19 07:55:06,873 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 56 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2023-11-19 07:55:06,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 71 transitions, 645 flow [2023-11-19 07:55:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:55:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:55:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-11-19 07:55:06,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721115537848606 [2023-11-19 07:55:06,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-11-19 07:55:06,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-11-19 07:55:06,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:06,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-11-19 07:55:06,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,882 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,882 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 295 flow. Second operand 4 states and 474 transitions. [2023-11-19 07:55:06,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 71 transitions, 645 flow [2023-11-19 07:55:06,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 614 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-19 07:55:06,891 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 318 flow [2023-11-19 07:55:06,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=318, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-11-19 07:55:06,892 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-11-19 07:55:06,892 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 318 flow [2023-11-19 07:55:06,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:06,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:06,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:06,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 07:55:06,894 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:06,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:06,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1813265396, now seen corresponding path program 1 times [2023-11-19 07:55:06,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:06,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70077629] [2023-11-19 07:55:06,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:06,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:07,258 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-19 07:55:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:07,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70077629] [2023-11-19 07:55:07,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70077629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:07,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:07,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:55:07,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734294298] [2023-11-19 07:55:07,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:07,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:55:07,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:07,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:55:07,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:55:07,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-11-19 07:55:07,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 318 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:07,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:07,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-11-19 07:55:07,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:07,488 INFO L124 PetriNetUnfolderBase]: 369/706 cut-off events. [2023-11-19 07:55:07,488 INFO L125 PetriNetUnfolderBase]: For 1494/1505 co-relation queries the response was YES. [2023-11-19 07:55:07,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2740 conditions, 706 events. 369/706 cut-off events. For 1494/1505 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3549 event pairs, 106 based on Foata normal form. 42/737 useless extension candidates. Maximal degree in co-relation 2724. Up to 285 conditions per place. [2023-11-19 07:55:07,493 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 44 selfloop transitions, 10 changer transitions 13/71 dead transitions. [2023-11-19 07:55:07,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 71 transitions, 642 flow [2023-11-19 07:55:07,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:55:07,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:55:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 581 transitions. [2023-11-19 07:55:07,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46294820717131474 [2023-11-19 07:55:07,497 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 581 transitions. [2023-11-19 07:55:07,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 581 transitions. [2023-11-19 07:55:07,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:07,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 581 transitions. [2023-11-19 07:55:07,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:07,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:07,505 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:07,506 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 318 flow. Second operand 5 states and 581 transitions. [2023-11-19 07:55:07,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 71 transitions, 642 flow [2023-11-19 07:55:07,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 71 transitions, 624 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-19 07:55:07,513 INFO L231 Difference]: Finished difference. Result has 56 places, 35 transitions, 272 flow [2023-11-19 07:55:07,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=272, PETRI_PLACES=56, PETRI_TRANSITIONS=35} [2023-11-19 07:55:07,515 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-11-19 07:55:07,515 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 35 transitions, 272 flow [2023-11-19 07:55:07,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:07,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:07,516 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-19 07:55:07,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-19 07:55:07,517 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:07,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:07,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1922580870, now seen corresponding path program 1 times [2023-11-19 07:55:07,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:07,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89916599] [2023-11-19 07:55:07,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:07,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:07,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:08,670 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-19 07:55:08,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:55:08,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89916599] [2023-11-19 07:55:08,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89916599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:08,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:08,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:55:08,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635264677] [2023-11-19 07:55:08,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:08,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:55:08,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:55:08,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:55:08,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:55:08,744 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 251 [2023-11-19 07:55:08,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 35 transitions, 272 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:08,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:08,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 251 [2023-11-19 07:55:08,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:09,125 INFO L124 PetriNetUnfolderBase]: 218/433 cut-off events. [2023-11-19 07:55:09,126 INFO L125 PetriNetUnfolderBase]: For 1110/1112 co-relation queries the response was YES. [2023-11-19 07:55:09,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1783 conditions, 433 events. 218/433 cut-off events. For 1110/1112 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1886 event pairs, 32 based on Foata normal form. 3/435 useless extension candidates. Maximal degree in co-relation 1766. Up to 222 conditions per place. [2023-11-19 07:55:09,130 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 38 selfloop transitions, 4 changer transitions 29/75 dead transitions. [2023-11-19 07:55:09,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 75 transitions, 672 flow [2023-11-19 07:55:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:55:09,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 07:55:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 789 transitions. [2023-11-19 07:55:09,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44906089926010245 [2023-11-19 07:55:09,137 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 789 transitions. [2023-11-19 07:55:09,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 789 transitions. [2023-11-19 07:55:09,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:09,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 789 transitions. [2023-11-19 07:55:09,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.71428571428571) internal successors, (789), 7 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:09,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:09,149 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:09,149 INFO L175 Difference]: Start difference. First operand has 56 places, 35 transitions, 272 flow. Second operand 7 states and 789 transitions. [2023-11-19 07:55:09,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 75 transitions, 672 flow [2023-11-19 07:55:09,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 550 flow, removed 13 selfloop flow, removed 10 redundant places. [2023-11-19 07:55:09,158 INFO L231 Difference]: Finished difference. Result has 54 places, 35 transitions, 219 flow [2023-11-19 07:55:09,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=219, PETRI_PLACES=54, PETRI_TRANSITIONS=35} [2023-11-19 07:55:09,160 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-11-19 07:55:09,160 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 35 transitions, 219 flow [2023-11-19 07:55:09,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:09,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:09,161 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-19 07:55:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-19 07:55:09,162 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:09,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:09,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1127265668, now seen corresponding path program 2 times [2023-11-19 07:55:09,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:55:09,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602426125] [2023-11-19 07:55:09,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:09,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:55:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:55:09,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 07:55:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 07:55:09,333 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 07:55:09,334 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 07:55:09,335 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-19 07:55:09,337 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-19 07:55:09,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-19 07:55:09,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-19 07:55:09,338 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-19 07:55:09,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-19 07:55:09,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-19 07:55:09,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-19 07:55:09,339 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-19 07:55:09,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-19 07:55:09,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-19 07:55:09,340 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-19 07:55:09,341 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-19 07:55:09,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-19 07:55:09,341 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:55:09,349 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 07:55:09,349 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 07:55:09,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 07:55:09,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-19 07:55:09,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-19 07:55:09,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 07:55:09,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:55:09 BasicIcfg [2023-11-19 07:55:09,435 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 07:55:09,436 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 07:55:09,436 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 07:55:09,436 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 07:55:09,437 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:54:52" (3/4) ... [2023-11-19 07:55:09,439 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 07:55:09,440 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 07:55:09,441 INFO L158 Benchmark]: Toolchain (without parser) took 19142.30ms. Allocated memory was 127.9MB in the beginning and 541.1MB in the end (delta: 413.1MB). Free memory was 85.7MB in the beginning and 376.7MB in the end (delta: -291.0MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,442 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 71.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:55:09,442 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.37ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 61.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,443 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.88ms. Allocated memory is still 127.9MB. Free memory was 61.9MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,443 INFO L158 Benchmark]: Boogie Preprocessor took 61.09ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,443 INFO L158 Benchmark]: RCFGBuilder took 1019.54ms. Allocated memory is still 127.9MB. Free memory was 57.2MB in the beginning and 67.4MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,444 INFO L158 Benchmark]: TraceAbstraction took 17224.56ms. Allocated memory was 127.9MB in the beginning and 541.1MB in the end (delta: 413.1MB). Free memory was 66.6MB in the beginning and 376.7MB in the end (delta: -310.1MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. [2023-11-19 07:55:09,444 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 541.1MB. Free memory is still 376.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 07:55:09,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 96.5MB. Free memory was 71.8MB in the beginning and 71.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.37ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 61.9MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.88ms. Allocated memory is still 127.9MB. Free memory was 61.9MB in the beginning and 59.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.09ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 57.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1019.54ms. Allocated memory is still 127.9MB. Free memory was 57.2MB in the beginning and 67.4MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 17224.56ms. Allocated memory was 127.9MB in the beginning and 541.1MB in the end (delta: 413.1MB). Free memory was 66.6MB in the beginning and 376.7MB in the end (delta: -310.1MB). Peak memory consumption was 104.7MB. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 541.1MB. Free memory is still 376.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~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 129 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2686 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 125 TotalNumberOfCompositions, 6367 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2790, independent: 2626, independent conditional: 0, independent unconditional: 2626, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1403, independent: 1362, independent conditional: 0, independent unconditional: 1362, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2790, independent: 1264, independent conditional: 0, independent unconditional: 1264, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 1403, unknown conditional: 0, unknown unconditional: 1403] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1489; [L832] FCALL, FORK 0 pthread_create(&t1489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L833] 0 pthread_t t1490; [L834] FCALL, FORK 0 pthread_create(&t1490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L835] 0 pthread_t t1491; [L836] FCALL, FORK 0 pthread_create(&t1491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 1 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 z$flush_delayed = weak$$choice2 [L796] 3 z$mem_tmp = z [L797] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L798] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L799] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L800] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L801] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L803] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EAX = z [L805] 3 z = z$flush_delayed ? z$mem_tmp : z [L806] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L809] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L810] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L811] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L812] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L843] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L844] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L845] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L846] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1489={5:0}, t1490={6:0}, t1491={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L849] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix056_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 836]: 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: 834]: 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: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1189 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 62 mSDtfsCounter, 1189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred in iteration=9, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 774 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-19 07:55:09,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu --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 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:55:12,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:55:12,231 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 07:55:12,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:55:12,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:55:12,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:55:12,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:55:12,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:55:12,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:55:12,297 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:55:12,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:55:12,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:55:12,299 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:55:12,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:55:12,300 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:55:12,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:55:12,301 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:55:12,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:55:12,302 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 07:55:12,303 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 07:55:12,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 07:55:12,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:55:12,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 07:55:12,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 07:55:12,306 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 07:55:12,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:55:12,307 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:55:12,307 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:55:12,308 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:55:12,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:55:12,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:55:12,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:12,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:55:12,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:55:12,311 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 07:55:12,311 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 07:55:12,311 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:55:12,312 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:55:12,312 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:55:12,312 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 07:55:12,313 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:55:12,313 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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/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_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu 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 -> 40cdaf120a3550cc54773a608bdbc3a68dee1334013ab0b4984b9366bf820a3d [2023-11-19 07:55:12,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:55:12,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:55:12,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:55:12,871 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:55:12,872 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:55:12,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:55:16,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:55:16,603 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:55:16,604 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/sv-benchmarks/c/pthread-wmm/mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:55:16,620 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/cd7c30c0f/ffe0382ede714a1fa82e9155b7ea2f91/FLAG83edaf586 [2023-11-19 07:55:16,643 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/data/cd7c30c0f/ffe0382ede714a1fa82e9155b7ea2f91 [2023-11-19 07:55:16,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:55:16,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:55:16,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:16,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:55:16,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:55:16,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:16" (1/1) ... [2023-11-19 07:55:16,657 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c3da2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:16, skipping insertion in model container [2023-11-19 07:55:16,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:55:16" (1/1) ... [2023-11-19 07:55:16,721 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:55:17,333 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:17,353 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:55:17,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:55:17,494 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:55:17,495 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:55:17,503 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:55:17,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17 WrapperNode [2023-11-19 07:55:17,504 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:55:17,505 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:17,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:55:17,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:55:17,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,567 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-19 07:55:17,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:55:17,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:55:17,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:55:17,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:55:17,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:55:17,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:55:17,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:55:17,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:55:17,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (1/1) ... [2023-11-19 07:55:17,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:55:17,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:55:17,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:55:17,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:55:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:55:17,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:55:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:55:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:55:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 07:55:17,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 07:55:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 07:55:17,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 07:55:17,724 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 07:55:17,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 07:55:17,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-19 07:55:17,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-19 07:55:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:55:17,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:55:17,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:55:17,729 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:55:17,976 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:55:17,979 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:55:18,528 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:55:18,796 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:55:18,796 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 07:55:18,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:18 BoogieIcfgContainer [2023-11-19 07:55:18,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:55:18,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:55:18,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:55:18,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:55:18,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:55:16" (1/3) ... [2023-11-19 07:55:18,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e034a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:18, skipping insertion in model container [2023-11-19 07:55:18,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:55:17" (2/3) ... [2023-11-19 07:55:18,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e034a8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:55:18, skipping insertion in model container [2023-11-19 07:55:18,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:55:18" (3/3) ... [2023-11-19 07:55:18,812 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_power.oepc_pso.oepc_rmo.oepc.i [2023-11-19 07:55:18,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:55:18,835 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-19 07:55:18,836 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:55:18,913 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 07:55:18,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 127 transitions, 266 flow [2023-11-19 07:55:19,061 INFO L124 PetriNetUnfolderBase]: 4/124 cut-off events. [2023-11-19 07:55:19,063 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:55:19,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 4/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-19 07:55:19,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 127 transitions, 266 flow [2023-11-19 07:55:19,081 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 124 transitions, 257 flow [2023-11-19 07:55:19,086 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:55:19,103 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 124 transitions, 257 flow [2023-11-19 07:55:19,111 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 124 transitions, 257 flow [2023-11-19 07:55:19,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 124 transitions, 257 flow [2023-11-19 07:55:19,172 INFO L124 PetriNetUnfolderBase]: 4/124 cut-off events. [2023-11-19 07:55:19,172 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:55:19,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 4/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2023-11-19 07:55:19,178 INFO L119 LiptonReduction]: Number of co-enabled transitions 2686 [2023-11-19 07:55:29,552 INFO L134 LiptonReduction]: Checked pairs total: 7037 [2023-11-19 07:55:29,552 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-19 07:55:29,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:55:29,582 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;@28489dc6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:55:29,582 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-19 07:55:29,584 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:55:29,585 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 07:55:29,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 07:55:29,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:29,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 07:55:29,587 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:29,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:29,593 INFO L85 PathProgramCache]: Analyzing trace with hash 569, now seen corresponding path program 1 times [2023-11-19 07:55:29,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:55:29,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226574386] [2023-11-19 07:55:29,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:29,611 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-19 07:55:29,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:55:29,614 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:55:29,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:55:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:29,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 07:55:29,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:55:29,727 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-19 07:55:29,727 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:55:29,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:55:29,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226574386] [2023-11-19 07:55:29,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226574386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:29,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:29,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 07:55:29,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064924761] [2023-11-19 07:55:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:29,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 07:55:29,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:55:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 07:55:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 07:55:29,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 256 [2023-11-19 07:55:29,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 75 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:29,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:29,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 256 [2023-11-19 07:55:29,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:55:30,688 INFO L124 PetriNetUnfolderBase]: 1851/2712 cut-off events. [2023-11-19 07:55:30,688 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-19 07:55:30,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5471 conditions, 2712 events. 1851/2712 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12812 event pairs, 1851 based on Foata normal form. 100/2337 useless extension candidates. Maximal degree in co-relation 5460. Up to 2703 conditions per place. [2023-11-19 07:55:30,717 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 24 selfloop transitions, 0 changer transitions 0/26 dead transitions. [2023-11-19 07:55:30,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 109 flow [2023-11-19 07:55:30,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 07:55:30,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 07:55:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 255 transitions. [2023-11-19 07:55:30,742 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.498046875 [2023-11-19 07:55:30,743 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 255 transitions. [2023-11-19 07:55:30,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 255 transitions. [2023-11-19 07:55:30,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:55:30,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 255 transitions. [2023-11-19 07:55:30,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:30,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:30,764 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:30,767 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 75 flow. Second operand 2 states and 255 transitions. [2023-11-19 07:55:30,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 109 flow [2023-11-19 07:55:30,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:55:30,774 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 58 flow [2023-11-19 07:55:30,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2023-11-19 07:55:30,782 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -8 predicate places. [2023-11-19 07:55:30,782 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 58 flow [2023-11-19 07:55:30,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:30,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:55:30,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-19 07:55:30,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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)] Ended with exit code 0 [2023-11-19 07:55:30,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:55:30,986 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-19 07:55:30,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:55:30,986 INFO L85 PathProgramCache]: Analyzing trace with hash 560993, now seen corresponding path program 1 times [2023-11-19 07:55:30,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 07:55:30,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453176051] [2023-11-19 07:55:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:55:30,988 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-19 07:55:30,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 07:55:30,991 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:55:31,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fad8d010-090c-4675-b4ad-f267d2086ed7/bin/uautomizer-verify-uCwYo4JHxu/mathsat -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-19 07:55:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:55:31,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 07:55:31,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:55:31,142 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-19 07:55:31,143 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 07:55:31,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 07:55:31,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453176051] [2023-11-19 07:55:31,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453176051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:55:31,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:55:31,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:55:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847844168] [2023-11-19 07:55:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:55:31,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:55:31,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 07:55:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:55:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:55:31,158 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 256 [2023-11-19 07:55:31,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:55:31,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:55:31,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 256 [2023-11-19 07:55:31,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand