./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/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 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:37,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:37,362 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-19 08:05:37,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:37,369 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:37,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:37,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:37,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:37,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:05:37,401 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:05:37,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:37,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:37,403 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:37,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:37,404 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:37,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:37,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:37,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:37,407 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:05:37,407 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:05:37,407 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:05:37,408 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:05:37,409 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:05:37,409 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:05:37,410 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:37,410 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:37,411 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:37,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:37,412 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:05:37,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:37,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:37,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:05:37,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 08:05:37,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 08:05:37,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:05:37,415 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:05:37,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:05:37,416 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:05:37,416 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_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2023-11-19 08:05:37,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:37,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:37,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:37,721 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:37,722 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:37,723 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:05:41,155 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:05:41,418 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:05:41,418 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:05:41,442 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/c7cfb40fa/0931a8d9d9f3405e9f91009e4cccf609/FLAG7871d9766 [2023-11-19 08:05:41,462 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/c7cfb40fa/0931a8d9d9f3405e9f91009e4cccf609 [2023-11-19 08:05:41,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:05:41,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:05:41,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:41,469 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:05:41,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:05:41,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:41" (1/1) ... [2023-11-19 08:05:41,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b557276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:41, skipping insertion in model container [2023-11-19 08:05:41,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:05:41" (1/1) ... [2023-11-19 08:05:41,564 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:05:42,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:42,023 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:05:42,079 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:05:42,115 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:42,115 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:05:42,124 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:05:42,124 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42 WrapperNode [2023-11-19 08:05:42,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:05:42,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:42,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:05:42,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:05:42,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,192 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 142 [2023-11-19 08:05:42,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:05:42,194 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:05:42,194 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:05:42,194 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:05:42,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,210 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,234 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,237 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,239 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,243 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:05:42,244 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:05:42,255 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:05:42,256 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:05:42,257 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (1/1) ... [2023-11-19 08:05:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:42,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:05:42,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:05:42,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:05:42,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 08:05:42,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:05:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:05:42,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:05:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:05:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:05:42,348 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:05:42,348 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:05:42,349 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:05:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 08:05:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:05:42,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:05:42,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:05:42,351 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 08:05:42,514 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:05:42,516 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:05:42,904 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:05:43,081 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:05:43,082 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:05:43,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:43 BoogieIcfgContainer [2023-11-19 08:05:43,086 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:05:43,089 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:05:43,089 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:05:43,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:05:43,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:05:41" (1/3) ... [2023-11-19 08:05:43,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96dcae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:43, skipping insertion in model container [2023-11-19 08:05:43,094 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:05:42" (2/3) ... [2023-11-19 08:05:43,094 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96dcae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:05:43, skipping insertion in model container [2023-11-19 08:05:43,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:43" (3/3) ... [2023-11-19 08:05:43,096 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:05:43,116 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:05:43,116 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 08:05:43,117 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:05:43,182 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:05:43,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 108 transitions, 224 flow [2023-11-19 08:05:43,314 INFO L124 PetriNetUnfolderBase]: 4/106 cut-off events. [2023-11-19 08:05:43,314 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:43,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 4/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-19 08:05:43,321 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 108 transitions, 224 flow [2023-11-19 08:05:43,327 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 218 flow [2023-11-19 08:05:43,331 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:05:43,349 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 106 transitions, 218 flow [2023-11-19 08:05:43,351 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 106 transitions, 218 flow [2023-11-19 08:05:43,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 218 flow [2023-11-19 08:05:43,379 INFO L124 PetriNetUnfolderBase]: 4/106 cut-off events. [2023-11-19 08:05:43,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:43,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 106 events. 4/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-19 08:05:43,383 INFO L119 LiptonReduction]: Number of co-enabled transitions 1684 [2023-11-19 08:05:47,941 INFO L134 LiptonReduction]: Checked pairs total: 3824 [2023-11-19 08:05:47,941 INFO L136 LiptonReduction]: Total number of compositions: 111 [2023-11-19 08:05:47,958 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:05:47,966 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;@5f2ba80b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:05:47,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 08:05:47,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:05:47,969 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-19 08:05:47,969 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:47,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:47,970 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:05:47,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:47,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:47,977 INFO L85 PathProgramCache]: Analyzing trace with hash 504, now seen corresponding path program 1 times [2023-11-19 08:05:47,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:47,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504624370] [2023-11-19 08:05:47,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:48,126 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 08:05:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:48,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504624370] [2023-11-19 08:05:48,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504624370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:48,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:48,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:05:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569612341] [2023-11-19 08:05:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:48,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:05:48,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:48,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:05:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:05:48,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 219 [2023-11-19 08:05:48,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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 08:05:48,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:48,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 219 [2023-11-19 08:05:48,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:48,359 INFO L124 PetriNetUnfolderBase]: 287/502 cut-off events. [2023-11-19 08:05:48,359 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 08:05:48,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 502 events. 287/502 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2165 event pairs, 287 based on Foata normal form. 24/414 useless extension candidates. Maximal degree in co-relation 994. Up to 489 conditions per place. [2023-11-19 08:05:48,366 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-19 08:05:48,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-11-19 08:05:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:05:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:05:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2023-11-19 08:05:48,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885844748858447 [2023-11-19 08:05:48,382 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 214 transitions. [2023-11-19 08:05:48,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 214 transitions. [2023-11-19 08:05:48,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:48,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 214 transitions. [2023-11-19 08:05:48,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 107.0) internal successors, (214), 2 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:48,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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 08:05:48,396 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 0 states have call successors, (0), 0 states 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 08:05:48,398 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 214 transitions. [2023-11-19 08:05:48,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-11-19 08:05:48,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:48,403 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-11-19 08:05:48,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-19 08:05:48,409 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-19 08:05:48,409 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-11-19 08:05:48,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states 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 08:05:48,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:48,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:05:48,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 08:05:48,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:48,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:48,411 INFO L85 PathProgramCache]: Analyzing trace with hash 475722002, now seen corresponding path program 1 times [2023-11-19 08:05:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307718600] [2023-11-19 08:05:48,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:48,753 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 08:05:48,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:48,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307718600] [2023-11-19 08:05:48,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307718600] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:48,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:48,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:05:48,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453987364] [2023-11-19 08:05:48,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:48,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:05:48,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:48,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:05:48,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:05:48,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-11-19 08:05:48,762 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:05:48,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:48,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-11-19 08:05:48,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:48,899 INFO L124 PetriNetUnfolderBase]: 235/438 cut-off events. [2023-11-19 08:05:48,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:05:48,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 855 conditions, 438 events. 235/438 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1969 event pairs, 27 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 852. Up to 337 conditions per place. [2023-11-19 08:05:48,904 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 22 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-11-19 08:05:48,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 120 flow [2023-11-19 08:05:48,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:05:48,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:05:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-11-19 08:05:48,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4733637747336377 [2023-11-19 08:05:48,917 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-11-19 08:05:48,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-11-19 08:05:48,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:48,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-11-19 08:05:48,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 08:05:48,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 08:05:48,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 08:05:48,928 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 311 transitions. [2023-11-19 08:05:48,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 120 flow [2023-11-19 08:05:48,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:05:48,933 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-11-19 08:05:48,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-19 08:05:48,934 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-19 08:05:48,935 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-11-19 08:05:48,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:05:48,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:48,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:48,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 08:05:48,939 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:48,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1154947694, now seen corresponding path program 1 times [2023-11-19 08:05:48,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:48,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665467092] [2023-11-19 08:05:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:48,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:49,299 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 08:05:49,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:49,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665467092] [2023-11-19 08:05:49,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665467092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:49,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:49,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:05:49,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172885528] [2023-11-19 08:05:49,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:49,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:49,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:49,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:49,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:49,310 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-11-19 08:05:49,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 08:05:49,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:49,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-11-19 08:05:49,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:49,450 INFO L124 PetriNetUnfolderBase]: 176/331 cut-off events. [2023-11-19 08:05:49,450 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-19 08:05:49,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 331 events. 176/331 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1331 event pairs, 55 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 671. Up to 191 conditions per place. [2023-11-19 08:05:49,454 INFO L140 encePairwiseOnDemand]: 214/219 looper letters, 28 selfloop transitions, 6 changer transitions 0/36 dead transitions. [2023-11-19 08:05:49,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 150 flow [2023-11-19 08:05:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:05:49,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:05:49,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 491 transitions. [2023-11-19 08:05:49,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4484018264840183 [2023-11-19 08:05:49,457 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 491 transitions. [2023-11-19 08:05:49,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 491 transitions. [2023-11-19 08:05:49,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:49,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 491 transitions. [2023-11-19 08:05:49,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 08:05:49,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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 08:05:49,463 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states 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 08:05:49,464 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 5 states and 491 transitions. [2023-11-19 08:05:49,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 150 flow [2023-11-19 08:05:49,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:49,466 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 77 flow [2023-11-19 08:05:49,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-11-19 08:05:49,467 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-19 08:05:49,467 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 77 flow [2023-11-19 08:05:49,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 08:05:49,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:49,468 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:49,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 08:05:49,468 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:49,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1154947675, now seen corresponding path program 1 times [2023-11-19 08:05:49,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:49,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354083386] [2023-11-19 08:05:49,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:49,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:49,833 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 08:05:49,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:49,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354083386] [2023-11-19 08:05:49,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354083386] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:49,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:49,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:05:49,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726820832] [2023-11-19 08:05:49,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:49,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:49,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:49,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:49,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:49,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 219 [2023-11-19 08:05:49,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:49,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:49,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 219 [2023-11-19 08:05:49,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:50,019 INFO L124 PetriNetUnfolderBase]: 133/263 cut-off events. [2023-11-19 08:05:50,020 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-19 08:05:50,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 263 events. 133/263 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1063 event pairs, 52 based on Foata normal form. 32/295 useless extension candidates. Maximal degree in co-relation 604. Up to 241 conditions per place. [2023-11-19 08:05:50,022 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 16 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2023-11-19 08:05:50,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 108 flow [2023-11-19 08:05:50,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:50,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 355 transitions. [2023-11-19 08:05:50,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4052511415525114 [2023-11-19 08:05:50,025 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 355 transitions. [2023-11-19 08:05:50,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 355 transitions. [2023-11-19 08:05:50,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:50,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 355 transitions. [2023-11-19 08:05:50,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 88.75) internal successors, (355), 4 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 08:05:50,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 08:05:50,030 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 08:05:50,030 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 77 flow. Second operand 4 states and 355 transitions. [2023-11-19 08:05:50,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 108 flow [2023-11-19 08:05:50,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 22 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:05:50,033 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 52 flow [2023-11-19 08:05:50,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-11-19 08:05:50,034 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-19 08:05:50,035 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 52 flow [2023-11-19 08:05:50,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:50,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:50,035 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:50,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 08:05:50,036 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:50,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1799790812, now seen corresponding path program 1 times [2023-11-19 08:05:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296713029] [2023-11-19 08:05:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:50,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:05:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:50,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296713029] [2023-11-19 08:05:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296713029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:50,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:05:50,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884792122] [2023-11-19 08:05:50,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:50,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:50,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:50,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-11-19 08:05:50,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 52 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 08:05:50,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:50,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-11-19 08:05:50,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:50,957 INFO L124 PetriNetUnfolderBase]: 130/259 cut-off events. [2023-11-19 08:05:50,957 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-19 08:05:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 579 conditions, 259 events. 130/259 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1023 event pairs, 22 based on Foata normal form. 14/272 useless extension candidates. Maximal degree in co-relation 572. Up to 137 conditions per place. [2023-11-19 08:05:50,959 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 23 selfloop transitions, 4 changer transitions 10/39 dead transitions. [2023-11-19 08:05:50,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 174 flow [2023-11-19 08:05:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 08:05:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-19 08:05:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 585 transitions. [2023-11-19 08:05:50,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4452054794520548 [2023-11-19 08:05:50,962 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 585 transitions. [2023-11-19 08:05:50,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 585 transitions. [2023-11-19 08:05:50,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:50,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 585 transitions. [2023-11-19 08:05:50,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.5) internal successors, (585), 6 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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 08:05:50,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states 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 08:05:50,971 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states 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 08:05:50,971 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 52 flow. Second operand 6 states and 585 transitions. [2023-11-19 08:05:50,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 174 flow [2023-11-19 08:05:50,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 164 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-11-19 08:05:50,974 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 72 flow [2023-11-19 08:05:50,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2023-11-19 08:05:50,977 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2023-11-19 08:05:50,977 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 72 flow [2023-11-19 08:05:50,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states 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 08:05:50,978 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:50,978 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:50,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 08:05:50,978 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:50,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2130363453, now seen corresponding path program 1 times [2023-11-19 08:05:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104745991] [2023-11-19 08:05:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:51,171 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 08:05:51,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:51,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104745991] [2023-11-19 08:05:51,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104745991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:51,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:51,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:05:51,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835481346] [2023-11-19 08:05:51,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:05:51,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:51,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:05:51,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:05:51,180 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-11-19 08:05:51,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:05:51,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:51,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-11-19 08:05:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:51,257 INFO L124 PetriNetUnfolderBase]: 48/118 cut-off events. [2023-11-19 08:05:51,257 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-19 08:05:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 118 events. 48/118 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 13 based on Foata normal form. 14/131 useless extension candidates. Maximal degree in co-relation 332. Up to 83 conditions per place. [2023-11-19 08:05:51,259 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 24 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2023-11-19 08:05:51,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 164 flow [2023-11-19 08:05:51,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:05:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:05:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2023-11-19 08:05:51,262 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4581430745814307 [2023-11-19 08:05:51,262 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 301 transitions. [2023-11-19 08:05:51,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 301 transitions. [2023-11-19 08:05:51,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:51,263 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 301 transitions. [2023-11-19 08:05:51,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:05:51,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 08:05:51,267 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states 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 08:05:51,268 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 72 flow. Second operand 3 states and 301 transitions. [2023-11-19 08:05:51,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 164 flow [2023-11-19 08:05:51,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 29 transitions, 155 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-19 08:05:51,270 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 84 flow [2023-11-19 08:05:51,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-11-19 08:05:51,272 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-19 08:05:51,272 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 84 flow [2023-11-19 08:05:51,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:05:51,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:51,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:51,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 08:05:51,273 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:51,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1573532663, now seen corresponding path program 1 times [2023-11-19 08:05:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:51,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519673889] [2023-11-19 08:05:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:51,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:51,448 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 08:05:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:51,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519673889] [2023-11-19 08:05:51,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519673889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:05:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244279564] [2023-11-19 08:05:51,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:51,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:05:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:51,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:05:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:05:51,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-11-19 08:05:51,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 08:05:51,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:51,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-11-19 08:05:51,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:51,524 INFO L124 PetriNetUnfolderBase]: 20/62 cut-off events. [2023-11-19 08:05:51,524 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-19 08:05:51,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 62 events. 20/62 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 150 event pairs, 9 based on Foata normal form. 9/70 useless extension candidates. Maximal degree in co-relation 192. Up to 31 conditions per place. [2023-11-19 08:05:51,525 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2023-11-19 08:05:51,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 170 flow [2023-11-19 08:05:51,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:05:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:05:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 393 transitions. [2023-11-19 08:05:51,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486301369863014 [2023-11-19 08:05:51,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 393 transitions. [2023-11-19 08:05:51,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 393 transitions. [2023-11-19 08:05:51,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:51,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 393 transitions. [2023-11-19 08:05:51,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.25) internal successors, (393), 4 states have internal predecessors, (393), 0 states have call successors, (0), 0 states 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 08:05:51,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 08:05:51,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states 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 08:05:51,533 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 84 flow. Second operand 4 states and 393 transitions. [2023-11-19 08:05:51,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 170 flow [2023-11-19 08:05:51,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 150 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-19 08:05:51,536 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 85 flow [2023-11-19 08:05:51,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-19 08:05:51,537 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 0 predicate places. [2023-11-19 08:05:51,537 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 85 flow [2023-11-19 08:05:51,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states 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 08:05:51,538 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:51,538 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 08:05:51,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-19 08:05:51,538 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:51,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:51,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1388722734, now seen corresponding path program 1 times [2023-11-19 08:05:51,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:51,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813054872] [2023-11-19 08:05:51,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:51,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:05:52,488 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 08:05:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 08:05:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813054872] [2023-11-19 08:05:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813054872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:05:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:05:52,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:05:52,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685593366] [2023-11-19 08:05:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:05:52,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 08:05:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 08:05:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 08:05:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-19 08:05:52,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 219 [2023-11-19 08:05:52,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 85 flow. Second operand has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 08:05:52,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:05:52,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 219 [2023-11-19 08:05:52,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:05:52,797 INFO L124 PetriNetUnfolderBase]: 27/88 cut-off events. [2023-11-19 08:05:52,797 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2023-11-19 08:05:52,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 88 events. 27/88 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 258 event pairs, 5 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 260. Up to 45 conditions per place. [2023-11-19 08:05:52,798 INFO L140 encePairwiseOnDemand]: 212/219 looper letters, 19 selfloop transitions, 3 changer transitions 21/44 dead transitions. [2023-11-19 08:05:52,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 268 flow [2023-11-19 08:05:52,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 08:05:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-19 08:05:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 617 transitions. [2023-11-19 08:05:52,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024787997390737 [2023-11-19 08:05:52,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 617 transitions. [2023-11-19 08:05:52,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 617 transitions. [2023-11-19 08:05:52,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:05:52,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 617 transitions. [2023-11-19 08:05:52,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 08:05:52,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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 08:05:52,808 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states 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 08:05:52,808 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 85 flow. Second operand 7 states and 617 transitions. [2023-11-19 08:05:52,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 268 flow [2023-11-19 08:05:52,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 44 transitions, 249 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-11-19 08:05:52,811 INFO L231 Difference]: Finished difference. Result has 40 places, 21 transitions, 90 flow [2023-11-19 08:05:52,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=90, PETRI_PLACES=40, PETRI_TRANSITIONS=21} [2023-11-19 08:05:52,814 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 8 predicate places. [2023-11-19 08:05:52,814 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 90 flow [2023-11-19 08:05:52,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 08:05:52,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:05:52,815 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 08:05:52,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-19 08:05:52,815 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:05:52,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:05:52,815 INFO L85 PathProgramCache]: Analyzing trace with hash -817619880, now seen corresponding path program 2 times [2023-11-19 08:05:52,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 08:05:52,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680257562] [2023-11-19 08:05:52,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:05:52,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 08:05:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:52,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:05:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:05:52,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-19 08:05:52,972 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:05:52,973 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 08:05:52,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 08:05:52,975 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 08:05:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 08:05:52,976 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 08:05:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 08:05:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 08:05:52,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 08:05:52,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 08:05:52,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 08:05:52,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-19 08:05:52,982 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:05:52,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:05:52,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:05:53,044 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:05:53,047 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:05:53,054 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 08:05:53,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:05:53 BasicIcfg [2023-11-19 08:05:53,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:05:53,076 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:05:53,077 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:05:53,077 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:05:53,077 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:05:43" (3/4) ... [2023-11-19 08:05:53,079 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:05:53,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:05:53,081 INFO L158 Benchmark]: Toolchain (without parser) took 11614.14ms. Allocated memory was 123.7MB in the beginning and 218.1MB in the end (delta: 94.4MB). Free memory was 79.0MB in the beginning and 65.3MB in the end (delta: 13.7MB). Peak memory consumption was 109.2MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,081 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:05:53,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.84ms. Allocated memory is still 123.7MB. Free memory was 79.0MB in the beginning and 56.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.31ms. Allocated memory is still 123.7MB. Free memory was 56.0MB in the beginning and 53.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,084 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 123.7MB. Free memory was 53.4MB in the beginning and 51.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,085 INFO L158 Benchmark]: RCFGBuilder took 842.04ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 51.3MB in the beginning and 94.8MB in the end (delta: -43.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,085 INFO L158 Benchmark]: TraceAbstraction took 9987.03ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 93.6MB in the beginning and 65.3MB in the end (delta: 28.2MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. [2023-11-19 08:05:53,085 INFO L158 Benchmark]: Witness Printer took 3.73ms. Allocated memory is still 218.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:05:53,091 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35ms. Allocated memory is still 123.7MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.84ms. Allocated memory is still 123.7MB. Free memory was 79.0MB in the beginning and 56.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.31ms. Allocated memory is still 123.7MB. Free memory was 56.0MB in the beginning and 53.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.43ms. Allocated memory is still 123.7MB. Free memory was 53.4MB in the beginning and 51.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 842.04ms. Allocated memory was 123.7MB in the beginning and 148.9MB in the end (delta: 25.2MB). Free memory was 51.3MB in the beginning and 94.8MB in the end (delta: -43.5MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 9987.03ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 93.6MB in the beginning and 65.3MB in the end (delta: 28.2MB). Peak memory consumption was 96.2MB. Max. memory is 16.1GB. * Witness Printer took 3.73ms. Allocated memory is still 218.1MB. Free memory is still 65.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: 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: 4.6s, 109 PlacesBefore, 32 PlacesAfterwards, 106 TransitionsBefore, 26 TransitionsAfterwards, 1684 CoEnabledTransitionPairs, 6 FixpointIterations, 44 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 111 TotalNumberOfCompositions, 3824 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2102, independent: 1970, independent conditional: 0, independent unconditional: 1970, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 938, independent: 915, independent conditional: 0, independent unconditional: 915, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2102, independent: 1055, independent conditional: 0, independent unconditional: 1055, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 938, unknown conditional: 0, unknown unconditional: 938] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={5:0}, t1604={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] 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", "rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 126 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 269 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 165 mSDsluCounter, 210 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 586 IncrementalHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 68 mSDtfsCounter, 586 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=8, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 66 ConstructedInterpolants, 0 QuantifiedInterpolants, 465 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 08:05:53,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/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 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 08:05:55,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 08:05:55,822 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-19 08:05:55,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 08:05:55,829 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 08:05:55,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 08:05:55,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 08:05:55,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 08:05:55,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 08:05:55,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 08:05:55,898 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 08:05:55,898 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 08:05:55,899 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 08:05:55,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 08:05:55,901 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 08:05:55,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 08:05:55,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 08:05:55,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 08:05:55,903 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-19 08:05:55,903 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-19 08:05:55,904 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-19 08:05:55,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 08:05:55,905 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-19 08:05:55,905 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-19 08:05:55,906 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-19 08:05:55,906 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 08:05:55,906 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 08:05:55,907 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 08:05:55,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 08:05:55,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 08:05:55,910 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 08:05:55,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:05:55,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 08:05:55,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 08:05:55,911 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-19 08:05:55,911 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-19 08:05:55,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 08:05:55,912 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 08:05:55,912 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 08:05:55,913 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-19 08:05:55,913 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 08:05:55,914 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_9236353d-294f-40d7-987f-dbc9154a6b95/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_9236353d-294f-40d7-987f-dbc9154a6b95/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 -> 4c09a669e55905e4420a018d9d131490861f4e5b62b0d12706f3ee95b5f0c90f [2023-11-19 08:05:56,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 08:05:56,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 08:05:56,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 08:05:56,333 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 08:05:56,334 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 08:05:56,336 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:05:59,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 08:06:00,050 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 08:06:00,050 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/sv-benchmarks/c/pthread-wmm/rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:06:00,068 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/4c4036ac8/a922eb01747a4d5ab97dcb4570e3dd2a/FLAGf004e1799 [2023-11-19 08:06:00,085 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/data/4c4036ac8/a922eb01747a4d5ab97dcb4570e3dd2a [2023-11-19 08:06:00,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 08:06:00,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 08:06:00,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:00,091 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 08:06:00,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 08:06:00,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c5e2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00, skipping insertion in model container [2023-11-19 08:06:00,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,151 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 08:06:00,527 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:00,552 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 08:06:00,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 08:06:00,686 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:00,687 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 08:06:00,695 INFO L206 MainTranslator]: Completed translation [2023-11-19 08:06:00,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00 WrapperNode [2023-11-19 08:06:00,696 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 08:06:00,697 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:00,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 08:06:00,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 08:06:00,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,784 INFO L138 Inliner]: procedures = 178, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2023-11-19 08:06:00,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 08:06:00,786 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 08:06:00,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 08:06:00,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 08:06:00,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,827 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,843 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,862 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 08:06:00,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 08:06:00,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 08:06:00,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 08:06:00,872 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (1/1) ... [2023-11-19 08:06:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 08:06:00,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 08:06:00,910 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 08:06:00,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 08:06:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 08:06:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 08:06:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 08:06:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 08:06:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-19 08:06:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-19 08:06:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-19 08:06:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-19 08:06:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-19 08:06:00,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-19 08:06:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 08:06:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 08:06:00,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 08:06:00,964 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 08:06:01,184 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 08:06:01,188 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 08:06:01,551 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 08:06:01,844 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 08:06:01,845 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-19 08:06:01,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:01 BoogieIcfgContainer [2023-11-19 08:06:01,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 08:06:01,857 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 08:06:01,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 08:06:01,862 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 08:06:01,862 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:06:00" (1/3) ... [2023-11-19 08:06:01,863 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37609a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:01, skipping insertion in model container [2023-11-19 08:06:01,863 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:06:00" (2/3) ... [2023-11-19 08:06:01,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37609a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:06:01, skipping insertion in model container [2023-11-19 08:06:01,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:01" (3/3) ... [2023-11-19 08:06:01,868 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-11-19 08:06:01,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 08:06:01,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-11-19 08:06:01,892 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 08:06:01,979 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-19 08:06:02,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 109 transitions, 226 flow [2023-11-19 08:06:02,133 INFO L124 PetriNetUnfolderBase]: 4/107 cut-off events. [2023-11-19 08:06:02,133 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:02,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 4/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-19 08:06:02,141 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 109 transitions, 226 flow [2023-11-19 08:06:02,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 107 transitions, 220 flow [2023-11-19 08:06:02,165 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 08:06:02,181 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 107 transitions, 220 flow [2023-11-19 08:06:02,186 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 107 transitions, 220 flow [2023-11-19 08:06:02,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 220 flow [2023-11-19 08:06:02,265 INFO L124 PetriNetUnfolderBase]: 4/107 cut-off events. [2023-11-19 08:06:02,265 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:02,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 107 events. 4/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-11-19 08:06:02,270 INFO L119 LiptonReduction]: Number of co-enabled transitions 1684 [2023-11-19 08:06:10,379 INFO L134 LiptonReduction]: Checked pairs total: 3876 [2023-11-19 08:06:10,379 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-19 08:06:10,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 08:06:10,403 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;@27a207e4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 08:06:10,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2023-11-19 08:06:10,405 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 08:06:10,405 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-19 08:06:10,405 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:10,406 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:10,406 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-19 08:06:10,407 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:10,412 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 507, now seen corresponding path program 1 times [2023-11-19 08:06:10,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:10,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039164989] [2023-11-19 08:06:10,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:10,435 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 08:06:10,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:10,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:10,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:10,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-19 08:06:10,554 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:10,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 08:06:10,559 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:10,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039164989] [2023-11-19 08:06:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039164989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:10,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-19 08:06:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510932653] [2023-11-19 08:06:10,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:10,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-19 08:06:10,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:10,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-19 08:06:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-19 08:06:10,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 224 [2023-11-19 08:06:10,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 58 flow. Second operand has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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 08:06:10,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:10,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 224 [2023-11-19 08:06:10,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:10,800 INFO L124 PetriNetUnfolderBase]: 287/505 cut-off events. [2023-11-19 08:06:10,800 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-19 08:06:10,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 505 events. 287/505 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2198 event pairs, 287 based on Foata normal form. 24/420 useless extension candidates. Maximal degree in co-relation 997. Up to 489 conditions per place. [2023-11-19 08:06:10,807 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 19 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2023-11-19 08:06:10,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 86 flow [2023-11-19 08:06:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-19 08:06:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-19 08:06:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 216 transitions. [2023-11-19 08:06:10,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-11-19 08:06:10,824 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 216 transitions. [2023-11-19 08:06:10,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 216 transitions. [2023-11-19 08:06:10,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:10,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 216 transitions. [2023-11-19 08:06:10,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 108.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 08:06:10,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 08:06:10,838 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 224.0) internal successors, (672), 3 states have internal predecessors, (672), 0 states have call successors, (0), 0 states 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 08:06:10,840 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 58 flow. Second operand 2 states and 216 transitions. [2023-11-19 08:06:10,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 86 flow [2023-11-19 08:06:10,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:10,846 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 46 flow [2023-11-19 08:06:10,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-11-19 08:06:10,851 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-19 08:06:10,852 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 46 flow [2023-11-19 08:06:10,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 96.5) internal successors, (193), 2 states have internal predecessors, (193), 0 states have call successors, (0), 0 states 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 08:06:10,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:10,853 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-19 08:06:10,862 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:11,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:11,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:11,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash 481327579, now seen corresponding path program 1 times [2023-11-19 08:06:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:11,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657608228] [2023-11-19 08:06:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:11,060 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 08:06:11,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:11,062 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:11,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:11,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 08:06:11,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:11,236 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 08:06:11,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:11,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657608228] [2023-11-19 08:06:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657608228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:11,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 08:06:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263761886] [2023-11-19 08:06:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:06:11,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:11,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:06:11,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:06:11,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 224 [2023-11-19 08:06:11,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 08:06:11,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:11,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 224 [2023-11-19 08:06:11,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:11,418 INFO L124 PetriNetUnfolderBase]: 235/437 cut-off events. [2023-11-19 08:06:11,419 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-19 08:06:11,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 437 events. 235/437 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1952 event pairs, 27 based on Foata normal form. 0/376 useless extension candidates. Maximal degree in co-relation 851. Up to 337 conditions per place. [2023-11-19 08:06:11,423 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 22 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-11-19 08:06:11,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 120 flow [2023-11-19 08:06:11,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:06:11,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:06:11,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-19 08:06:11,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46726190476190477 [2023-11-19 08:06:11,427 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-19 08:06:11,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-19 08:06:11,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:11,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-19 08:06:11,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 08:06:11,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 08:06:11,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 08:06:11,433 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 46 flow. Second operand 3 states and 314 transitions. [2023-11-19 08:06:11,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 120 flow [2023-11-19 08:06:11,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-19 08:06:11,435 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 44 flow [2023-11-19 08:06:11,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-11-19 08:06:11,436 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -4 predicate places. [2023-11-19 08:06:11,436 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 44 flow [2023-11-19 08:06:11,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states 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 08:06:11,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:11,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:11,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:11,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:11,641 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:11,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:11,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1662926719, now seen corresponding path program 1 times [2023-11-19 08:06:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:11,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407923903] [2023-11-19 08:06:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:11,643 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 08:06:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:11,644 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:11,654 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (4)] Waiting until timeout for monitored process [2023-11-19 08:06:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:11,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-19 08:06:11,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:11,807 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 08:06:11,808 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:11,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:11,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407923903] [2023-11-19 08:06:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407923903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:06:11,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505062459] [2023-11-19 08:06:11,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:11,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 08:06:11,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:11,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 08:06:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 08:06:11,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-11-19 08:06:11,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:06:11,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:11,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-11-19 08:06:11,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:11,917 INFO L124 PetriNetUnfolderBase]: 53/126 cut-off events. [2023-11-19 08:06:11,917 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-19 08:06:11,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 126 events. 53/126 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 409 event pairs, 15 based on Foata normal form. 12/129 useless extension candidates. Maximal degree in co-relation 268. Up to 94 conditions per place. [2023-11-19 08:06:11,919 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 22 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2023-11-19 08:06:11,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 27 transitions, 116 flow [2023-11-19 08:06:11,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 08:06:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 08:06:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 305 transitions. [2023-11-19 08:06:11,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538690476190476 [2023-11-19 08:06:11,922 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 305 transitions. [2023-11-19 08:06:11,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 305 transitions. [2023-11-19 08:06:11,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:11,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 305 transitions. [2023-11-19 08:06:11,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states 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 08:06:11,927 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 08:06:11,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states 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 08:06:11,929 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 44 flow. Second operand 3 states and 305 transitions. [2023-11-19 08:06:11,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 27 transitions, 116 flow [2023-11-19 08:06:11,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:11,931 INFO L231 Difference]: Finished difference. Result has 27 places, 20 transitions, 59 flow [2023-11-19 08:06:11,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=27, PETRI_TRANSITIONS=20} [2023-11-19 08:06:11,932 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -5 predicate places. [2023-11-19 08:06:11,932 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 20 transitions, 59 flow [2023-11-19 08:06:11,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states 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 08:06:11,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:11,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 08:06:11,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (4)] Ended with exit code 0 [2023-11-19 08:06:12,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:12,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:12,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1228816196, now seen corresponding path program 1 times [2023-11-19 08:06:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264353360] [2023-11-19 08:06:12,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:12,138 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 08:06:12,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:12,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:12,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (5)] Waiting until timeout for monitored process [2023-11-19 08:06:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:12,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-19 08:06:12,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:12,328 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 08:06:12,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:12,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:12,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264353360] [2023-11-19 08:06:12,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264353360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:12,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:12,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 08:06:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004452597] [2023-11-19 08:06:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:12,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:06:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:06:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:06:12,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 224 [2023-11-19 08:06:12,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 59 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 08:06:12,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:12,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 224 [2023-11-19 08:06:12,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:12,479 INFO L124 PetriNetUnfolderBase]: 18/56 cut-off events. [2023-11-19 08:06:12,480 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-19 08:06:12,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 56 events. 18/56 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 10 based on Foata normal form. 7/61 useless extension candidates. Maximal degree in co-relation 140. Up to 29 conditions per place. [2023-11-19 08:06:12,481 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 20 selfloop transitions, 5 changer transitions 0/27 dead transitions. [2023-11-19 08:06:12,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 125 flow [2023-11-19 08:06:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:06:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:06:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-11-19 08:06:12,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44419642857142855 [2023-11-19 08:06:12,485 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-11-19 08:06:12,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-11-19 08:06:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:12,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-11-19 08:06:12,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 08:06:12,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 08:06:12,495 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 08:06:12,496 INFO L175 Difference]: Start difference. First operand has 27 places, 20 transitions, 59 flow. Second operand 4 states and 398 transitions. [2023-11-19 08:06:12,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 125 flow [2023-11-19 08:06:12,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 122 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 08:06:12,499 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 72 flow [2023-11-19 08:06:12,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-11-19 08:06:12,502 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 08:06:12,508 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 72 flow [2023-11-19 08:06:12,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states 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 08:06:12,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:12,510 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 08:06:12,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (5)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:12,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:12,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:12,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:12,715 INFO L85 PathProgramCache]: Analyzing trace with hash 132182827, now seen corresponding path program 1 times [2023-11-19 08:06:12,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:12,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210883265] [2023-11-19 08:06:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:12,716 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 08:06:12,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:12,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:12,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (6)] Waiting until timeout for monitored process [2023-11-19 08:06:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:12,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-19 08:06:12,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:13,221 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 08:06:13,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:13,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:13,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210883265] [2023-11-19 08:06:13,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210883265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 08:06:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653871745] [2023-11-19 08:06:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:13,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 08:06:13,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:13,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 08:06:13,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 08:06:13,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 224 [2023-11-19 08:06:13,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 08:06:13,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:13,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 224 [2023-11-19 08:06:13,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:13,450 INFO L124 PetriNetUnfolderBase]: 18/55 cut-off events. [2023-11-19 08:06:13,450 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-19 08:06:13,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 55 events. 18/55 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 9 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 144. Up to 46 conditions per place. [2023-11-19 08:06:13,451 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 18 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2023-11-19 08:06:13,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 121 flow [2023-11-19 08:06:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 08:06:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 08:06:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 351 transitions. [2023-11-19 08:06:13,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39174107142857145 [2023-11-19 08:06:13,457 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 351 transitions. [2023-11-19 08:06:13,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 351 transitions. [2023-11-19 08:06:13,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:13,458 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 351 transitions. [2023-11-19 08:06:13,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 87.75) internal successors, (351), 4 states have internal predecessors, (351), 0 states have call successors, (0), 0 states 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 08:06:13,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 08:06:13,463 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 224.0) internal successors, (1120), 5 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states 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 08:06:13,463 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 72 flow. Second operand 4 states and 351 transitions. [2023-11-19 08:06:13,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 121 flow [2023-11-19 08:06:13,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 22 transitions, 110 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:13,468 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 64 flow [2023-11-19 08:06:13,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=64, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2023-11-19 08:06:13,471 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2023-11-19 08:06:13,472 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 19 transitions, 64 flow [2023-11-19 08:06:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states 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 08:06:13,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:13,473 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 08:06:13,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (6)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:13,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:13,677 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:13,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:13,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1142158195, now seen corresponding path program 1 times [2023-11-19 08:06:13,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:13,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611337835] [2023-11-19 08:06:13,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 08:06:13,679 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 08:06:13,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:13,680 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:13,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (7)] Waiting until timeout for monitored process [2023-11-19 08:06:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 08:06:13,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 08:06:13,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:14,262 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 08:06:14,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:14,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:14,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611337835] [2023-11-19 08:06:14,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611337835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:14,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:14,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 08:06:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606294714] [2023-11-19 08:06:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:14,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 08:06:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 08:06:14,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 08:06:14,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 224 [2023-11-19 08:06:14,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 19 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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 08:06:14,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:14,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 224 [2023-11-19 08:06:14,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:14,475 INFO L124 PetriNetUnfolderBase]: 24/81 cut-off events. [2023-11-19 08:06:14,475 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-19 08:06:14,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 81 events. 24/81 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 240 event pairs, 0 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 206. Up to 46 conditions per place. [2023-11-19 08:06:14,476 INFO L140 encePairwiseOnDemand]: 220/224 looper letters, 19 selfloop transitions, 1 changer transitions 14/35 dead transitions. [2023-11-19 08:06:14,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 188 flow [2023-11-19 08:06:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:14,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 481 transitions. [2023-11-19 08:06:14,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4294642857142857 [2023-11-19 08:06:14,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 481 transitions. [2023-11-19 08:06:14,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 481 transitions. [2023-11-19 08:06:14,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:14,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 481 transitions. [2023-11-19 08:06:14,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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 08:06:14,488 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 08:06:14,491 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 08:06:14,491 INFO L175 Difference]: Start difference. First operand has 30 places, 19 transitions, 64 flow. Second operand 5 states and 481 transitions. [2023-11-19 08:06:14,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 188 flow [2023-11-19 08:06:14,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-19 08:06:14,493 INFO L231 Difference]: Finished difference. Result has 35 places, 19 transitions, 70 flow [2023-11-19 08:06:14,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=35, PETRI_TRANSITIONS=19} [2023-11-19 08:06:14,497 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-11-19 08:06:14,500 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 19 transitions, 70 flow [2023-11-19 08:06:14,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.2) internal successors, (466), 5 states have internal predecessors, (466), 0 states have call successors, (0), 0 states 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 08:06:14,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:14,501 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 08:06:14,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (7)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:14,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:14,704 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:14,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash 777211829, now seen corresponding path program 2 times [2023-11-19 08:06:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1248557845] [2023-11-19 08:06:14,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 08:06:14,706 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 08:06:14,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:14,708 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:14,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (8)] Waiting until timeout for monitored process [2023-11-19 08:06:14,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-19 08:06:14,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 08:06:14,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-19 08:06:14,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 08:06:15,051 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 08:06:15,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-19 08:06:15,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-19 08:06:15,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1248557845] [2023-11-19 08:06:15,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1248557845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 08:06:15,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 08:06:15,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 08:06:15,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605698779] [2023-11-19 08:06:15,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 08:06:15,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 08:06:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-19 08:06:15,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 08:06:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 08:06:15,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 224 [2023-11-19 08:06:15,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 19 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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 08:06:15,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 08:06:15,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 224 [2023-11-19 08:06:15,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 08:06:15,266 INFO L124 PetriNetUnfolderBase]: 25/79 cut-off events. [2023-11-19 08:06:15,266 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-19 08:06:15,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 79 events. 25/79 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 197 event pairs, 6 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 223. Up to 41 conditions per place. [2023-11-19 08:06:15,267 INFO L140 encePairwiseOnDemand]: 219/224 looper letters, 17 selfloop transitions, 3 changer transitions 11/32 dead transitions. [2023-11-19 08:06:15,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 179 flow [2023-11-19 08:06:15,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 08:06:15,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 08:06:15,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-11-19 08:06:15,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43125 [2023-11-19 08:06:15,272 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-11-19 08:06:15,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-11-19 08:06:15,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 08:06:15,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-11-19 08:06:15,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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 08:06:15,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 08:06:15,278 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 224.0) internal successors, (1344), 6 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states 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 08:06:15,278 INFO L175 Difference]: Start difference. First operand has 35 places, 19 transitions, 70 flow. Second operand 5 states and 483 transitions. [2023-11-19 08:06:15,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 179 flow [2023-11-19 08:06:15,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 32 transitions, 172 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-19 08:06:15,280 INFO L231 Difference]: Finished difference. Result has 36 places, 19 transitions, 77 flow [2023-11-19 08:06:15,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=36, PETRI_TRANSITIONS=19} [2023-11-19 08:06:15,281 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-19 08:06:15,282 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 19 transitions, 77 flow [2023-11-19 08:06:15,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.28571428571429) internal successors, (653), 7 states have internal predecessors, (653), 0 states have call successors, (0), 0 states 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 08:06:15,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 08:06:15,282 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 08:06:15,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (8)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:15,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:15,486 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 7 more)] === [2023-11-19 08:06:15,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 08:06:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash 801632067, now seen corresponding path program 3 times [2023-11-19 08:06:15,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-19 08:06:15,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908597168] [2023-11-19 08:06:15,488 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 08:06:15,488 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 08:06:15,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/mathsat [2023-11-19 08:06:15,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:15,499 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (9)] Waiting until timeout for monitored process [2023-11-19 08:06:15,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-19 08:06:15,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-19 08:06:15,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-19 08:06:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-19 08:06:15,781 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-19 08:06:15,782 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-19 08:06:15,783 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (9 of 10 remaining) [2023-11-19 08:06:15,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (8 of 10 remaining) [2023-11-19 08:06:15,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 10 remaining) [2023-11-19 08:06:15,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 10 remaining) [2023-11-19 08:06:15,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 10 remaining) [2023-11-19 08:06:15,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 10 remaining) [2023-11-19 08:06:15,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (3 of 10 remaining) [2023-11-19 08:06:15,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 10 remaining) [2023-11-19 08:06:15,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 10 remaining) [2023-11-19 08:06:15,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 10 remaining) [2023-11-19 08:06:15,804 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 (9)] Forceful destruction successful, exit code 0 [2023-11-19 08:06:15,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/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 08:06:15,994 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-11-19 08:06:16,011 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-19 08:06:16,011 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-19 08:06:16,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-19 08:06:16,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-19 08:06:16,100 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-19 08:06:16,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:06:16 BasicIcfg [2023-11-19 08:06:16,117 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-19 08:06:16,118 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-19 08:06:16,118 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-19 08:06:16,118 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-19 08:06:16,119 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:06:01" (3/4) ... [2023-11-19 08:06:16,121 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-19 08:06:16,122 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-19 08:06:16,123 INFO L158 Benchmark]: Toolchain (without parser) took 16033.31ms. Allocated memory was 81.8MB in the beginning and 138.4MB in the end (delta: 56.6MB). Free memory was 38.6MB in the beginning and 53.5MB in the end (delta: -14.9MB). Peak memory consumption was 44.5MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,123 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 81.8MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:16,123 INFO L158 Benchmark]: CACSL2BoogieTranslator took 605.15ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 44.2MB in the end (delta: -5.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,124 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.05ms. Allocated memory is still 81.8MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,124 INFO L158 Benchmark]: Boogie Preprocessor took 76.42ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,125 INFO L158 Benchmark]: RCFGBuilder took 988.34ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 39.4MB in the beginning and 89.5MB in the end (delta: -50.1MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,125 INFO L158 Benchmark]: TraceAbstraction took 14260.48ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 88.2MB in the beginning and 53.5MB in the end (delta: 34.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2023-11-19 08:06:16,128 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 138.4MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-19 08:06:16,132 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.33ms. Allocated memory is still 81.8MB. Free memory is still 59.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 605.15ms. Allocated memory is still 81.8MB. Free memory was 38.3MB in the beginning and 44.2MB in the end (delta: -5.9MB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.05ms. Allocated memory is still 81.8MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.42ms. Allocated memory is still 81.8MB. Free memory was 41.5MB in the beginning and 39.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 988.34ms. Allocated memory was 81.8MB in the beginning and 115.3MB in the end (delta: 33.6MB). Free memory was 39.4MB in the beginning and 89.5MB in the end (delta: -50.1MB). Peak memory consumption was 14.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14260.48ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 88.2MB in the beginning and 53.5MB in the end (delta: 34.7MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 138.4MB. Free memory is still 53.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 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: 8.2s, 110 PlacesBefore, 32 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1684 CoEnabledTransitionPairs, 6 FixpointIterations, 47 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 115 TotalNumberOfCompositions, 3876 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2128, independent: 1996, independent conditional: 0, independent unconditional: 1996, dependent: 132, dependent conditional: 0, dependent unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 933, independent: 909, independent conditional: 0, independent unconditional: 909, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2128, independent: 1087, independent conditional: 0, independent unconditional: 1087, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 933, unknown conditional: 0, unknown unconditional: 933] , Statistics on independence cache: Total cache size (in pairs): 74, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L734] 0 int z = 0; [L735] 0 _Bool weak$$choice0; [L736] 0 _Bool weak$$choice2; [L802] 0 pthread_t t1603; [L803] FCALL, FORK 0 pthread_create(&t1603, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L804] 0 pthread_t t1604; [L805] FCALL, FORK 0 pthread_create(&t1604, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1603={3:0}, t1604={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 2 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L764] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L764] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L771] 2 z = 1 [L774] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L777] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L746] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L780] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L781] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L782] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L783] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L784] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L807] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L809] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L809] RET 0 assume_abort_if_not(main$tmp_guard0) [L811] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L812] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L813] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L814] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L815] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1603={3:0}, t1604={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=1] [L818] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L819] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L820] 0 y$flush_delayed = weak$$choice2 [L821] 0 y$mem_tmp = y [L822] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L823] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L824] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L825] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L826] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L828] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L829] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L830] 0 y = y$flush_delayed ? y$mem_tmp : y [L831] 0 y$flush_delayed = (_Bool)0 [L833] 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", "rfi001_power.opt_pso.opt_rmo.opt_tso.oepc_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, 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: 800]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 805]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 127 locations, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.0s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 157 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 104 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 445 IncrementalHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 21 mSDtfsCounter, 445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, InterpolantAutomatonStates: 26, 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, 1.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 595 SizeOfPredicates, 4 NumberOfNonLiveVariables, 687 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 08:06:16,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9236353d-294f-40d7-987f-dbc9154a6b95/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample