./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b 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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:31:58,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:31:59,018 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:31:59,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:31:59,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:31:59,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:31:59,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:31:59,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:31:59,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:31:59,081 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:31:59,082 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:31:59,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:31:59,083 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:31:59,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:31:59,086 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:31:59,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:31:59,087 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:31:59,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:31:59,088 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:31:59,089 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:31:59,089 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:31:59,090 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:31:59,092 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:31:59,092 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:31:59,093 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:31:59,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:31:59,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:31:59,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:31:59,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:31:59,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:31:59,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:31:59,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:31:59,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:31:59,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:31:59,099 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:31:59,099 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:31:59,099 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:31:59,100 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:31:59,100 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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2023-11-06 22:31:59,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:31:59,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:31:59,441 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:31:59,443 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:31:59,444 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:31:59,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:02,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:32:03,167 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:32:03,167 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:03,189 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/c1c1fae3e/91828218ce79496db76ca3409d097366/FLAGb7220027e [2023-11-06 22:32:03,205 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/c1c1fae3e/91828218ce79496db76ca3409d097366 [2023-11-06 22:32:03,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:32:03,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:32:03,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:03,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:32:03,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:32:03,224 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:03" (1/1) ... [2023-11-06 22:32:03,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50af14f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:03, skipping insertion in model container [2023-11-06 22:32:03,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:03" (1/1) ... [2023-11-06 22:32:03,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:32:03,892 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:03,913 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:32:04,034 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:04,096 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:32:04,096 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:32:04,105 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:32:04,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04 WrapperNode [2023-11-06 22:32:04,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:04,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:04,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:32:04,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:32:04,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,241 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-06 22:32:04,242 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:04,243 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:32:04,243 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:32:04,243 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:32:04,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,339 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:32:04,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:32:04,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:32:04,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:32:04,346 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (1/1) ... [2023-11-06 22:32:04,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:04,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:04,399 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:32:04,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:32:04,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:32:04,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:32:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:32:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:32:04,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:32:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:32:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:32:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:32:04,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:32:04,444 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:32:04,445 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:32:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:32:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:32:04,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:32:04,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:32:04,449 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:32:04,605 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:32:04,607 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:32:05,037 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:32:05,222 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:32:05,222 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:32:05,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:05 BoogieIcfgContainer [2023-11-06 22:32:05,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:32:05,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:32:05,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:32:05,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:32:05,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:32:03" (1/3) ... [2023-11-06 22:32:05,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5141ecc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:05, skipping insertion in model container [2023-11-06 22:32:05,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:04" (2/3) ... [2023-11-06 22:32:05,237 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5141ecc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:05, skipping insertion in model container [2023-11-06 22:32:05,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:05" (3/3) ... [2023-11-06 22:32:05,240 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:05,262 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:32:05,262 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:32:05,262 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:32:05,348 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:32:05,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 258 flow [2023-11-06 22:32:05,515 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-11-06 22:32:05,515 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:05,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:32:05,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 123 transitions, 258 flow [2023-11-06 22:32:05,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 120 transitions, 249 flow [2023-11-06 22:32:05,538 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:32:05,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 120 transitions, 249 flow [2023-11-06 22:32:05,562 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 120 transitions, 249 flow [2023-11-06 22:32:05,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 249 flow [2023-11-06 22:32:05,645 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-11-06 22:32:05,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:05,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:32:05,650 INFO L119 LiptonReduction]: Number of co-enabled transitions 2356 [2023-11-06 22:32:11,432 INFO L134 LiptonReduction]: Checked pairs total: 5310 [2023-11-06 22:32:11,434 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-11-06 22:32:11,463 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:32:11,478 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;@1570e34b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:32:11,478 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:32:11,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:32:11,481 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:32:11,482 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:11,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:11,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:32:11,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:11,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:11,490 INFO L85 PathProgramCache]: Analyzing trace with hash 543, now seen corresponding path program 1 times [2023-11-06 22:32:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:11,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071785595] [2023-11-06 22:32:11,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:11,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:11,640 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-06 22:32:11,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:11,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071785595] [2023-11-06 22:32:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071785595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:11,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:32:11,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674078729] [2023-11-06 22:32:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:32:11,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:32:11,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:32:11,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2023-11-06 22:32:11,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:11,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:11,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2023-11-06 22:32:11,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:12,144 INFO L124 PetriNetUnfolderBase]: 910/1374 cut-off events. [2023-11-06 22:32:12,145 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 22:32:12,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 1374 events. 910/1374 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6379 event pairs, 910 based on Foata normal form. 0/1154 useless extension candidates. Maximal degree in co-relation 2761. Up to 1362 conditions per place. [2023-11-06 22:32:12,164 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 22:32:12,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2023-11-06 22:32:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:32:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:32:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-11-06 22:32:12,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2023-11-06 22:32:12,183 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-11-06 22:32:12,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-11-06 22:32:12,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:12,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-11-06 22:32:12,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:12,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:12,201 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:12,203 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 248 transitions. [2023-11-06 22:32:12,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2023-11-06 22:32:12,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:32:12,209 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 22:32:12,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 22:32:12,216 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 22:32:12,217 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 22:32:12,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:12,218 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:12,218 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:12,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:32:12,218 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:12,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1150411457, now seen corresponding path program 1 times [2023-11-06 22:32:12,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:12,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087505341] [2023-11-06 22:32:12,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:12,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:12,750 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-06 22:32:12,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:12,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087505341] [2023-11-06 22:32:12,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087505341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:12,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:12,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:32:12,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453966037] [2023-11-06 22:32:12,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:12,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:32:12,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:12,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:32:12,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:32:12,765 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2023-11-06 22:32:12,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:12,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:12,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2023-11-06 22:32:12,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:13,081 INFO L124 PetriNetUnfolderBase]: 719/1174 cut-off events. [2023-11-06 22:32:13,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:13,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 1174 events. 719/1174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6030 event pairs, 146 based on Foata normal form. 0/1074 useless extension candidates. Maximal degree in co-relation 2292. Up to 826 conditions per place. [2023-11-06 22:32:13,093 INFO L140 encePairwiseOnDemand]: 235/238 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2023-11-06 22:32:13,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 136 flow [2023-11-06 22:32:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:32:13,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:32:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-11-06 22:32:13,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028011204481793 [2023-11-06 22:32:13,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-11-06 22:32:13,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-11-06 22:32:13,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:13,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-11-06 22:32:13,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,114 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 359 transitions. [2023-11-06 22:32:13,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 136 flow [2023-11-06 22:32:13,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:32:13,119 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:32:13,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:32:13,121 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 22:32:13,121 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:32:13,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:13,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:13,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:32:13,132 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:13,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1932527454, now seen corresponding path program 1 times [2023-11-06 22:32:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534815803] [2023-11-06 22:32:13,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:13,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-06 22:32:13,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:13,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534815803] [2023-11-06 22:32:13,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534815803] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:13,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:13,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:32:13,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464822440] [2023-11-06 22:32:13,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:13,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:32:13,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:13,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:32:13,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:32:13,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-11-06 22:32:13,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:13,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-11-06 22:32:13,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:13,764 INFO L124 PetriNetUnfolderBase]: 419/705 cut-off events. [2023-11-06 22:32:13,765 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-11-06 22:32:13,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1492 conditions, 705 events. 419/705 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3261 event pairs, 67 based on Foata normal form. 48/714 useless extension candidates. Maximal degree in co-relation 1488. Up to 401 conditions per place. [2023-11-06 22:32:13,772 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 34 selfloop transitions, 5 changer transitions 1/43 dead transitions. [2023-11-06 22:32:13,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 43 transitions, 184 flow [2023-11-06 22:32:13,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:32:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:32:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 458 transitions. [2023-11-06 22:32:13,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4810924369747899 [2023-11-06 22:32:13,776 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 458 transitions. [2023-11-06 22:32:13,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 458 transitions. [2023-11-06 22:32:13,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:13,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 458 transitions. [2023-11-06 22:32:13,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,784 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,785 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 458 transitions. [2023-11-06 22:32:13,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 43 transitions, 184 flow [2023-11-06 22:32:13,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 43 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:32:13,788 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 84 flow [2023-11-06 22:32:13,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-11-06 22:32:13,790 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2023-11-06 22:32:13,790 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 84 flow [2023-11-06 22:32:13,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:13,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:13,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:13,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:32:13,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:13,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:13,793 INFO L85 PathProgramCache]: Analyzing trace with hash -71589165, now seen corresponding path program 1 times [2023-11-06 22:32:13,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:13,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854290614] [2023-11-06 22:32:13,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:13,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:14,188 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-06 22:32:14,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:14,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854290614] [2023-11-06 22:32:14,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854290614] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:14,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:14,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:32:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025772096] [2023-11-06 22:32:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:14,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:14,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:14,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:14,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-11-06 22:32:14,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:14,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-11-06 22:32:14,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:14,467 INFO L124 PetriNetUnfolderBase]: 176/339 cut-off events. [2023-11-06 22:32:14,467 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-11-06 22:32:14,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 339 events. 176/339 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1366 event pairs, 32 based on Foata normal form. 30/357 useless extension candidates. Maximal degree in co-relation 903. Up to 124 conditions per place. [2023-11-06 22:32:14,472 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 41 selfloop transitions, 8 changer transitions 1/53 dead transitions. [2023-11-06 22:32:14,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 53 transitions, 261 flow [2023-11-06 22:32:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:14,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:14,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 572 transitions. [2023-11-06 22:32:14,476 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48067226890756304 [2023-11-06 22:32:14,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 572 transitions. [2023-11-06 22:32:14,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 572 transitions. [2023-11-06 22:32:14,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:14,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 572 transitions. [2023-11-06 22:32:14,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,485 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,486 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 84 flow. Second operand 5 states and 572 transitions. [2023-11-06 22:32:14,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 53 transitions, 261 flow [2023-11-06 22:32:14,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 53 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:32:14,492 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 124 flow [2023-11-06 22:32:14,493 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=124, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-06 22:32:14,495 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-06 22:32:14,495 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 124 flow [2023-11-06 22:32:14,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:14,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:14,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:32:14,497 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:14,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1309167054, now seen corresponding path program 1 times [2023-11-06 22:32:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282860122] [2023-11-06 22:32:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:14,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:14,846 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-06 22:32:14,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:14,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282860122] [2023-11-06 22:32:14,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282860122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:14,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:32:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050777252] [2023-11-06 22:32:14,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:14,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:32:14,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:32:14,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:32:14,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 238 [2023-11-06 22:32:14,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:14,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:14,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 238 [2023-11-06 22:32:14,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:15,091 INFO L124 PetriNetUnfolderBase]: 102/204 cut-off events. [2023-11-06 22:32:15,091 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2023-11-06 22:32:15,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 204 events. 102/204 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 702 event pairs, 32 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 625. Up to 77 conditions per place. [2023-11-06 22:32:15,094 INFO L140 encePairwiseOnDemand]: 232/238 looper letters, 30 selfloop transitions, 11 changer transitions 1/45 dead transitions. [2023-11-06 22:32:15,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 252 flow [2023-11-06 22:32:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:32:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:32:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2023-11-06 22:32:15,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4677871148459384 [2023-11-06 22:32:15,098 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 668 transitions. [2023-11-06 22:32:15,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 668 transitions. [2023-11-06 22:32:15,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:15,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 668 transitions. [2023-11-06 22:32:15,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:15,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:15,108 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:15,109 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 124 flow. Second operand 6 states and 668 transitions. [2023-11-06 22:32:15,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 252 flow [2023-11-06 22:32:15,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 227 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-06 22:32:15,114 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 138 flow [2023-11-06 22:32:15,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-11-06 22:32:15,115 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-11-06 22:32:15,115 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 138 flow [2023-11-06 22:32:15,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:15,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:15,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:15,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:32:15,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:15,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:15,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1380845421, now seen corresponding path program 1 times [2023-11-06 22:32:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:15,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397136246] [2023-11-06 22:32:15,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:15,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:16,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:16,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:16,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397136246] [2023-11-06 22:32:16,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397136246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:16,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:16,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:32:16,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315595940] [2023-11-06 22:32:16,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:16,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:16,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:16,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:16,464 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-11-06 22:32:16,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:16,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:16,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-11-06 22:32:16,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:16,771 INFO L124 PetriNetUnfolderBase]: 221/423 cut-off events. [2023-11-06 22:32:16,772 INFO L125 PetriNetUnfolderBase]: For 456/456 co-relation queries the response was YES. [2023-11-06 22:32:16,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 423 events. 221/423 cut-off events. For 456/456 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1853 event pairs, 28 based on Foata normal form. 0/422 useless extension candidates. Maximal degree in co-relation 1269. Up to 232 conditions per place. [2023-11-06 22:32:16,777 INFO L140 encePairwiseOnDemand]: 227/238 looper letters, 51 selfloop transitions, 12 changer transitions 0/64 dead transitions. [2023-11-06 22:32:16,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 64 transitions, 440 flow [2023-11-06 22:32:16,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:16,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:16,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2023-11-06 22:32:16,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.453781512605042 [2023-11-06 22:32:16,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2023-11-06 22:32:16,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2023-11-06 22:32:16,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:16,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2023-11-06 22:32:16,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:16,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:16,790 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:16,790 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 138 flow. Second operand 5 states and 540 transitions. [2023-11-06 22:32:16,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 64 transitions, 440 flow [2023-11-06 22:32:16,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 64 transitions, 310 flow, removed 20 selfloop flow, removed 9 redundant places. [2023-11-06 22:32:16,801 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 166 flow [2023-11-06 22:32:16,802 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2023-11-06 22:32:16,802 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-11-06 22:32:16,808 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 166 flow [2023-11-06 22:32:16,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:16,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:16,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:16,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:32:16,810 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:16,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:16,810 INFO L85 PathProgramCache]: Analyzing trace with hash 2058600623, now seen corresponding path program 1 times [2023-11-06 22:32:16,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:16,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491714701] [2023-11-06 22:32:16,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:16,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:18,167 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-06 22:32:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491714701] [2023-11-06 22:32:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491714701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:32:18,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798384378] [2023-11-06 22:32:18,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:18,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:32:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:18,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:32:18,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:32:18,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 238 [2023-11-06 22:32:18,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 166 flow. Second operand has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:18,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:18,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 238 [2023-11-06 22:32:18,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:18,958 INFO L124 PetriNetUnfolderBase]: 270/505 cut-off events. [2023-11-06 22:32:18,958 INFO L125 PetriNetUnfolderBase]: For 268/283 co-relation queries the response was YES. [2023-11-06 22:32:18,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1526 conditions, 505 events. 270/505 cut-off events. For 268/283 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2374 event pairs, 2 based on Foata normal form. 8/513 useless extension candidates. Maximal degree in co-relation 1519. Up to 206 conditions per place. [2023-11-06 22:32:18,962 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 53 selfloop transitions, 10 changer transitions 12/79 dead transitions. [2023-11-06 22:32:18,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 79 transitions, 494 flow [2023-11-06 22:32:18,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:32:18,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:32:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 757 transitions. [2023-11-06 22:32:18,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39758403361344535 [2023-11-06 22:32:18,967 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 757 transitions. [2023-11-06 22:32:18,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 757 transitions. [2023-11-06 22:32:18,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:18,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 757 transitions. [2023-11-06 22:32:18,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.625) internal successors, (757), 8 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:18,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:18,976 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:18,976 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 166 flow. Second operand 8 states and 757 transitions. [2023-11-06 22:32:18,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 79 transitions, 494 flow [2023-11-06 22:32:18,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 494 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:32:18,980 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 179 flow [2023-11-06 22:32:18,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2023-11-06 22:32:18,981 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 22:32:18,981 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 179 flow [2023-11-06 22:32:18,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.375) internal successors, (731), 8 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:18,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:18,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:18,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:32:18,983 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:18,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:18,983 INFO L85 PathProgramCache]: Analyzing trace with hash -292636327, now seen corresponding path program 2 times [2023-11-06 22:32:18,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:18,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419864740] [2023-11-06 22:32:18,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:18,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:19,840 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-06 22:32:19,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419864740] [2023-11-06 22:32:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419864740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:19,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:19,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:32:19,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120285892] [2023-11-06 22:32:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:19,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:19,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:19,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2023-11-06 22:32:19,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:19,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:19,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2023-11-06 22:32:19,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:20,147 INFO L124 PetriNetUnfolderBase]: 147/307 cut-off events. [2023-11-06 22:32:20,148 INFO L125 PetriNetUnfolderBase]: For 312/322 co-relation queries the response was YES. [2023-11-06 22:32:20,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 307 events. 147/307 cut-off events. For 312/322 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1182 event pairs, 20 based on Foata normal form. 11/318 useless extension candidates. Maximal degree in co-relation 1069. Up to 141 conditions per place. [2023-11-06 22:32:20,150 INFO L140 encePairwiseOnDemand]: 229/238 looper letters, 28 selfloop transitions, 8 changer transitions 29/67 dead transitions. [2023-11-06 22:32:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 447 flow [2023-11-06 22:32:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2023-11-06 22:32:20,154 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44789915966386556 [2023-11-06 22:32:20,154 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2023-11-06 22:32:20,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2023-11-06 22:32:20,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:20,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2023-11-06 22:32:20,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:20,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:20,161 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:20,161 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 179 flow. Second operand 5 states and 533 transitions. [2023-11-06 22:32:20,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 447 flow [2023-11-06 22:32:20,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 422 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-11-06 22:32:20,165 INFO L231 Difference]: Finished difference. Result has 48 places, 33 transitions, 179 flow [2023-11-06 22:32:20,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=48, PETRI_TRANSITIONS=33} [2023-11-06 22:32:20,166 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2023-11-06 22:32:20,167 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 33 transitions, 179 flow [2023-11-06 22:32:20,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:20,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:20,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:20,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:32:20,168 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:20,168 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1302694539, now seen corresponding path program 3 times [2023-11-06 22:32:20,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:20,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327330174] [2023-11-06 22:32:20,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:20,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:21,535 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-06 22:32:21,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:32:21,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327330174] [2023-11-06 22:32:21,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327330174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:21,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:21,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:32:21,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018510254] [2023-11-06 22:32:21,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:21,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 22:32:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:32:21,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 22:32:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:32:21,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 238 [2023-11-06 22:32:21,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 33 transitions, 179 flow. Second operand has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:21,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:21,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 238 [2023-11-06 22:32:21,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:22,026 INFO L124 PetriNetUnfolderBase]: 49/127 cut-off events. [2023-11-06 22:32:22,026 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-06 22:32:22,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 127 events. 49/127 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 354 event pairs, 10 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 437. Up to 55 conditions per place. [2023-11-06 22:32:22,028 INFO L140 encePairwiseOnDemand]: 231/238 looper letters, 37 selfloop transitions, 4 changer transitions 24/67 dead transitions. [2023-11-06 22:32:22,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 67 transitions, 443 flow [2023-11-06 22:32:22,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:32:22,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:32:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 866 transitions. [2023-11-06 22:32:22,033 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45483193277310924 [2023-11-06 22:32:22,033 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 866 transitions. [2023-11-06 22:32:22,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 866 transitions. [2023-11-06 22:32:22,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:22,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 866 transitions. [2023-11-06 22:32:22,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:22,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:22,044 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:22,044 INFO L175 Difference]: Start difference. First operand has 48 places, 33 transitions, 179 flow. Second operand 8 states and 866 transitions. [2023-11-06 22:32:22,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 67 transitions, 443 flow [2023-11-06 22:32:22,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 396 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-06 22:32:22,048 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 136 flow [2023-11-06 22:32:22,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=136, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2023-11-06 22:32:22,049 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-11-06 22:32:22,049 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 136 flow [2023-11-06 22:32:22,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.11111111111111) internal successors, (946), 9 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:22,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:22,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:22,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:32:22,051 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:22,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:22,052 INFO L85 PathProgramCache]: Analyzing trace with hash 982457113, now seen corresponding path program 4 times [2023-11-06 22:32:22,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:32:22,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236078103] [2023-11-06 22:32:22,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:22,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:32:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:22,111 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:32:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:22,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:32:22,209 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:32:22,211 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:32:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:32:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:32:22,213 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:32:22,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:32:22,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:32:22,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:32:22,214 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:32:22,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:32:22,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:32:22,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:32:22,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:32:22,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:32:22,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:32:22,216 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:22,223 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:32:22,223 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:32:22,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:32:22 BasicIcfg [2023-11-06 22:32:22,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:32:22,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:32:22,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:32:22,322 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:32:22,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:05" (3/4) ... [2023-11-06 22:32:22,325 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:32:22,326 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:32:22,327 INFO L158 Benchmark]: Toolchain (without parser) took 19112.53ms. Allocated memory was 127.9MB in the beginning and 293.6MB in the end (delta: 165.7MB). Free memory was 86.5MB in the beginning and 199.7MB in the end (delta: -113.2MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,327 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 127.9MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:22,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 889.42ms. Allocated memory is still 127.9MB. Free memory was 86.2MB in the beginning and 63.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,328 INFO L158 Benchmark]: Boogie Procedure Inliner took 133.81ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 63.4MB in the beginning and 135.8MB in the end (delta: -72.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,328 INFO L158 Benchmark]: Boogie Preprocessor took 101.09ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 135.4MB in the end (delta: 438.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,329 INFO L158 Benchmark]: RCFGBuilder took 881.54ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 98.5MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,329 INFO L158 Benchmark]: TraceAbstraction took 17092.62ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 97.6MB in the beginning and 200.7MB in the end (delta: -103.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2023-11-06 22:32:22,329 INFO L158 Benchmark]: Witness Printer took 4.17ms. Allocated memory is still 293.6MB. Free memory was 200.7MB in the beginning and 199.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:22,331 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 127.9MB. Free memory was 75.5MB in the beginning and 75.4MB in the end (delta: 126.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 889.42ms. Allocated memory is still 127.9MB. Free memory was 86.2MB in the beginning and 63.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 133.81ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 63.4MB in the beginning and 135.8MB in the end (delta: -72.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 101.09ms. Allocated memory is still 167.8MB. Free memory was 135.8MB in the beginning and 135.4MB in the end (delta: 438.0kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 881.54ms. Allocated memory is still 167.8MB. Free memory was 135.4MB in the beginning and 98.5MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17092.62ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 97.6MB in the beginning and 200.7MB in the end (delta: -103.1MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * Witness Printer took 4.17ms. Allocated memory is still 293.6MB. Free memory was 200.7MB in the beginning and 199.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 127 PlacesBefore, 40 PlacesAfterwards, 120 TransitionsBefore, 31 TransitionsAfterwards, 2356 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 5310 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2707, independent: 2568, independent conditional: 0, independent unconditional: 2568, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1284, independent: 1256, independent conditional: 0, independent unconditional: 1256, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2707, independent: 1312, independent conditional: 0, independent unconditional: 1312, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1284, unknown conditional: 0, unknown unconditional: 1284] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, 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: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-3, t2492={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-2, t2492={5:0}, t2493={6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, t2494={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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 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=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 812]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 16.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 565 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 412 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 324 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1305 IncrementalHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 88 mSDtfsCounter, 1305 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=179occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 1631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-06 22:32:22,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:32:24,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:32:25,077 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:32:25,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:32:25,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:32:25,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:32:25,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:32:25,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:32:25,145 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:32:25,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:32:25,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:32:25,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:32:25,152 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:32:25,154 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:32:25,154 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:32:25,155 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:32:25,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:32:25,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:32:25,156 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:32:25,156 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:32:25,157 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:32:25,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:32:25,158 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:32:25,158 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:32:25,159 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:32:25,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:32:25,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:32:25,160 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:32:25,161 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:32:25,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:32:25,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:32:25,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:25,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:32:25,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:32:25,164 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:32:25,165 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:32:25,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:32:25,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:32:25,166 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:32:25,167 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:32:25,167 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:32:25,167 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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/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_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2023-11-06 22:32:25,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:32:25,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:32:25,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:32:25,596 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:32:25,596 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:32:25,599 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:28,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:32:29,124 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:32:29,124 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:29,153 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/7f5624d19/adb6652e32444d6aa99b8d2f86f14dd3/FLAG6ce9c6613 [2023-11-06 22:32:29,169 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/data/7f5624d19/adb6652e32444d6aa99b8d2f86f14dd3 [2023-11-06 22:32:29,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:32:29,175 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:32:29,177 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:29,179 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:32:29,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:32:29,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:29,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d4fda6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29, skipping insertion in model container [2023-11-06 22:32:29,187 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:29,261 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:32:29,800 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:29,820 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:32:29,887 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:32:29,929 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:32:29,929 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:32:29,937 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:32:29,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29 WrapperNode [2023-11-06 22:32:29,938 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:32:29,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:29,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:32:29,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:32:29,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:29,977 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,021 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-06 22:32:30,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:32:30,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:32:30,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:32:30,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:32:30,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,092 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,094 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,103 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:32:30,114 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:32:30,114 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:32:30,115 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:32:30,115 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (1/1) ... [2023-11-06 22:32:30,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:32:30,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:32:30,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:32:30,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:32:30,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:32:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:32:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:32:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:32:30,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:32:30,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:32:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:32:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:32:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:32:30,204 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:32:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:32:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:32:30,206 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:32:30,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:32:30,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:32:30,209 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:32:30,459 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:32:30,463 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:32:30,890 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:32:31,100 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:32:31,101 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:32:31,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:31 BoogieIcfgContainer [2023-11-06 22:32:31,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:32:31,108 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:32:31,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:32:31,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:32:31,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:32:29" (1/3) ... [2023-11-06 22:32:31,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d5acfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:31, skipping insertion in model container [2023-11-06 22:32:31,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:32:29" (2/3) ... [2023-11-06 22:32:31,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41d5acfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:32:31, skipping insertion in model container [2023-11-06 22:32:31,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:31" (3/3) ... [2023-11-06 22:32:31,118 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2023-11-06 22:32:31,137 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:32:31,137 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:32:31,137 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:32:31,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:32:31,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 260 flow [2023-11-06 22:32:31,346 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-11-06 22:32:31,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:31,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:32:31,361 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 124 transitions, 260 flow [2023-11-06 22:32:31,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 121 transitions, 251 flow [2023-11-06 22:32:31,378 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:32:31,397 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 121 transitions, 251 flow [2023-11-06 22:32:31,402 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 121 transitions, 251 flow [2023-11-06 22:32:31,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 121 transitions, 251 flow [2023-11-06 22:32:31,466 INFO L124 PetriNetUnfolderBase]: 3/121 cut-off events. [2023-11-06 22:32:31,468 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:31,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 3/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:32:31,474 INFO L119 LiptonReduction]: Number of co-enabled transitions 2356 [2023-11-06 22:32:41,916 INFO L134 LiptonReduction]: Checked pairs total: 5866 [2023-11-06 22:32:41,916 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-11-06 22:32:41,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:32:41,940 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;@319510b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:32:41,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:32:41,942 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:32:41,942 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:32:41,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:41,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:41,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:32:41,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:41,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:41,949 INFO L85 PathProgramCache]: Analyzing trace with hash 546, now seen corresponding path program 1 times [2023-11-06 22:32:41,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660049934] [2023-11-06 22:32:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:41,963 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-06 22:32:41,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:41,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:42,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:42,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:32:42,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:42,113 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-06 22:32:42,114 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:42,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660049934] [2023-11-06 22:32:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660049934] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:32:42,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544188851] [2023-11-06 22:32:42,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:42,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:32:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:42,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:32:42,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:32:42,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 245 [2023-11-06 22:32:42,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 67 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:42,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:42,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 245 [2023-11-06 22:32:42,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:42,632 INFO L124 PetriNetUnfolderBase]: 777/1182 cut-off events. [2023-11-06 22:32:42,632 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-06 22:32:42,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2387 conditions, 1182 events. 777/1182 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 5467 event pairs, 777 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 2376. Up to 1169 conditions per place. [2023-11-06 22:32:42,652 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 20 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-11-06 22:32:42,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 23 transitions, 95 flow [2023-11-06 22:32:42,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:32:42,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:32:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2023-11-06 22:32:42,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5061224489795918 [2023-11-06 22:32:42,677 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2023-11-06 22:32:42,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2023-11-06 22:32:42,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:42,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2023-11-06 22:32:42,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:42,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:42,697 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 245.0) internal successors, (735), 3 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:42,700 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 67 flow. Second operand 2 states and 248 transitions. [2023-11-06 22:32:42,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 23 transitions, 95 flow [2023-11-06 22:32:42,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 23 transitions, 92 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:32:42,707 INFO L231 Difference]: Finished difference. Result has 31 places, 23 transitions, 52 flow [2023-11-06 22:32:42,709 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=23} [2023-11-06 22:32:42,715 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -8 predicate places. [2023-11-06 22:32:42,716 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 52 flow [2023-11-06 22:32:42,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:42,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:42,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:42,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:42,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:42,929 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:42,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:42,929 INFO L85 PathProgramCache]: Analyzing trace with hash -54718380, now seen corresponding path program 1 times [2023-11-06 22:32:42,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:42,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182258612] [2023-11-06 22:32:42,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:42,931 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-06 22:32:42,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:42,935 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:42,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:43,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:32:43,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:43,118 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-06 22:32:43,118 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:43,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182258612] [2023-11-06 22:32:43,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182258612] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:43,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:43,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:32:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611662248] [2023-11-06 22:32:43,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:43,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:32:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:32:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:32:43,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 245 [2023-11-06 22:32:43,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:43,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 245 [2023-11-06 22:32:43,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:43,435 INFO L124 PetriNetUnfolderBase]: 615/1011 cut-off events. [2023-11-06 22:32:43,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:32:43,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1980 conditions, 1011 events. 615/1011 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5072 event pairs, 129 based on Foata normal form. 0/911 useless extension candidates. Maximal degree in co-relation 1977. Up to 703 conditions per place. [2023-11-06 22:32:43,443 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 25 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2023-11-06 22:32:43,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 128 flow [2023-11-06 22:32:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:32:43,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:32:43,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-11-06 22:32:43,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897959183673469 [2023-11-06 22:32:43,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-11-06 22:32:43,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-11-06 22:32:43,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:43,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-11-06 22:32:43,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,472 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,473 INFO L175 Difference]: Start difference. First operand has 31 places, 23 transitions, 52 flow. Second operand 3 states and 360 transitions. [2023-11-06 22:32:43,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 128 flow [2023-11-06 22:32:43,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:32:43,475 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-11-06 22:32:43,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-11-06 22:32:43,476 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -7 predicate places. [2023-11-06 22:32:43,476 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-11-06 22:32:43,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:43,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:43,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-06 22:32:43,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:43,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:43,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1044687988, now seen corresponding path program 1 times [2023-11-06 22:32:43,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:43,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871151752] [2023-11-06 22:32:43,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:43,691 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-06 22:32:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:43,693 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:43,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:43,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:43,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:32:43,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:32:43,876 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:43,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871151752] [2023-11-06 22:32:43,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871151752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:43,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:43,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:32:43,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853790233] [2023-11-06 22:32:43,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:43,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:32:43,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:43,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:32:43,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:32:43,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 245 [2023-11-06 22:32:43,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:43,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:43,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 245 [2023-11-06 22:32:43,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:44,201 INFO L124 PetriNetUnfolderBase]: 369/626 cut-off events. [2023-11-06 22:32:44,202 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-11-06 22:32:44,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1327 conditions, 626 events. 369/626 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2846 event pairs, 74 based on Foata normal form. 48/641 useless extension candidates. Maximal degree in co-relation 1323. Up to 428 conditions per place. [2023-11-06 22:32:44,207 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 26 selfloop transitions, 4 changer transitions 17/50 dead transitions. [2023-11-06 22:32:44,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 50 transitions, 214 flow [2023-11-06 22:32:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:44,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 559 transitions. [2023-11-06 22:32:44,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563265306122449 [2023-11-06 22:32:44,211 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 559 transitions. [2023-11-06 22:32:44,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 559 transitions. [2023-11-06 22:32:44,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:44,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 559 transitions. [2023-11-06 22:32:44,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,219 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,219 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 559 transitions. [2023-11-06 22:32:44,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 50 transitions, 214 flow [2023-11-06 22:32:44,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:32:44,222 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 84 flow [2023-11-06 22:32:44,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-11-06 22:32:44,223 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2023-11-06 22:32:44,223 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 84 flow [2023-11-06 22:32:44,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:44,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:44,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:44,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:44,436 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:44,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:44,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1667548325, now seen corresponding path program 1 times [2023-11-06 22:32:44,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:44,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158756528] [2023-11-06 22:32:44,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:44,438 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-06 22:32:44,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:44,439 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:44,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:44,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:32:44,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:44,614 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-06 22:32:44,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:44,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:44,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158756528] [2023-11-06 22:32:44,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [158756528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:44,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:32:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259255526] [2023-11-06 22:32:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:44,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:44,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:44,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 245 [2023-11-06 22:32:44,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:44,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 245 [2023-11-06 22:32:44,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:44,941 INFO L124 PetriNetUnfolderBase]: 168/323 cut-off events. [2023-11-06 22:32:44,942 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-11-06 22:32:44,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 898 conditions, 323 events. 168/323 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1294 event pairs, 36 based on Foata normal form. 30/341 useless extension candidates. Maximal degree in co-relation 891. Up to 118 conditions per place. [2023-11-06 22:32:44,945 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 33 selfloop transitions, 7 changer transitions 17/60 dead transitions. [2023-11-06 22:32:44,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 60 transitions, 314 flow [2023-11-06 22:32:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:32:44,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:32:44,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 671 transitions. [2023-11-06 22:32:44,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4564625850340136 [2023-11-06 22:32:44,949 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 671 transitions. [2023-11-06 22:32:44,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 671 transitions. [2023-11-06 22:32:44,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:44,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 671 transitions. [2023-11-06 22:32:44,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 111.83333333333333) internal successors, (671), 6 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,957 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 245.0) internal successors, (1715), 7 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,957 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 84 flow. Second operand 6 states and 671 transitions. [2023-11-06 22:32:44,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 60 transitions, 314 flow [2023-11-06 22:32:44,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 60 transitions, 308 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:32:44,962 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 134 flow [2023-11-06 22:32:44,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:32:44,963 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-11-06 22:32:44,963 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 134 flow [2023-11-06 22:32:44,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:44,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:44,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:44,984 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,176 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:45,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1459061013, now seen corresponding path program 1 times [2023-11-06 22:32:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829075170] [2023-11-06 22:32:45,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:45,177 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-06 22:32:45,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:45,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:45,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:32:45,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:45,375 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-06 22:32:45,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:45,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:45,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829075170] [2023-11-06 22:32:45,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829075170] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:45,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:45,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:32:45,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244810949] [2023-11-06 22:32:45,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:45,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:32:45,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:45,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:32:45,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:32:45,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 245 [2023-11-06 22:32:45,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:45,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:45,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 245 [2023-11-06 22:32:45,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:45,729 INFO L124 PetriNetUnfolderBase]: 102/204 cut-off events. [2023-11-06 22:32:45,730 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-11-06 22:32:45,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 204 events. 102/204 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 701 event pairs, 32 based on Foata normal form. 9/209 useless extension candidates. Maximal degree in co-relation 623. Up to 77 conditions per place. [2023-11-06 22:32:45,732 INFO L140 encePairwiseOnDemand]: 239/245 looper letters, 30 selfloop transitions, 10 changer transitions 9/52 dead transitions. [2023-11-06 22:32:45,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 316 flow [2023-11-06 22:32:45,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:32:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:32:45,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-11-06 22:32:45,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.446064139941691 [2023-11-06 22:32:45,737 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-11-06 22:32:45,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-11-06 22:32:45,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:45,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-11-06 22:32:45,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:45,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:45,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 245.0) internal successors, (1960), 8 states have internal predecessors, (1960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:45,746 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 134 flow. Second operand 7 states and 765 transitions. [2023-11-06 22:32:45,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 316 flow [2023-11-06 22:32:45,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 280 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-06 22:32:45,751 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 136 flow [2023-11-06 22:32:45,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-11-06 22:32:45,753 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-11-06 22:32:45,753 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 136 flow [2023-11-06 22:32:45,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.33333333333333) internal successors, (626), 6 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:45,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:45,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:45,772 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,967 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:45,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:45,967 INFO L85 PathProgramCache]: Analyzing trace with hash 314599020, now seen corresponding path program 1 times [2023-11-06 22:32:45,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:45,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402136665] [2023-11-06 22:32:45,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:45,969 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-06 22:32:45,969 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:45,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:45,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:46,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:46,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:32:46,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:46,136 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-06 22:32:46,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:46,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:46,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402136665] [2023-11-06 22:32:46,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402136665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:46,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:46,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:32:46,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161561970] [2023-11-06 22:32:46,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:46,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:32:46,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:32:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:32:46,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-11-06 22:32:46,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:46,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:46,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-11-06 22:32:46,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:46,278 INFO L124 PetriNetUnfolderBase]: 134/273 cut-off events. [2023-11-06 22:32:46,279 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2023-11-06 22:32:46,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 830 conditions, 273 events. 134/273 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1108 event pairs, 71 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 820. Up to 179 conditions per place. [2023-11-06 22:32:46,282 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-11-06 22:32:46,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 322 flow [2023-11-06 22:32:46,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:32:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:32:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-11-06 22:32:46,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816326530612245 [2023-11-06 22:32:46,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-11-06 22:32:46,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-11-06 22:32:46,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:46,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-11-06 22:32:46,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:46,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:46,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:46,290 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 136 flow. Second operand 3 states and 354 transitions. [2023-11-06 22:32:46,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 322 flow [2023-11-06 22:32:46,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 43 transitions, 248 flow, removed 24 selfloop flow, removed 6 redundant places. [2023-11-06 22:32:46,294 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 110 flow [2023-11-06 22:32:46,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2023-11-06 22:32:46,295 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-11-06 22:32:46,295 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 110 flow [2023-11-06 22:32:46,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:46,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:46,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:46,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-06 22:32:46,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:46,509 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:46,509 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash 858696789, now seen corresponding path program 1 times [2023-11-06 22:32:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1068198248] [2023-11-06 22:32:46,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:32:46,510 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-06 22:32:46,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:46,512 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:46,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:32:46,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:32:46,707 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:47,095 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-06 22:32:47,096 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:47,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1068198248] [2023-11-06 22:32:47,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1068198248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:47,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:47,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:32:47,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050778798] [2023-11-06 22:32:47,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:47,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:32:47,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:47,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:32:47,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:32:47,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 245 [2023-11-06 22:32:47,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 110 flow. Second operand has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,298 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:47,298 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 245 [2023-11-06 22:32:47,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:47,508 INFO L124 PetriNetUnfolderBase]: 121/248 cut-off events. [2023-11-06 22:32:47,508 INFO L125 PetriNetUnfolderBase]: For 211/211 co-relation queries the response was YES. [2023-11-06 22:32:47,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 737 conditions, 248 events. 121/248 cut-off events. For 211/211 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1026 event pairs, 15 based on Foata normal form. 2/250 useless extension candidates. Maximal degree in co-relation 729. Up to 200 conditions per place. [2023-11-06 22:32:47,510 INFO L140 encePairwiseOnDemand]: 241/245 looper letters, 23 selfloop transitions, 3 changer transitions 7/36 dead transitions. [2023-11-06 22:32:47,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 216 flow [2023-11-06 22:32:47,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:47,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-11-06 22:32:47,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40408163265306124 [2023-11-06 22:32:47,514 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-11-06 22:32:47,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-11-06 22:32:47,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:47,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-11-06 22:32:47,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,520 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 110 flow. Second operand 5 states and 495 transitions. [2023-11-06 22:32:47,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 216 flow [2023-11-06 22:32:47,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:32:47,522 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 108 flow [2023-11-06 22:32:47,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-11-06 22:32:47,524 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2023-11-06 22:32:47,524 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 108 flow [2023-11-06 22:32:47,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:47,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:47,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-06 22:32:47,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:47,738 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:47,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash 838653382, now seen corresponding path program 2 times [2023-11-06 22:32:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:47,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1347467768] [2023-11-06 22:32:47,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:32:47,739 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-06 22:32:47,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:47,741 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:47,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:47,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:32:47,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:32:47,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:32:47,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:47,897 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-06 22:32:47,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:47,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:47,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1347467768] [2023-11-06 22:32:47,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1347467768] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:47,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:47,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:32:47,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872715611] [2023-11-06 22:32:47,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:47,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:32:47,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:47,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:32:47,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:32:47,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 245 [2023-11-06 22:32:47,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:47,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:47,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 245 [2023-11-06 22:32:47,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:48,027 INFO L124 PetriNetUnfolderBase]: 81/176 cut-off events. [2023-11-06 22:32:48,028 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-11-06 22:32:48,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 176 events. 81/176 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 614 event pairs, 38 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 506. Up to 114 conditions per place. [2023-11-06 22:32:48,029 INFO L140 encePairwiseOnDemand]: 242/245 looper letters, 27 selfloop transitions, 2 changer transitions 9/40 dead transitions. [2023-11-06 22:32:48,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 40 transitions, 248 flow [2023-11-06 22:32:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:32:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:32:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 351 transitions. [2023-11-06 22:32:48,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2023-11-06 22:32:48,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 351 transitions. [2023-11-06 22:32:48,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 351 transitions. [2023-11-06 22:32:48,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:48,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 351 transitions. [2023-11-06 22:32:48,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.0) internal successors, (351), 3 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-06 22:32:48,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,037 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,037 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 108 flow. Second operand 3 states and 351 transitions. [2023-11-06 22:32:48,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 40 transitions, 248 flow [2023-11-06 22:32:48,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 237 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-06 22:32:48,040 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 105 flow [2023-11-06 22:32:48,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2023-11-06 22:32:48,041 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -1 predicate places. [2023-11-06 22:32:48,041 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 105 flow [2023-11-06 22:32:48,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:48,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:48,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:48,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:48,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:48,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:48,255 INFO L85 PathProgramCache]: Analyzing trace with hash 231228326, now seen corresponding path program 3 times [2023-11-06 22:32:48,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:48,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1356366659] [2023-11-06 22:32:48,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:32:48,256 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-06 22:32:48,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:48,258 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:48,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:32:48,393 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:32:48,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:32:48,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-06 22:32:48,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:32:48,751 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-06 22:32:48,751 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:32:48,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:32:48,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1356366659] [2023-11-06 22:32:48,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1356366659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:32:48,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:32:48,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:32:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65575842] [2023-11-06 22:32:48,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:32:48,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:32:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:32:48,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:32:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:32:48,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 245 [2023-11-06 22:32:48,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 105 flow. Second operand has 8 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:32:48,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 245 [2023-11-06 22:32:48,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:32:48,978 INFO L124 PetriNetUnfolderBase]: 40/98 cut-off events. [2023-11-06 22:32:48,978 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-06 22:32:48,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 98 events. 40/98 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 258 event pairs, 6 based on Foata normal form. 1/99 useless extension candidates. Maximal degree in co-relation 312. Up to 55 conditions per place. [2023-11-06 22:32:48,979 INFO L140 encePairwiseOnDemand]: 240/245 looper letters, 26 selfloop transitions, 3 changer transitions 15/46 dead transitions. [2023-11-06 22:32:48,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 288 flow [2023-11-06 22:32:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:32:48,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:32:48,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2023-11-06 22:32:48,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4579591836734694 [2023-11-06 22:32:48,983 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 561 transitions. [2023-11-06 22:32:48,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 561 transitions. [2023-11-06 22:32:48,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:32:48,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 561 transitions. [2023-11-06 22:32:48,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,990 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,990 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 105 flow. Second operand 5 states and 561 transitions. [2023-11-06 22:32:48,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 288 flow [2023-11-06 22:32:48,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 46 transitions, 277 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:32:48,993 INFO L231 Difference]: Finished difference. Result has 41 places, 26 transitions, 110 flow [2023-11-06 22:32:48,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=245, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2023-11-06 22:32:48,994 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2023-11-06 22:32:48,995 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 110 flow [2023-11-06 22:32:48,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:32:48,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:32:48,996 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:49,019 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:49,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:49,209 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:32:49,209 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:32:49,209 INFO L85 PathProgramCache]: Analyzing trace with hash -899326404, now seen corresponding path program 4 times [2023-11-06 22:32:49,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:32:49,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344834096] [2023-11-06 22:32:49,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:32:49,210 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-06 22:32:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:32:49,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:49,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:32:49,390 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:32:49,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:32:49,390 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:32:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:32:49,580 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:32:49,580 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:32:49,581 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:32:49,583 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:32:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:32:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:32:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:32:49,584 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:32:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:32:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:32:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:32:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:32:49,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:32:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:32:49,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:32:49,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:32:49,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/mathsat -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-06 22:32:49,799 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:32:49,804 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:32:49,804 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:32:49,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:32:49 BasicIcfg [2023-11-06 22:32:49,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:32:49,889 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:32:49,889 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:32:49,890 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:32:49,890 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:32:31" (3/4) ... [2023-11-06 22:32:49,892 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:32:49,893 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:32:49,911 INFO L158 Benchmark]: Toolchain (without parser) took 20736.35ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 54.5MB in the beginning and 89.0MB in the end (delta: -34.5MB). Peak memory consumption was 73.5MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,912 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 58.7MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:32:49,912 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.00ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 49.4MB in the end (delta: 4.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.18ms. Allocated memory is still 79.7MB. Free memory was 49.4MB in the beginning and 46.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,913 INFO L158 Benchmark]: Boogie Preprocessor took 80.93ms. Allocated memory is still 79.7MB. Free memory was 46.5MB in the beginning and 44.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,914 INFO L158 Benchmark]: RCFGBuilder took 990.86ms. Allocated memory is still 79.7MB. Free memory was 44.4MB in the beginning and 47.0MB in the end (delta: -2.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,914 INFO L158 Benchmark]: TraceAbstraction took 18781.30ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 46.1MB in the beginning and 23.3MB in the end (delta: 22.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,914 INFO L158 Benchmark]: Witness Printer took 21.30ms. Allocated memory is still 117.4MB. Free memory was 23.3MB in the beginning and 89.0MB in the end (delta: -65.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2023-11-06 22:32:49,917 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.23ms. Allocated memory is still 58.7MB. Free memory is still 34.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.00ms. Allocated memory is still 79.7MB. Free memory was 54.3MB in the beginning and 49.4MB in the end (delta: 4.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 93.18ms. Allocated memory is still 79.7MB. Free memory was 49.4MB in the beginning and 46.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.93ms. Allocated memory is still 79.7MB. Free memory was 46.5MB in the beginning and 44.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 990.86ms. Allocated memory is still 79.7MB. Free memory was 44.4MB in the beginning and 47.0MB in the end (delta: -2.6MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18781.30ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 46.1MB in the beginning and 23.3MB in the end (delta: 22.7MB). Peak memory consumption was 60.3MB. Max. memory is 16.1GB. * Witness Printer took 21.30ms. Allocated memory is still 117.4MB. Free memory was 23.3MB in the beginning and 89.0MB in the end (delta: -65.6MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.5s, 128 PlacesBefore, 39 PlacesAfterwards, 121 TransitionsBefore, 29 TransitionsAfterwards, 2356 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 121 TotalNumberOfCompositions, 5866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2746, independent: 2574, independent conditional: 0, independent unconditional: 2574, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1353, independent: 1299, independent conditional: 0, independent unconditional: 1299, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2746, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 118, dependent conditional: 0, dependent unconditional: 118, unknown: 1353, unknown conditional: 0, unknown unconditional: 1353] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=0, t2492={-6: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=1, t2492={-6:0}, t2493={-10: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=2, t2492={-6:0}, t2493={-10:0}, t2494={-2: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L760] 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) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 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 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 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) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 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 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 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}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={-6:0}, t2493={-10:0}, t2494={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L834] 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)) [L835] 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)) [L836] 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)) [L837] 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)) [L838] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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", "safe030_power.opt_pso.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 812]: 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: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 10.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 212 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 866 IncrementalHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 9 mSDtfsCounter, 866 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=5, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 979 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1086 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-06 22:32:49,946 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1c63b477-654d-434d-8271-018e1bb597a7/bin/uautomizer-verify-WvqO1wxjHP/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