./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:03:35,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:03:35,514 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:03:35,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:03:35,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:03:35,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:03:35,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:03:35,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:03:35,549 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:03:35,550 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:03:35,551 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:03:35,551 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:03:35,552 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:03:35,553 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:03:35,553 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:03:35,554 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:03:35,554 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:03:35,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:03:35,556 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:03:35,556 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:03:35,557 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:03:35,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:03:35,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:03:35,558 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:03:35,559 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:03:35,559 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:03:35,560 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:03:35,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:03:35,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:03:35,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:35,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:03:35,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:03:35,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:03:35,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:03:35,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:03:35,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:03:35,564 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:03:35,564 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:03:35,564 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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2023-11-06 23:03:35,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:03:35,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:03:35,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:03:35,927 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:03:35,928 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:03:35,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-06 23:03:39,121 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:03:39,480 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:03:39,481 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-06 23:03:39,501 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/7e979768c/da23c70f29ce469c8585ee8c4aef7c7d/FLAG0e7d90c8c [2023-11-06 23:03:39,516 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/7e979768c/da23c70f29ce469c8585ee8c4aef7c7d [2023-11-06 23:03:39,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:03:39,520 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:03:39,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:39,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:03:39,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:03:39,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,530 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756b8dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:39, skipping insertion in model container [2023-11-06 23:03:39,530 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:03:39" (1/1) ... [2023-11-06 23:03:39,591 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:03:40,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:40,036 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:03:40,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:03:40,199 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:40,199 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:03:40,207 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:03:40,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40 WrapperNode [2023-11-06 23:03:40,208 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:03:40,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:40,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:03:40,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:03:40,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,268 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,330 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2023-11-06 23:03:40,331 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:03:40,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:03:40,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:03:40,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:03:40,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:03:40,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:03:40,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:03:40,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:03:40,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (1/1) ... [2023-11-06 23:03:40,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:03:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:03:40,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:03:40,471 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:03:40,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:03:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:03:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:03:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:03:40,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:03:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:03:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:03:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:03:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:03:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:03:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:03:40,484 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:03:40,484 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:03:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:03:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:03:40,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:03:40,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:03:40,487 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 23:03:40,645 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:03:40,647 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:03:41,138 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:03:41,296 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:03:41,296 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:03:41,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:41 BoogieIcfgContainer [2023-11-06 23:03:41,299 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:03:41,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:03:41,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:03:41,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:03:41,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:03:39" (1/3) ... [2023-11-06 23:03:41,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f923b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:41, skipping insertion in model container [2023-11-06 23:03:41,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:03:40" (2/3) ... [2023-11-06 23:03:41,308 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f923b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:03:41, skipping insertion in model container [2023-11-06 23:03:41,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:41" (3/3) ... [2023-11-06 23:03:41,310 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-11-06 23:03:41,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:03:41,330 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 23:03:41,331 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:03:41,436 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:03:41,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 23:03:41,596 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 23:03:41,596 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:41,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 23:03:41,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 23:03:41,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 145 transitions, 302 flow [2023-11-06 23:03:41,619 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:03:41,636 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 23:03:41,639 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 155 places, 145 transitions, 302 flow [2023-11-06 23:03:41,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 302 flow [2023-11-06 23:03:41,695 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 23:03:41,695 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:41,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 23:03:41,700 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 23:03:47,600 INFO L134 LiptonReduction]: Checked pairs total: 9360 [2023-11-06 23:03:47,601 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-11-06 23:03:47,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:03:47,625 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;@7f1632cf, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:03:47,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 23:03:47,627 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:03:47,628 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 23:03:47,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:47,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:47,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:03:47,629 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:47,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash 657, now seen corresponding path program 1 times [2023-11-06 23:03:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:47,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826964754] [2023-11-06 23:03:47,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:47,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:47,782 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 23:03:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826964754] [2023-11-06 23:03:47,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826964754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:47,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:47,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:03:47,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304316718] [2023-11-06 23:03:47,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:47,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:03:47,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:47,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:03:47,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:03:47,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 293 [2023-11-06 23:03:47,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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 23:03:47,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:47,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 293 [2023-11-06 23:03:47,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:49,091 INFO L124 PetriNetUnfolderBase]: 4373/6106 cut-off events. [2023-11-06 23:03:49,092 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 23:03:49,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12192 conditions, 6106 events. 4373/6106 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 31613 event pairs, 4373 based on Foata normal form. 0/5337 useless extension candidates. Maximal degree in co-relation 12180. Up to 5983 conditions per place. [2023-11-06 23:03:49,154 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 23:03:49,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 23:03:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:03:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:03:49,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 305 transitions. [2023-11-06 23:03:49,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5204778156996587 [2023-11-06 23:03:49,172 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 305 transitions. [2023-11-06 23:03:49,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 305 transitions. [2023-11-06 23:03:49,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:49,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 305 transitions. [2023-11-06 23:03:49,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:49,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 23:03:49,187 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 293.0) internal successors, (879), 3 states have internal predecessors, (879), 0 states have call successors, (0), 0 states 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 23:03:49,189 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 305 transitions. [2023-11-06 23:03:49,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 23:03:49,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:03:49,197 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 23:03:49,199 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 23:03:49,203 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 23:03:49,203 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 23:03:49,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states 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 23:03:49,203 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:49,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:49,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:03:49,204 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:49,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:49,205 INFO L85 PathProgramCache]: Analyzing trace with hash 482371112, now seen corresponding path program 1 times [2023-11-06 23:03:49,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:49,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718359865] [2023-11-06 23:03:49,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:49,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:49,769 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 23:03:49,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:49,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718359865] [2023-11-06 23:03:49,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718359865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:49,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:49,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:49,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486047471] [2023-11-06 23:03:49,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:49,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:49,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:49,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:49,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:49,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 293 [2023-11-06 23:03:49,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 23:03:49,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:49,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 293 [2023-11-06 23:03:49,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:50,734 INFO L124 PetriNetUnfolderBase]: 3632/5257 cut-off events. [2023-11-06 23:03:50,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:03:50,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10347 conditions, 5257 events. 3632/5257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 28805 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10344. Up to 3973 conditions per place. [2023-11-06 23:03:50,778 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-06 23:03:50,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-11-06 23:03:50,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 441 transitions. [2023-11-06 23:03:50,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017064846416383 [2023-11-06 23:03:50,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 441 transitions. [2023-11-06 23:03:50,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 441 transitions. [2023-11-06 23:03:50,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:50,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 441 transitions. [2023-11-06 23:03:50,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:50,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:03:50,792 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:03:50,793 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 441 transitions. [2023-11-06 23:03:50,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-11-06 23:03:50,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:03:50,795 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 23:03:50,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 23:03:50,796 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 23:03:50,796 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 23:03:50,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states 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 23:03:50,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:50,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:50,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:03:50,797 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:50,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:50,798 INFO L85 PathProgramCache]: Analyzing trace with hash -297766811, now seen corresponding path program 1 times [2023-11-06 23:03:50,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:50,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776716086] [2023-11-06 23:03:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:50,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:51,059 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 23:03:51,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:51,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776716086] [2023-11-06 23:03:51,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776716086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:51,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:51,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:03:51,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085982791] [2023-11-06 23:03:51,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:51,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:03:51,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:51,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:03:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:03:51,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2023-11-06 23:03:51,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:51,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:51,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2023-11-06 23:03:51,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:53,928 INFO L124 PetriNetUnfolderBase]: 15193/20642 cut-off events. [2023-11-06 23:03:53,928 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2023-11-06 23:03:53,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42407 conditions, 20642 events. 15193/20642 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 109069 event pairs, 5405 based on Foata normal form. 0/20186 useless extension candidates. Maximal degree in co-relation 42403. Up to 12185 conditions per place. [2023-11-06 23:03:54,097 INFO L140 encePairwiseOnDemand]: 282/293 looper letters, 41 selfloop transitions, 10 changer transitions 0/51 dead transitions. [2023-11-06 23:03:54,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 51 transitions, 222 flow [2023-11-06 23:03:54,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:03:54,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:03:54,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-11-06 23:03:54,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4789533560864619 [2023-11-06 23:03:54,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-11-06 23:03:54,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-11-06 23:03:54,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:54,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-11-06 23:03:54,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 23:03:54,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:03:54,108 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:03:54,109 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 421 transitions. [2023-11-06 23:03:54,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 51 transitions, 222 flow [2023-11-06 23:03:54,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:54,137 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 142 flow [2023-11-06 23:03:54,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2023-11-06 23:03:54,139 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-11-06 23:03:54,139 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 142 flow [2023-11-06 23:03:54,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:03:54,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:54,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:54,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:03:54,145 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:54,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:54,146 INFO L85 PathProgramCache]: Analyzing trace with hash -640838225, now seen corresponding path program 1 times [2023-11-06 23:03:54,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447562025] [2023-11-06 23:03:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:54,457 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 23:03:54,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:54,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447562025] [2023-11-06 23:03:54,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447562025] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:54,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:03:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999060866] [2023-11-06 23:03:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:54,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:03:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:54,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:03:54,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:03:54,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2023-11-06 23:03:54,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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 23:03:54,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:54,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2023-11-06 23:03:54,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:03:57,098 INFO L124 PetriNetUnfolderBase]: 14501/19698 cut-off events. [2023-11-06 23:03:57,098 INFO L125 PetriNetUnfolderBase]: For 10553/10553 co-relation queries the response was YES. [2023-11-06 23:03:57,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53601 conditions, 19698 events. 14501/19698 cut-off events. For 10553/10553 co-relation queries the response was YES. Maximal size of possible extension queue 674. Compared 100427 event pairs, 3355 based on Foata normal form. 136/19834 useless extension candidates. Maximal degree in co-relation 53596. Up to 8543 conditions per place. [2023-11-06 23:03:57,402 INFO L140 encePairwiseOnDemand]: 282/293 looper letters, 56 selfloop transitions, 11 changer transitions 0/67 dead transitions. [2023-11-06 23:03:57,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 67 transitions, 378 flow [2023-11-06 23:03:57,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:03:57,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:03:57,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 552 transitions. [2023-11-06 23:03:57,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709897610921502 [2023-11-06 23:03:57,408 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 552 transitions. [2023-11-06 23:03:57,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 552 transitions. [2023-11-06 23:03:57,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:03:57,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 552 transitions. [2023-11-06 23:03:57,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 states 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 23:03:57,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:03:57,416 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:03:57,416 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 142 flow. Second operand 4 states and 552 transitions. [2023-11-06 23:03:57,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 67 transitions, 378 flow [2023-11-06 23:03:57,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 67 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:03:57,463 INFO L231 Difference]: Finished difference. Result has 46 places, 44 transitions, 210 flow [2023-11-06 23:03:57,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=46, PETRI_TRANSITIONS=44} [2023-11-06 23:03:57,466 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-11-06 23:03:57,466 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 44 transitions, 210 flow [2023-11-06 23:03:57,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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 23:03:57,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:03:57,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:03:57,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:03:57,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:03:57,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:03:57,468 INFO L85 PathProgramCache]: Analyzing trace with hash -640835862, now seen corresponding path program 1 times [2023-11-06 23:03:57,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:03:57,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463997532] [2023-11-06 23:03:57,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:03:57,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:03:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:03:58,217 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 23:03:58,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:03:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463997532] [2023-11-06 23:03:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463997532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:03:58,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:03:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:03:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160462458] [2023-11-06 23:03:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:03:58,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:03:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:03:58,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:03:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:03:58,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 293 [2023-11-06 23:03:58,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 44 transitions, 210 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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 23:03:58,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:03:58,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 293 [2023-11-06 23:03:58,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:00,831 INFO L124 PetriNetUnfolderBase]: 10897/15701 cut-off events. [2023-11-06 23:04:00,831 INFO L125 PetriNetUnfolderBase]: For 14677/15684 co-relation queries the response was YES. [2023-11-06 23:04:00,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44066 conditions, 15701 events. 10897/15701 cut-off events. For 14677/15684 co-relation queries the response was YES. Maximal size of possible extension queue 789. Compared 96012 event pairs, 1555 based on Foata normal form. 818/15903 useless extension candidates. Maximal degree in co-relation 44059. Up to 9171 conditions per place. [2023-11-06 23:04:00,955 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 51 selfloop transitions, 6 changer transitions 20/88 dead transitions. [2023-11-06 23:04:00,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 530 flow [2023-11-06 23:04:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:04:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 885 transitions. [2023-11-06 23:04:00,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43149683081423695 [2023-11-06 23:04:00,961 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 885 transitions. [2023-11-06 23:04:00,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 885 transitions. [2023-11-06 23:04:00,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:00,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 885 transitions. [2023-11-06 23:04:00,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.42857142857143) internal successors, (885), 7 states have internal predecessors, (885), 0 states have call successors, (0), 0 states 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 23:04:00,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 23:04:00,974 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 23:04:00,974 INFO L175 Difference]: Start difference. First operand has 46 places, 44 transitions, 210 flow. Second operand 7 states and 885 transitions. [2023-11-06 23:04:00,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 530 flow [2023-11-06 23:04:01,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 525 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:01,039 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 220 flow [2023-11-06 23:04:01,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=220, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-06 23:04:01,042 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places. [2023-11-06 23:04:01,043 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 220 flow [2023-11-06 23:04:01,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states 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 23:04:01,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:01,044 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:01,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:04:01,045 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:01,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1607056293, now seen corresponding path program 1 times [2023-11-06 23:04:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754444044] [2023-11-06 23:04:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:01,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:01,360 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 23:04:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:01,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754444044] [2023-11-06 23:04:01,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754444044] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:01,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:01,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:04:01,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439689247] [2023-11-06 23:04:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:01,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:01,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:01,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:01,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:01,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2023-11-06 23:04:01,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 23:04:01,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:01,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2023-11-06 23:04:01,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:03,094 INFO L124 PetriNetUnfolderBase]: 9918/14261 cut-off events. [2023-11-06 23:04:03,094 INFO L125 PetriNetUnfolderBase]: For 15037/15307 co-relation queries the response was YES. [2023-11-06 23:04:03,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41856 conditions, 14261 events. 9918/14261 cut-off events. For 15037/15307 co-relation queries the response was YES. Maximal size of possible extension queue 650. Compared 82746 event pairs, 3846 based on Foata normal form. 216/14212 useless extension candidates. Maximal degree in co-relation 41846. Up to 12020 conditions per place. [2023-11-06 23:04:03,213 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 56 selfloop transitions, 7 changer transitions 0/71 dead transitions. [2023-11-06 23:04:03,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 483 flow [2023-11-06 23:04:03,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:03,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:03,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2023-11-06 23:04:03,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502844141069397 [2023-11-06 23:04:03,217 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2023-11-06 23:04:03,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2023-11-06 23:04:03,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:03,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2023-11-06 23:04:03,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states 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 23:04:03,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:03,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:03,223 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 220 flow. Second operand 3 states and 442 transitions. [2023-11-06 23:04:03,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 483 flow [2023-11-06 23:04:03,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 71 transitions, 457 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-11-06 23:04:03,280 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 277 flow [2023-11-06 23:04:03,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2023-11-06 23:04:03,281 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 23:04:03,281 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 277 flow [2023-11-06 23:04:03,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states 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 23:04:03,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:03,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:03,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:04:03,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:03,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1720797185, now seen corresponding path program 1 times [2023-11-06 23:04:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902381136] [2023-11-06 23:04:03,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:03,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:03,550 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 23:04:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902381136] [2023-11-06 23:04:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902381136] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:03,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:03,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:04:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162408187] [2023-11-06 23:04:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:03,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:03,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:03,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:03,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2023-11-06 23:04:03,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 49 transitions, 277 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 23:04:03,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:03,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2023-11-06 23:04:03,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:05,118 INFO L124 PetriNetUnfolderBase]: 10108/14449 cut-off events. [2023-11-06 23:04:05,118 INFO L125 PetriNetUnfolderBase]: For 16718/17096 co-relation queries the response was YES. [2023-11-06 23:04:05,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43186 conditions, 14449 events. 10108/14449 cut-off events. For 16718/17096 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 82019 event pairs, 2548 based on Foata normal form. 261/14594 useless extension candidates. Maximal degree in co-relation 43176. Up to 12064 conditions per place. [2023-11-06 23:04:05,262 INFO L140 encePairwiseOnDemand]: 289/293 looper letters, 58 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-11-06 23:04:05,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 544 flow [2023-11-06 23:04:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-06 23:04:05,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49943117178612056 [2023-11-06 23:04:05,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-06 23:04:05,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-06 23:04:05,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:05,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-06 23:04:05,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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 23:04:05,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:05,281 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:05,282 INFO L175 Difference]: Start difference. First operand has 49 places, 49 transitions, 277 flow. Second operand 3 states and 439 transitions. [2023-11-06 23:04:05,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 544 flow [2023-11-06 23:04:05,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 76 transitions, 535 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:05,303 INFO L231 Difference]: Finished difference. Result has 51 places, 55 transitions, 341 flow [2023-11-06 23:04:05,305 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=341, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2023-11-06 23:04:05,307 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 23:04:05,307 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 341 flow [2023-11-06 23:04:05,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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 23:04:05,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:05,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:05,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:04:05,309 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:05,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:05,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1720861782, now seen corresponding path program 1 times [2023-11-06 23:04:05,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:05,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27454360] [2023-11-06 23:04:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:05,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:07,029 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 23:04:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:07,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27454360] [2023-11-06 23:04:07,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27454360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:07,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:07,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 23:04:07,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490867565] [2023-11-06 23:04:07,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:07,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 23:04:07,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:07,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 23:04:07,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 23:04:07,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 293 [2023-11-06 23:04:07,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 341 flow. Second operand has 10 states, 10 states have (on average 112.4) internal successors, (1124), 10 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 23:04:07,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:07,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 293 [2023-11-06 23:04:07,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:09,365 INFO L124 PetriNetUnfolderBase]: 7783/11290 cut-off events. [2023-11-06 23:04:09,365 INFO L125 PetriNetUnfolderBase]: For 15674/16660 co-relation queries the response was YES. [2023-11-06 23:04:09,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35778 conditions, 11290 events. 7783/11290 cut-off events. For 15674/16660 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 65483 event pairs, 752 based on Foata normal form. 869/11873 useless extension candidates. Maximal degree in co-relation 35767. Up to 5598 conditions per place. [2023-11-06 23:04:09,429 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 73 selfloop transitions, 9 changer transitions 18/117 dead transitions. [2023-11-06 23:04:09,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 117 transitions, 848 flow [2023-11-06 23:04:09,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:04:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1064 transitions. [2023-11-06 23:04:09,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403488813045127 [2023-11-06 23:04:09,436 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1064 transitions. [2023-11-06 23:04:09,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1064 transitions. [2023-11-06 23:04:09,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:09,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1064 transitions. [2023-11-06 23:04:09,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 118.22222222222223) internal successors, (1064), 9 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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 23:04:09,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states 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 23:04:09,448 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states 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 23:04:09,449 INFO L175 Difference]: Start difference. First operand has 51 places, 55 transitions, 341 flow. Second operand 9 states and 1064 transitions. [2023-11-06 23:04:09,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 117 transitions, 848 flow [2023-11-06 23:04:09,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 117 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:09,471 INFO L231 Difference]: Finished difference. Result has 58 places, 55 transitions, 365 flow [2023-11-06 23:04:09,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=58, PETRI_TRANSITIONS=55} [2023-11-06 23:04:09,472 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-11-06 23:04:09,472 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 55 transitions, 365 flow [2023-11-06 23:04:09,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 112.4) internal successors, (1124), 10 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 23:04:09,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:09,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:09,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:04:09,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:09,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash 246551231, now seen corresponding path program 1 times [2023-11-06 23:04:09,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:09,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386333639] [2023-11-06 23:04:09,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:09,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:09,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:09,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386333639] [2023-11-06 23:04:09,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386333639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:09,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:09,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:09,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752621478] [2023-11-06 23:04:09,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:09,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:09,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:09,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2023-11-06 23:04:09,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 55 transitions, 365 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 23:04:09,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:09,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2023-11-06 23:04:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:11,394 INFO L124 PetriNetUnfolderBase]: 11283/15752 cut-off events. [2023-11-06 23:04:11,394 INFO L125 PetriNetUnfolderBase]: For 23109/23109 co-relation queries the response was YES. [2023-11-06 23:04:11,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51079 conditions, 15752 events. 11283/15752 cut-off events. For 23109/23109 co-relation queries the response was YES. Maximal size of possible extension queue 573. Compared 84840 event pairs, 2075 based on Foata normal form. 160/15912 useless extension candidates. Maximal degree in co-relation 51067. Up to 6855 conditions per place. [2023-11-06 23:04:11,478 INFO L140 encePairwiseOnDemand]: 283/293 looper letters, 62 selfloop transitions, 26 changer transitions 9/97 dead transitions. [2023-11-06 23:04:11,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 97 transitions, 763 flow [2023-11-06 23:04:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 559 transitions. [2023-11-06 23:04:11,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47696245733788395 [2023-11-06 23:04:11,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 559 transitions. [2023-11-06 23:04:11,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 559 transitions. [2023-11-06 23:04:11,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:11,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 559 transitions. [2023-11-06 23:04:11,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.75) internal successors, (559), 4 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 23:04:11,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:11,487 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:11,487 INFO L175 Difference]: Start difference. First operand has 58 places, 55 transitions, 365 flow. Second operand 4 states and 559 transitions. [2023-11-06 23:04:11,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 97 transitions, 763 flow [2023-11-06 23:04:11,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 97 transitions, 733 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 23:04:11,513 INFO L231 Difference]: Finished difference. Result has 56 places, 59 transitions, 503 flow [2023-11-06 23:04:11,513 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=503, PETRI_PLACES=56, PETRI_TRANSITIONS=59} [2023-11-06 23:04:11,514 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places. [2023-11-06 23:04:11,514 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 59 transitions, 503 flow [2023-11-06 23:04:11,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 23:04:11,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:11,515 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:11,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:04:11,516 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:11,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1805060080, now seen corresponding path program 1 times [2023-11-06 23:04:11,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:11,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125425822] [2023-11-06 23:04:11,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:11,749 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 23:04:11,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:11,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125425822] [2023-11-06 23:04:11,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125425822] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:11,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:11,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686625542] [2023-11-06 23:04:11,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:11,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:11,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:11,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:11,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:11,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 293 [2023-11-06 23:04:11,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 59 transitions, 503 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 23:04:11,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:11,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 293 [2023-11-06 23:04:11,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:13,117 INFO L124 PetriNetUnfolderBase]: 9657/13578 cut-off events. [2023-11-06 23:04:13,117 INFO L125 PetriNetUnfolderBase]: For 34799/34799 co-relation queries the response was YES. [2023-11-06 23:04:13,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47679 conditions, 13578 events. 9657/13578 cut-off events. For 34799/34799 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 72546 event pairs, 2175 based on Foata normal form. 56/13634 useless extension candidates. Maximal degree in co-relation 47666. Up to 6401 conditions per place. [2023-11-06 23:04:13,200 INFO L140 encePairwiseOnDemand]: 284/293 looper letters, 74 selfloop transitions, 20 changer transitions 4/98 dead transitions. [2023-11-06 23:04:13,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 98 transitions, 943 flow [2023-11-06 23:04:13,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2023-11-06 23:04:13,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47013651877133106 [2023-11-06 23:04:13,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2023-11-06 23:04:13,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2023-11-06 23:04:13,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:13,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2023-11-06 23:04:13,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.75) internal successors, (551), 4 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:13,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:13,209 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:13,209 INFO L175 Difference]: Start difference. First operand has 56 places, 59 transitions, 503 flow. Second operand 4 states and 551 transitions. [2023-11-06 23:04:13,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 98 transitions, 943 flow [2023-11-06 23:04:13,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 98 transitions, 937 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-11-06 23:04:13,333 INFO L231 Difference]: Finished difference. Result has 62 places, 68 transitions, 717 flow [2023-11-06 23:04:13,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=62, PETRI_TRANSITIONS=68} [2023-11-06 23:04:13,334 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 23:04:13,334 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 68 transitions, 717 flow [2023-11-06 23:04:13,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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 23:04:13,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:13,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:13,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:04:13,335 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:13,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1705318658, now seen corresponding path program 1 times [2023-11-06 23:04:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325623525] [2023-11-06 23:04:13,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:13,681 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 23:04:13,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:13,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325623525] [2023-11-06 23:04:13,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325623525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:13,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:13,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322454450] [2023-11-06 23:04:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:13,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:13,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2023-11-06 23:04:13,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 68 transitions, 717 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 23:04:13,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:13,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2023-11-06 23:04:13,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:15,002 INFO L124 PetriNetUnfolderBase]: 6495/9800 cut-off events. [2023-11-06 23:04:15,002 INFO L125 PetriNetUnfolderBase]: For 37100/38784 co-relation queries the response was YES. [2023-11-06 23:04:15,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34418 conditions, 9800 events. 6495/9800 cut-off events. For 37100/38784 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 62982 event pairs, 1137 based on Foata normal form. 1169/10566 useless extension candidates. Maximal degree in co-relation 34402. Up to 6414 conditions per place. [2023-11-06 23:04:15,070 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 120 selfloop transitions, 10 changer transitions 14/169 dead transitions. [2023-11-06 23:04:15,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 169 transitions, 1979 flow [2023-11-06 23:04:15,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:04:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2023-11-06 23:04:15,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47030716723549487 [2023-11-06 23:04:15,074 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 689 transitions. [2023-11-06 23:04:15,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 689 transitions. [2023-11-06 23:04:15,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:15,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 689 transitions. [2023-11-06 23:04:15,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.8) internal successors, (689), 5 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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 23:04:15,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states 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 23:04:15,082 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 293.0) internal successors, (1758), 6 states have internal predecessors, (1758), 0 states have call successors, (0), 0 states 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 23:04:15,083 INFO L175 Difference]: Start difference. First operand has 62 places, 68 transitions, 717 flow. Second operand 5 states and 689 transitions. [2023-11-06 23:04:15,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 169 transitions, 1979 flow [2023-11-06 23:04:15,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 169 transitions, 1975 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:15,131 INFO L231 Difference]: Finished difference. Result has 68 places, 77 transitions, 788 flow [2023-11-06 23:04:15,132 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=788, PETRI_PLACES=68, PETRI_TRANSITIONS=77} [2023-11-06 23:04:15,132 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-11-06 23:04:15,132 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 77 transitions, 788 flow [2023-11-06 23:04:15,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states 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 23:04:15,133 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:15,133 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:15,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:04:15,134 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:15,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:15,134 INFO L85 PathProgramCache]: Analyzing trace with hash 680124174, now seen corresponding path program 1 times [2023-11-06 23:04:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653372322] [2023-11-06 23:04:15,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:15,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:15,323 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 23:04:15,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:15,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653372322] [2023-11-06 23:04:15,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653372322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:15,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:15,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:04:15,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425461795] [2023-11-06 23:04:15,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:15,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:15,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:15,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 293 [2023-11-06 23:04:15,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 77 transitions, 788 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 23:04:15,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:15,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 293 [2023-11-06 23:04:15,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:17,013 INFO L124 PetriNetUnfolderBase]: 8914/13790 cut-off events. [2023-11-06 23:04:17,014 INFO L125 PetriNetUnfolderBase]: For 59059/59791 co-relation queries the response was YES. [2023-11-06 23:04:17,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61835 conditions, 13790 events. 8914/13790 cut-off events. For 59059/59791 co-relation queries the response was YES. Maximal size of possible extension queue 823. Compared 93262 event pairs, 3555 based on Foata normal form. 276/13638 useless extension candidates. Maximal degree in co-relation 61815. Up to 6611 conditions per place. [2023-11-06 23:04:17,092 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 69 selfloop transitions, 13 changer transitions 18/112 dead transitions. [2023-11-06 23:04:17,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 112 transitions, 1218 flow [2023-11-06 23:04:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:17,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 23:04:17,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49829351535836175 [2023-11-06 23:04:17,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 23:04:17,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 23:04:17,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:17,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 23:04:17,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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 23:04:17,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:17,098 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 293.0) internal successors, (1172), 4 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states 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 23:04:17,099 INFO L175 Difference]: Start difference. First operand has 68 places, 77 transitions, 788 flow. Second operand 3 states and 438 transitions. [2023-11-06 23:04:17,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 112 transitions, 1218 flow [2023-11-06 23:04:17,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 112 transitions, 1209 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:04:17,247 INFO L231 Difference]: Finished difference. Result has 70 places, 68 transitions, 730 flow [2023-11-06 23:04:17,248 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=783, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=70, PETRI_TRANSITIONS=68} [2023-11-06 23:04:17,248 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-11-06 23:04:17,249 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 68 transitions, 730 flow [2023-11-06 23:04:17,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 23:04:17,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:17,250 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:17,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:04:17,250 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:17,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash -704209304, now seen corresponding path program 1 times [2023-11-06 23:04:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758635035] [2023-11-06 23:04:17,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:17,489 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 23:04:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:17,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758635035] [2023-11-06 23:04:17,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758635035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:17,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:17,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61929974] [2023-11-06 23:04:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:17,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:17,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:17,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:17,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:17,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2023-11-06 23:04:17,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 730 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 23:04:17,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2023-11-06 23:04:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:18,852 INFO L124 PetriNetUnfolderBase]: 4766/7536 cut-off events. [2023-11-06 23:04:18,852 INFO L125 PetriNetUnfolderBase]: For 30024/31198 co-relation queries the response was YES. [2023-11-06 23:04:18,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32219 conditions, 7536 events. 4766/7536 cut-off events. For 30024/31198 co-relation queries the response was YES. Maximal size of possible extension queue 477. Compared 49576 event pairs, 411 based on Foata normal form. 1067/8311 useless extension candidates. Maximal degree in co-relation 32198. Up to 3265 conditions per place. [2023-11-06 23:04:18,887 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 169 selfloop transitions, 15 changer transitions 13/217 dead transitions. [2023-11-06 23:04:18,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 217 transitions, 2691 flow [2023-11-06 23:04:18,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:18,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:04:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 962 transitions. [2023-11-06 23:04:18,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690394929302779 [2023-11-06 23:04:18,891 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 962 transitions. [2023-11-06 23:04:18,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 962 transitions. [2023-11-06 23:04:18,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:18,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 962 transitions. [2023-11-06 23:04:18,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.42857142857142) internal successors, (962), 7 states have internal predecessors, (962), 0 states have call successors, (0), 0 states 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 23:04:18,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 23:04:18,900 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 293.0) internal successors, (2344), 8 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 23:04:18,901 INFO L175 Difference]: Start difference. First operand has 70 places, 68 transitions, 730 flow. Second operand 7 states and 962 transitions. [2023-11-06 23:04:18,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 217 transitions, 2691 flow [2023-11-06 23:04:18,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 217 transitions, 2597 flow, removed 29 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:18,992 INFO L231 Difference]: Finished difference. Result has 76 places, 77 transitions, 827 flow [2023-11-06 23:04:18,992 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=827, PETRI_PLACES=76, PETRI_TRANSITIONS=77} [2023-11-06 23:04:18,993 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places. [2023-11-06 23:04:18,993 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 77 transitions, 827 flow [2023-11-06 23:04:18,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 23:04:18,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:18,994 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 23:04:18,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:04:18,994 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:18,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:18,994 INFO L85 PathProgramCache]: Analyzing trace with hash 294579453, now seen corresponding path program 1 times [2023-11-06 23:04:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184828655] [2023-11-06 23:04:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:18,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:19,211 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 23:04:19,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184828655] [2023-11-06 23:04:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184828655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258501763] [2023-11-06 23:04:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:19,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:19,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:19,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:19,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:19,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2023-11-06 23:04:19,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 77 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:19,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:19,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2023-11-06 23:04:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:20,428 INFO L124 PetriNetUnfolderBase]: 4223/6746 cut-off events. [2023-11-06 23:04:20,428 INFO L125 PetriNetUnfolderBase]: For 30461/32447 co-relation queries the response was YES. [2023-11-06 23:04:20,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33236 conditions, 6746 events. 4223/6746 cut-off events. For 30461/32447 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 44542 event pairs, 219 based on Foata normal form. 913/7393 useless extension candidates. Maximal degree in co-relation 33213. Up to 3018 conditions per place. [2023-11-06 23:04:20,473 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 168 selfloop transitions, 24 changer transitions 42/252 dead transitions. [2023-11-06 23:04:20,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 252 transitions, 3059 flow [2023-11-06 23:04:20,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 23:04:20,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 23:04:20,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1237 transitions. [2023-11-06 23:04:20,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46909366704588545 [2023-11-06 23:04:20,478 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1237 transitions. [2023-11-06 23:04:20,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1237 transitions. [2023-11-06 23:04:20,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:20,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1237 transitions. [2023-11-06 23:04:20,483 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.44444444444446) internal successors, (1237), 9 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states 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 23:04:20,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states 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 23:04:20,489 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 293.0) internal successors, (2930), 10 states have internal predecessors, (2930), 0 states have call successors, (0), 0 states 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 23:04:20,489 INFO L175 Difference]: Start difference. First operand has 76 places, 77 transitions, 827 flow. Second operand 9 states and 1237 transitions. [2023-11-06 23:04:20,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 252 transitions, 3059 flow [2023-11-06 23:04:20,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 252 transitions, 3014 flow, removed 17 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:20,990 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 924 flow [2023-11-06 23:04:20,990 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=782, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=924, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2023-11-06 23:04:20,991 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 34 predicate places. [2023-11-06 23:04:20,991 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 924 flow [2023-11-06 23:04:20,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 23:04:20,992 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:20,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:20,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 23:04:20,992 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:20,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1781972344, now seen corresponding path program 1 times [2023-11-06 23:04:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:20,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145441433] [2023-11-06 23:04:20,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:20,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:21,326 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 23:04:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:21,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145441433] [2023-11-06 23:04:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145441433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:04:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465596344] [2023-11-06 23:04:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:21,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:21,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:21,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 293 [2023-11-06 23:04:21,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 924 flow. Second operand has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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 23:04:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:21,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 293 [2023-11-06 23:04:21,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:22,487 INFO L124 PetriNetUnfolderBase]: 4079/6510 cut-off events. [2023-11-06 23:04:22,487 INFO L125 PetriNetUnfolderBase]: For 33329/34365 co-relation queries the response was YES. [2023-11-06 23:04:22,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32804 conditions, 6510 events. 4079/6510 cut-off events. For 33329/34365 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 43135 event pairs, 203 based on Foata normal form. 531/6776 useless extension candidates. Maximal degree in co-relation 32778. Up to 2149 conditions per place. [2023-11-06 23:04:22,531 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 106 selfloop transitions, 27 changer transitions 110/251 dead transitions. [2023-11-06 23:04:22,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 251 transitions, 3088 flow [2023-11-06 23:04:22,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 23:04:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 23:04:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1488 transitions. [2023-11-06 23:04:22,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46168166304685077 [2023-11-06 23:04:22,538 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1488 transitions. [2023-11-06 23:04:22,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1488 transitions. [2023-11-06 23:04:22,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:22,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1488 transitions. [2023-11-06 23:04:22,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 135.27272727272728) internal successors, (1488), 11 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states 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 23:04:22,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 293.0) internal successors, (3516), 12 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states 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 23:04:22,550 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 293.0) internal successors, (3516), 12 states have internal predecessors, (3516), 0 states have call successors, (0), 0 states 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 23:04:22,551 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 924 flow. Second operand 11 states and 1488 transitions. [2023-11-06 23:04:22,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 251 transitions, 3088 flow [2023-11-06 23:04:23,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 251 transitions, 2846 flow, removed 38 selfloop flow, removed 6 redundant places. [2023-11-06 23:04:23,343 INFO L231 Difference]: Finished difference. Result has 92 places, 60 transitions, 537 flow [2023-11-06 23:04:23,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=788, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=537, PETRI_PLACES=92, PETRI_TRANSITIONS=60} [2023-11-06 23:04:23,344 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places. [2023-11-06 23:04:23,344 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 60 transitions, 537 flow [2023-11-06 23:04:23,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 127.85714285714286) internal successors, (895), 7 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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 23:04:23,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:23,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:23,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 23:04:23,345 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:23,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:23,346 INFO L85 PathProgramCache]: Analyzing trace with hash -586076785, now seen corresponding path program 1 times [2023-11-06 23:04:23,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:23,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680631980] [2023-11-06 23:04:23,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:23,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:04:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680631980] [2023-11-06 23:04:23,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680631980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:23,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:23,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:23,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464797484] [2023-11-06 23:04:23,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:23,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:23,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:23,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:23,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 293 [2023-11-06 23:04:23,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 60 transitions, 537 flow. Second operand has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 23:04:23,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:23,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 293 [2023-11-06 23:04:23,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:24,128 INFO L124 PetriNetUnfolderBase]: 862/1548 cut-off events. [2023-11-06 23:04:24,129 INFO L125 PetriNetUnfolderBase]: For 6411/6460 co-relation queries the response was YES. [2023-11-06 23:04:24,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7627 conditions, 1548 events. 862/1548 cut-off events. For 6411/6460 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8199 event pairs, 185 based on Foata normal form. 27/1556 useless extension candidates. Maximal degree in co-relation 7599. Up to 870 conditions per place. [2023-11-06 23:04:24,138 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 36 selfloop transitions, 1 changer transitions 67/107 dead transitions. [2023-11-06 23:04:24,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 107 transitions, 1133 flow [2023-11-06 23:04:24,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:24,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:24,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 570 transitions. [2023-11-06 23:04:24,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4863481228668942 [2023-11-06 23:04:24,142 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 570 transitions. [2023-11-06 23:04:24,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 570 transitions. [2023-11-06 23:04:24,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:24,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 570 transitions. [2023-11-06 23:04:24,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 0 states have call successors, (0), 0 states 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 23:04:24,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:24,158 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 293.0) internal successors, (1465), 5 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states 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 23:04:24,167 INFO L175 Difference]: Start difference. First operand has 92 places, 60 transitions, 537 flow. Second operand 4 states and 570 transitions. [2023-11-06 23:04:24,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 107 transitions, 1133 flow [2023-11-06 23:04:24,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 881 flow, removed 62 selfloop flow, removed 18 redundant places. [2023-11-06 23:04:24,207 INFO L231 Difference]: Finished difference. Result has 77 places, 38 transitions, 230 flow [2023-11-06 23:04:24,207 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=77, PETRI_TRANSITIONS=38} [2023-11-06 23:04:24,208 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-11-06 23:04:24,208 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 38 transitions, 230 flow [2023-11-06 23:04:24,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states 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 23:04:24,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:24,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:24,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 23:04:24,210 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:24,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1901368595, now seen corresponding path program 2 times [2023-11-06 23:04:24,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:24,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067333515] [2023-11-06 23:04:24,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:24,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:25,594 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 23:04:25,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:04:25,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067333515] [2023-11-06 23:04:25,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067333515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:25,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:25,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856267090] [2023-11-06 23:04:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:25,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:25,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:04:25,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:25,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:25,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 293 [2023-11-06 23:04:25,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 38 transitions, 230 flow. Second operand has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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 23:04:25,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:25,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 293 [2023-11-06 23:04:25,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:25,964 INFO L124 PetriNetUnfolderBase]: 116/240 cut-off events. [2023-11-06 23:04:25,964 INFO L125 PetriNetUnfolderBase]: For 552/558 co-relation queries the response was YES. [2023-11-06 23:04:25,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983 conditions, 240 events. 116/240 cut-off events. For 552/558 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 763 event pairs, 18 based on Foata normal form. 1/237 useless extension candidates. Maximal degree in co-relation 962. Up to 76 conditions per place. [2023-11-06 23:04:25,966 INFO L140 encePairwiseOnDemand]: 286/293 looper letters, 34 selfloop transitions, 4 changer transitions 34/76 dead transitions. [2023-11-06 23:04:25,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 76 transitions, 607 flow [2023-11-06 23:04:25,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:25,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:04:25,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1073 transitions. [2023-11-06 23:04:25,972 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45776450511945393 [2023-11-06 23:04:25,973 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1073 transitions. [2023-11-06 23:04:25,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1073 transitions. [2023-11-06 23:04:25,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:25,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1073 transitions. [2023-11-06 23:04:25,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.125) internal successors, (1073), 8 states have internal predecessors, (1073), 0 states have call successors, (0), 0 states 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 23:04:25,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states 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 23:04:25,985 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 293.0) internal successors, (2637), 9 states have internal predecessors, (2637), 0 states have call successors, (0), 0 states 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 23:04:25,985 INFO L175 Difference]: Start difference. First operand has 77 places, 38 transitions, 230 flow. Second operand 8 states and 1073 transitions. [2023-11-06 23:04:25,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 76 transitions, 607 flow [2023-11-06 23:04:25,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 76 transitions, 507 flow, removed 16 selfloop flow, removed 19 redundant places. [2023-11-06 23:04:25,991 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 179 flow [2023-11-06 23:04:25,991 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=179, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2023-11-06 23:04:25,992 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-11-06 23:04:25,992 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 179 flow [2023-11-06 23:04:25,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.14285714285714) internal successors, (925), 7 states have internal predecessors, (925), 0 states have call successors, (0), 0 states 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 23:04:25,993 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:25,993 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:25,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 23:04:25,994 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:25,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:25,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1400946231, now seen corresponding path program 3 times [2023-11-06 23:04:25,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:04:25,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694652485] [2023-11-06 23:04:25,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:04:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:26,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:04:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:04:26,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:04:26,222 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:04:26,223 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 23:04:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 23:04:26,225 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 23:04:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 23:04:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 23:04:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 23:04:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 23:04:26,226 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 23:04:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 23:04:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 23:04:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 23:04:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 23:04:26,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 23:04:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 23:04:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 23:04:26,228 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 23:04:26,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 23:04:26,229 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:26,236 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:04:26,236 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:04:26,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:04:26 BasicIcfg [2023-11-06 23:04:26,380 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:04:26,380 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:04:26,381 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:04:26,381 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:04:26,381 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:03:41" (3/4) ... [2023-11-06 23:04:26,383 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:04:26,384 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:04:26,385 INFO L158 Benchmark]: Toolchain (without parser) took 46864.74ms. Allocated memory was 117.4MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 69.8MB in the beginning and 3.6GB in the end (delta: -3.6GB). Peak memory consumption was 759.5MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,386 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 117.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:26,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 686.06ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 45.1MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.51ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 45.1MB in the beginning and 123.0MB in the end (delta: -77.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,387 INFO L158 Benchmark]: Boogie Preprocessor took 77.37ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,387 INFO L158 Benchmark]: RCFGBuilder took 890.08ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 78.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,388 INFO L158 Benchmark]: TraceAbstraction took 45077.86ms. Allocated memory was 153.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 78.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 729.6MB. Max. memory is 16.1GB. [2023-11-06 23:04:26,388 INFO L158 Benchmark]: Witness Printer took 4.00ms. Allocated memory is still 4.4GB. Free memory was 3.6GB in the beginning and 3.6GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:04:26,391 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.32ms. Allocated memory is still 117.4MB. Free memory is still 90.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 686.06ms. Allocated memory is still 117.4MB. Free memory was 69.4MB in the beginning and 45.1MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.51ms. Allocated memory was 117.4MB in the beginning and 153.1MB in the end (delta: 35.7MB). Free memory was 45.1MB in the beginning and 123.0MB in the end (delta: -77.9MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.37ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 120.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 890.08ms. Allocated memory is still 153.1MB. Free memory was 120.9MB in the beginning and 78.9MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 45077.86ms. Allocated memory was 153.1MB in the beginning and 4.4GB in the end (delta: 4.3GB). Free memory was 78.1MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 729.6MB. Max. memory is 16.1GB. * Witness Printer took 4.00ms. Allocated memory is still 4.4GB. Free memory was 3.6GB in the beginning and 3.6GB 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: 6.0s, 155 PlacesBefore, 51 PlacesAfterwards, 145 TransitionsBefore, 39 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 144 TotalNumberOfCompositions, 9360 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4458, independent: 4240, independent conditional: 0, independent unconditional: 4240, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2025, independent: 1977, independent conditional: 0, independent unconditional: 1977, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4458, independent: 2263, independent conditional: 0, independent unconditional: 2263, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 2025, unknown conditional: 0, unknown unconditional: 2025] , Statistics on independence cache: Total cache size (in pairs): 182, Positive cache size: 165, Positive conditional cache size: 0, Positive unconditional cache size: 165, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=-3, t213={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=-2, t213={5:0}, t214={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=-1, t213={5:0}, t214={6:0}, t215={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={5:0}, t214={6:0}, t215={7:0}, t216={3:0}, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] 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", "mix008.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 868]: 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: 872]: 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: 870]: 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 9 procedures, 183 locations, 16 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: 44.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 30.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 828 mSDsluCounter, 268 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 214 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3152 IncrementalHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 54 mSDtfsCounter, 3152 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=924occurred in iteration=14, InterpolantAutomatonStates: 89, 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, 6.9s InterpolantComputationTime, 291 NumberOfCodeBlocks, 291 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 248 ConstructedInterpolants, 0 QuantifiedInterpolants, 2094 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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 23:04:26,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:04:29,108 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:04:29,248 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 23:04:29,260 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:04:29,261 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:04:29,304 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:04:29,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:04:29,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:04:29,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:04:29,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:04:29,312 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:04:29,313 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:04:29,313 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:04:29,315 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:04:29,315 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:04:29,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:04:29,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:04:29,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:04:29,317 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:04:29,317 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:04:29,318 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:04:29,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:04:29,319 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:04:29,319 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 23:04:29,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 23:04:29,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:04:29,320 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:04:29,321 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:04:29,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:04:29,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:04:29,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:04:29,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:29,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:04:29,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:04:29,325 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 23:04:29,325 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 23:04:29,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:04:29,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:04:29,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:04:29,327 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 23:04:29,327 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:04:29,327 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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 -> 0e3ed0a0904abf0f880f0f4cc8dc485f79821c4ff1d089df229be68889497ed8 [2023-11-06 23:04:29,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:04:29,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:04:29,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:04:29,778 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:04:29,778 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:04:29,780 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-06 23:04:33,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:04:33,403 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:04:33,407 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/sv-benchmarks/c/pthread-wmm/mix008.opt.i [2023-11-06 23:04:33,446 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/a1af5758d/d51c92f070144a9898a052710ecf61d6/FLAGa6f2ca2b0 [2023-11-06 23:04:33,463 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/data/a1af5758d/d51c92f070144a9898a052710ecf61d6 [2023-11-06 23:04:33,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:04:33,467 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:04:33,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:33,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:04:33,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:04:33,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:33" (1/1) ... [2023-11-06 23:04:33,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13d56a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:33, skipping insertion in model container [2023-11-06 23:04:33,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:04:33" (1/1) ... [2023-11-06 23:04:33,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:04:34,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:34,038 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:04:34,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:04:34,204 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:04:34,205 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 23:04:34,213 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:04:34,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34 WrapperNode [2023-11-06 23:04:34,214 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:04:34,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:34,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:04:34,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:04:34,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,329 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-06 23:04:34,330 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:04:34,331 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:04:34,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:04:34,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:04:34,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,405 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:04:34,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:04:34,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:04:34,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:04:34,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (1/1) ... [2023-11-06 23:04:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:04:34,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:04:34,447 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:04:34,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:04:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 23:04:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:04:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:04:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:04:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 23:04:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 23:04:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 23:04:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 23:04:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 23:04:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 23:04:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 23:04:34,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 23:04:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 23:04:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 23:04:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 23:04:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:04:34,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:04:34,499 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 23:04:34,715 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:04:34,719 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:04:35,205 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:04:35,350 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:04:35,350 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:04:35,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:35 BoogieIcfgContainer [2023-11-06 23:04:35,353 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:04:35,355 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:04:35,355 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:04:35,359 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:04:35,359 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:04:33" (1/3) ... [2023-11-06 23:04:35,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a139663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:35, skipping insertion in model container [2023-11-06 23:04:35,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:04:34" (2/3) ... [2023-11-06 23:04:35,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a139663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:04:35, skipping insertion in model container [2023-11-06 23:04:35,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:35" (3/3) ... [2023-11-06 23:04:35,379 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008.opt.i [2023-11-06 23:04:35,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:04:35,398 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 23:04:35,399 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:04:35,494 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:04:35,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 23:04:35,616 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 23:04:35,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:35,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 23:04:35,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 23:04:35,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 23:04:35,633 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:04:35,643 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 23:04:35,646 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 23:04:35,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 23:04:35,686 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 23:04:35,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:35,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 23:04:35,692 INFO L119 LiptonReduction]: Number of co-enabled transitions 3656 [2023-11-06 23:04:46,890 INFO L134 LiptonReduction]: Checked pairs total: 9396 [2023-11-06 23:04:46,890 INFO L136 LiptonReduction]: Total number of compositions: 144 [2023-11-06 23:04:46,907 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:04:46,914 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;@11ad326c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:04:46,915 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 23:04:46,917 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:04:46,917 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:04:46,917 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:46,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:46,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:04:46,919 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:46,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 659, now seen corresponding path program 1 times [2023-11-06 23:04:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:46,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080139875] [2023-11-06 23:04:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:46,942 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 23:04:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:46,953 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:46,960 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:47,043 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 23:04:47,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:47,052 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 23:04:47,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:47,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:47,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080139875] [2023-11-06 23:04:47,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080139875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:47,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:47,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:04:47,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232394163] [2023-11-06 23:04:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:04:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:04:47,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:04:47,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 294 [2023-11-06 23:04:47,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 23:04:47,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:47,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 294 [2023-11-06 23:04:47,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:48,388 INFO L124 PetriNetUnfolderBase]: 4373/6106 cut-off events. [2023-11-06 23:04:48,388 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 23:04:48,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12192 conditions, 6106 events. 4373/6106 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 31615 event pairs, 4373 based on Foata normal form. 0/5373 useless extension candidates. Maximal degree in co-relation 12180. Up to 5983 conditions per place. [2023-11-06 23:04:48,483 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 23:04:48,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 23:04:48,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:04:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:04:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 23:04:48,501 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221088435374149 [2023-11-06 23:04:48,502 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 23:04:48,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 23:04:48,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:48,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 23:04:48,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 23:04:48,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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 23:04:48,522 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 294.0) internal successors, (882), 3 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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 23:04:48,524 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 307 transitions. [2023-11-06 23:04:48,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 23:04:48,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:04:48,533 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 23:04:48,536 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 23:04:48,540 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 23:04:48,540 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 23:04:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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 23:04:48,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:48,541 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:48,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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)] Ended with exit code 0 [2023-11-06 23:04:48,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:48,753 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:48,754 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1614251609, now seen corresponding path program 1 times [2023-11-06 23:04:48,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:48,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808390445] [2023-11-06 23:04:48,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:48,756 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 23:04:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:48,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:48,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:48,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:48,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:48,974 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 23:04:48,974 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:48,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:48,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808390445] [2023-11-06 23:04:48,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808390445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:48,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:48,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:04:48,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335408978] [2023-11-06 23:04:48,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:48,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:04:48,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:48,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:04:48,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:04:48,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 294 [2023-11-06 23:04:48,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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 23:04:48,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:48,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 294 [2023-11-06 23:04:48,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:49,974 INFO L124 PetriNetUnfolderBase]: 3632/5257 cut-off events. [2023-11-06 23:04:49,975 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:04:49,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10347 conditions, 5257 events. 3632/5257 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 28741 event pairs, 668 based on Foata normal form. 0/4884 useless extension candidates. Maximal degree in co-relation 10344. Up to 3973 conditions per place. [2023-11-06 23:04:50,027 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 34 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-06 23:04:50,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 42 transitions, 168 flow [2023-11-06 23:04:50,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:04:50,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:04:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2023-11-06 23:04:50,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034013605442177 [2023-11-06 23:04:50,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2023-11-06 23:04:50,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2023-11-06 23:04:50,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:50,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2023-11-06 23:04:50,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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 23:04:50,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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 23:04:50,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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 23:04:50,044 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 444 transitions. [2023-11-06 23:04:50,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 42 transitions, 168 flow [2023-11-06 23:04:50,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:04:50,047 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 23:04:50,048 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 23:04:50,049 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 23:04:50,049 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 23:04:50,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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 23:04:50,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:50,050 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:50,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:50,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:50,264 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:50,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash 580458264, now seen corresponding path program 1 times [2023-11-06 23:04:50,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088343160] [2023-11-06 23:04:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:50,267 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 23:04:50,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:50,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:50,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:50,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:50,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 23:04:50,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:50,509 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 23:04:50,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:50,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:50,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088343160] [2023-11-06 23:04:50,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088343160] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:50,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:50,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:50,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117938780] [2023-11-06 23:04:50,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:50,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:50,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:50,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:50,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-06 23:04:50,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 23:04:50,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:50,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-06 23:04:50,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:51,318 INFO L124 PetriNetUnfolderBase]: 2540/3678 cut-off events. [2023-11-06 23:04:51,318 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-06 23:04:51,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7630 conditions, 3678 events. 2540/3678 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 18847 event pairs, 492 based on Foata normal form. 180/3719 useless extension candidates. Maximal degree in co-relation 7626. Up to 2887 conditions per place. [2023-11-06 23:04:51,352 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-11-06 23:04:51,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-11-06 23:04:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:04:51,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 711 transitions. [2023-11-06 23:04:51,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48367346938775513 [2023-11-06 23:04:51,356 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 711 transitions. [2023-11-06 23:04:51,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 711 transitions. [2023-11-06 23:04:51,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:51,358 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 711 transitions. [2023-11-06 23:04:51,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.2) internal successors, (711), 5 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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 23:04:51,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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 23:04:51,367 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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 23:04:51,367 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 711 transitions. [2023-11-06 23:04:51,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-11-06 23:04:51,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:51,371 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-11-06 23:04:51,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-06 23:04:51,373 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-11-06 23:04:51,373 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-11-06 23:04:51,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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 23:04:51,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:51,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:51,395 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:51,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:51,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:51,591 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:51,591 INFO L85 PathProgramCache]: Analyzing trace with hash -540418411, now seen corresponding path program 1 times [2023-11-06 23:04:51,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:51,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [106820033] [2023-11-06 23:04:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:51,592 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 23:04:51,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:51,594 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:51,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:51,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:51,729 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:51,779 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 23:04:51,779 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:51,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:51,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [106820033] [2023-11-06 23:04:51,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [106820033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:51,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:51,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424253159] [2023-11-06 23:04:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:51,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:51,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:51,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:51,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:51,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-06 23:04:51,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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 23:04:51,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:51,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-06 23:04:51,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:52,362 INFO L124 PetriNetUnfolderBase]: 1284/1994 cut-off events. [2023-11-06 23:04:52,362 INFO L125 PetriNetUnfolderBase]: For 871/871 co-relation queries the response was YES. [2023-11-06 23:04:52,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1994 events. 1284/1994 cut-off events. For 871/871 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9771 event pairs, 186 based on Foata normal form. 132/2063 useless extension candidates. Maximal degree in co-relation 5492. Up to 1027 conditions per place. [2023-11-06 23:04:52,380 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-11-06 23:04:52,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-11-06 23:04:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:52,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:04:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 855 transitions. [2023-11-06 23:04:52,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846938775510204 [2023-11-06 23:04:52,386 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 855 transitions. [2023-11-06 23:04:52,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 855 transitions. [2023-11-06 23:04:52,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:52,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 855 transitions. [2023-11-06 23:04:52,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.5) internal successors, (855), 6 states have internal predecessors, (855), 0 states have call successors, (0), 0 states 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 23:04:52,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 23:04:52,396 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 23:04:52,396 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 855 transitions. [2023-11-06 23:04:52,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-11-06 23:04:52,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 23:04:52,409 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-11-06 23:04:52,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-06 23:04:52,410 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 23:04:52,411 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-11-06 23:04:52,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states 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 23:04:52,412 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:52,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:52,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:52,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:52,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:52,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:52,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1185962997, now seen corresponding path program 1 times [2023-11-06 23:04:52,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:52,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117387480] [2023-11-06 23:04:52,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:52,625 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 23:04:52,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:52,626 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:52,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:52,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:52,757 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:52,829 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 23:04:52,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:52,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:52,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117387480] [2023-11-06 23:04:52,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117387480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:52,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:52,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 23:04:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216238042] [2023-11-06 23:04:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:52,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:52,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:52,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:52,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:52,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-06 23:04:52,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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 23:04:52,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:52,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-06 23:04:52,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:53,448 INFO L124 PetriNetUnfolderBase]: 660/1074 cut-off events. [2023-11-06 23:04:53,448 INFO L125 PetriNetUnfolderBase]: For 1240/1240 co-relation queries the response was YES. [2023-11-06 23:04:53,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3500 conditions, 1074 events. 660/1074 cut-off events. For 1240/1240 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4705 event pairs, 124 based on Foata normal form. 56/1111 useless extension candidates. Maximal degree in co-relation 3491. Up to 395 conditions per place. [2023-11-06 23:04:53,460 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-11-06 23:04:53,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-11-06 23:04:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:04:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:04:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 997 transitions. [2023-11-06 23:04:53,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4844509232264334 [2023-11-06 23:04:53,466 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 997 transitions. [2023-11-06 23:04:53,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 997 transitions. [2023-11-06 23:04:53,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:53,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 997 transitions. [2023-11-06 23:04:53,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.42857142857142) internal successors, (997), 7 states have internal predecessors, (997), 0 states have call successors, (0), 0 states 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 23:04:53,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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 23:04:53,480 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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 23:04:53,480 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 997 transitions. [2023-11-06 23:04:53,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-11-06 23:04:53,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 23:04:53,499 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-11-06 23:04:53,500 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-11-06 23:04:53,501 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-11-06 23:04:53,501 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-11-06 23:04:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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 23:04:53,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:53,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:53,517 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:53,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:53,715 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:53,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2121884635, now seen corresponding path program 1 times [2023-11-06 23:04:53,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:53,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397312706] [2023-11-06 23:04:53,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:53,717 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 23:04:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:53,719 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:53,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:53,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 23:04:53,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:53,969 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 23:04:53,969 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:53,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:53,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397312706] [2023-11-06 23:04:53,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397312706] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:53,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:53,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 23:04:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761798774] [2023-11-06 23:04:53,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:53,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 23:04:53,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:53,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 23:04:53,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 23:04:54,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-11-06 23:04:54,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states 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 23:04:54,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:54,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-11-06 23:04:54,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:54,694 INFO L124 PetriNetUnfolderBase]: 528/843 cut-off events. [2023-11-06 23:04:54,694 INFO L125 PetriNetUnfolderBase]: For 950/950 co-relation queries the response was YES. [2023-11-06 23:04:54,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2643 conditions, 843 events. 528/843 cut-off events. For 950/950 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3533 event pairs, 119 based on Foata normal form. 12/847 useless extension candidates. Maximal degree in co-relation 2633. Up to 340 conditions per place. [2023-11-06 23:04:54,704 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-11-06 23:04:54,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-11-06 23:04:54,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 23:04:54,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 23:04:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1115 transitions. [2023-11-06 23:04:54,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47406462585034015 [2023-11-06 23:04:54,711 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1115 transitions. [2023-11-06 23:04:54,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1115 transitions. [2023-11-06 23:04:54,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:54,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1115 transitions. [2023-11-06 23:04:54,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.375) internal successors, (1115), 8 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states 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 23:04:54,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states 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 23:04:54,724 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states 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 23:04:54,724 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1115 transitions. [2023-11-06 23:04:54,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-11-06 23:04:54,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 23:04:54,738 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-11-06 23:04:54,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-06 23:04:54,740 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-11-06 23:04:54,740 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-11-06 23:04:54,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states 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 23:04:54,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:54,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:54,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:54,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:54,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:54,946 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -850041296, now seen corresponding path program 1 times [2023-11-06 23:04:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:54,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015043929] [2023-11-06 23:04:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:54,948 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 23:04:54,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:54,950 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:54,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:55,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:55,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-06 23:04:55,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:56,038 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 23:04:56,038 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:56,038 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:56,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015043929] [2023-11-06 23:04:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015043929] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:56,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:56,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123667856] [2023-11-06 23:04:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:56,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 23:04:56,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 23:04:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 23:04:56,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 294 [2023-11-06 23:04:56,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 23:04:56,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:56,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 294 [2023-11-06 23:04:56,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:57,023 INFO L124 PetriNetUnfolderBase]: 518/845 cut-off events. [2023-11-06 23:04:57,023 INFO L125 PetriNetUnfolderBase]: For 1350/1350 co-relation queries the response was YES. [2023-11-06 23:04:57,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2578 conditions, 845 events. 518/845 cut-off events. For 1350/1350 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3895 event pairs, 11 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 2567. Up to 670 conditions per place. [2023-11-06 23:04:57,034 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 52 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2023-11-06 23:04:57,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 60 transitions, 451 flow [2023-11-06 23:04:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 23:04:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 23:04:57,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2023-11-06 23:04:57,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121315192743764 [2023-11-06 23:04:57,040 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 727 transitions. [2023-11-06 23:04:57,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 727 transitions. [2023-11-06 23:04:57,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:57,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 727 transitions. [2023-11-06 23:04:57,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.16666666666667) internal successors, (727), 6 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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 23:04:57,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 23:04:57,051 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 23:04:57,051 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 6 states and 727 transitions. [2023-11-06 23:04:57,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 60 transitions, 451 flow [2023-11-06 23:04:57,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 60 transitions, 362 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-11-06 23:04:57,059 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 160 flow [2023-11-06 23:04:57,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-11-06 23:04:57,060 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-11-06 23:04:57,060 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 160 flow [2023-11-06 23:04:57,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states 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 23:04:57,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:57,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:57,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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)] Forceful destruction successful, exit code 0 [2023-11-06 23:04:57,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:57,276 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:57,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -778261960, now seen corresponding path program 1 times [2023-11-06 23:04:57,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462417351] [2023-11-06 23:04:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:04:57,278 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 23:04:57,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:57,280 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:57,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:04:57,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:57,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:57,500 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 23:04:57,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:57,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:57,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462417351] [2023-11-06 23:04:57,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462417351] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:57,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:57,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889941134] [2023-11-06 23:04:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:57,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:57,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:57,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:57,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 294 [2023-11-06 23:04:57,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 23:04:57,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:57,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 294 [2023-11-06 23:04:57,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:57,850 INFO L124 PetriNetUnfolderBase]: 932/1482 cut-off events. [2023-11-06 23:04:57,850 INFO L125 PetriNetUnfolderBase]: For 1022/1022 co-relation queries the response was YES. [2023-11-06 23:04:57,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4187 conditions, 1482 events. 932/1482 cut-off events. For 1022/1022 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 7447 event pairs, 443 based on Foata normal form. 1/1464 useless extension candidates. Maximal degree in co-relation 4179. Up to 890 conditions per place. [2023-11-06 23:04:57,858 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 51 selfloop transitions, 2 changer transitions 12/68 dead transitions. [2023-11-06 23:04:57,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 420 flow [2023-11-06 23:04:57,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-11-06 23:04:57,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4812925170068027 [2023-11-06 23:04:57,862 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-11-06 23:04:57,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-11-06 23:04:57,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:57,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-11-06 23:04:57,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states 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 23:04:57,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 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 23:04:57,868 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 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 23:04:57,868 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 160 flow. Second operand 4 states and 566 transitions. [2023-11-06 23:04:57,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 420 flow [2023-11-06 23:04:57,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 410 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 23:04:57,883 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 163 flow [2023-11-06 23:04:57,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-11-06 23:04:57,884 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 23:04:57,884 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 163 flow [2023-11-06 23:04:57,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 23:04:57,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:57,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:57,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,097 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:58,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash 570391712, now seen corresponding path program 2 times [2023-11-06 23:04:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:58,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212660101] [2023-11-06 23:04:58,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 23:04:58,099 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 23:04:58,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:58,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 23:04:58,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:58,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 23:04:58,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:58,353 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 23:04:58,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:58,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212660101] [2023-11-06 23:04:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212660101] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:58,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:58,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 23:04:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619613604] [2023-11-06 23:04:58,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:58,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:04:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:58,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:04:58,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:04:58,380 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 294 [2023-11-06 23:04:58,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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 23:04:58,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:58,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 294 [2023-11-06 23:04:58,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:58,701 INFO L124 PetriNetUnfolderBase]: 485/823 cut-off events. [2023-11-06 23:04:58,701 INFO L125 PetriNetUnfolderBase]: For 725/727 co-relation queries the response was YES. [2023-11-06 23:04:58,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 823 events. 485/823 cut-off events. For 725/727 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3787 event pairs, 95 based on Foata normal form. 2/822 useless extension candidates. Maximal degree in co-relation 2519. Up to 472 conditions per place. [2023-11-06 23:04:58,706 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 48 selfloop transitions, 1 changer transitions 32/84 dead transitions. [2023-11-06 23:04:58,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 84 transitions, 530 flow [2023-11-06 23:04:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:04:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:04:58,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-11-06 23:04:58,710 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4775510204081633 [2023-11-06 23:04:58,710 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-11-06 23:04:58,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-11-06 23:04:58,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:58,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-11-06 23:04:58,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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 23:04:58,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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 23:04:58,718 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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 23:04:58,718 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 163 flow. Second operand 5 states and 702 transitions. [2023-11-06 23:04:58,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 84 transitions, 530 flow [2023-11-06 23:04:58,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 84 transitions, 516 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 23:04:58,727 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 164 flow [2023-11-06 23:04:58,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 23:04:58,728 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 23:04:58,728 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 164 flow [2023-11-06 23:04:58,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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 23:04:58,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:58,729 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:58,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,946 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:58,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:58,947 INFO L85 PathProgramCache]: Analyzing trace with hash -510233038, now seen corresponding path program 3 times [2023-11-06 23:04:58,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:58,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790514731] [2023-11-06 23:04:58,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 23:04:58,948 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 23:04:58,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:58,949 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:58,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:59,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 23:04:59,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 23:04:59,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 23:04:59,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 23:04:59,143 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 23:04:59,144 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 23:04:59,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 23:04:59,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790514731] [2023-11-06 23:04:59,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790514731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:04:59,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:04:59,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:04:59,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399418303] [2023-11-06 23:04:59,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:04:59,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:04:59,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 23:04:59,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:04:59,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:04:59,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 294 [2023-11-06 23:04:59,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 23:04:59,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:04:59,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 294 [2023-11-06 23:04:59,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:04:59,467 INFO L124 PetriNetUnfolderBase]: 735/1226 cut-off events. [2023-11-06 23:04:59,467 INFO L125 PetriNetUnfolderBase]: For 1282/1285 co-relation queries the response was YES. [2023-11-06 23:04:59,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3713 conditions, 1226 events. 735/1226 cut-off events. For 1282/1285 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6116 event pairs, 325 based on Foata normal form. 2/1213 useless extension candidates. Maximal degree in co-relation 3702. Up to 740 conditions per place. [2023-11-06 23:04:59,474 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 39 selfloop transitions, 2 changer transitions 26/70 dead transitions. [2023-11-06 23:04:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 434 flow [2023-11-06 23:04:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 23:04:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 23:04:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-11-06 23:04:59,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2023-11-06 23:04:59,477 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-11-06 23:04:59,477 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-11-06 23:04:59,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:04:59,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-11-06 23:04:59,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states 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 23:04:59,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 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 23:04:59,483 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 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 23:04:59,483 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 164 flow. Second operand 4 states and 568 transitions. [2023-11-06 23:04:59,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 434 flow [2023-11-06 23:04:59,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 70 transitions, 427 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 23:04:59,495 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 169 flow [2023-11-06 23:04:59,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-11-06 23:04:59,496 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-11-06 23:04:59,496 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 169 flow [2023-11-06 23:04:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states 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 23:04:59,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:04:59,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:04:59,509 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:59,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:59,709 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 23:04:59,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:04:59,709 INFO L85 PathProgramCache]: Analyzing trace with hash -106410748, now seen corresponding path program 4 times [2023-11-06 23:04:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 23:04:59,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584262584] [2023-11-06 23:04:59,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 23:04:59,710 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 23:04:59,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 23:04:59,712 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:04:59,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 (12)] Waiting until timeout for monitored process [2023-11-06 23:04:59,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 23:04:59,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 23:04:59,928 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:05:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:05:00,197 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 23:05:00,198 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:05:00,199 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 23:05:00,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 23:05:00,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 23:05:00,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 23:05:00,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 23:05:00,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 23:05:00,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 23:05:00,203 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 23:05:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 23:05:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 23:05:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 23:05:00,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 23:05:00,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 23:05:00,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 23:05:00,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 23:05:00,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 23:05:00,231 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 (12)] Forceful destruction successful, exit code 0 [2023-11-06 23:05:00,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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 23:05:00,426 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:05:00,432 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:05:00,433 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:05:00,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:05:00 BasicIcfg [2023-11-06 23:05:00,583 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:05:00,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:05:00,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:05:00,584 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:05:00,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:04:35" (3/4) ... [2023-11-06 23:05:00,587 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 23:05:00,588 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:05:00,591 INFO L158 Benchmark]: Toolchain (without parser) took 27121.72ms. Allocated memory was 73.4MB in the beginning and 637.5MB in the end (delta: 564.1MB). Free memory was 47.6MB in the beginning and 264.3MB in the end (delta: -216.7MB). Peak memory consumption was 350.0MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,591 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 73.4MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:00,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 746.54ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 47.4MB in the beginning and 64.8MB in the end (delta: -17.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.27ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 61.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,593 INFO L158 Benchmark]: Boogie Preprocessor took 78.74ms. Allocated memory is still 98.6MB. Free memory was 61.9MB in the beginning and 59.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,593 INFO L158 Benchmark]: RCFGBuilder took 942.25ms. Allocated memory is still 98.6MB. Free memory was 59.5MB in the beginning and 38.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,594 INFO L158 Benchmark]: TraceAbstraction took 25228.43ms. Allocated memory was 98.6MB in the beginning and 637.5MB in the end (delta: 539.0MB). Free memory was 38.3MB in the beginning and 264.3MB in the end (delta: -226.0MB). Peak memory consumption was 314.7MB. Max. memory is 16.1GB. [2023-11-06 23:05:00,594 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 637.5MB. Free memory is still 264.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:05:00,596 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.30ms. Allocated memory is still 73.4MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 746.54ms. Allocated memory was 73.4MB in the beginning and 98.6MB in the end (delta: 25.2MB). Free memory was 47.4MB in the beginning and 64.8MB in the end (delta: -17.4MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.27ms. Allocated memory is still 98.6MB. Free memory was 64.8MB in the beginning and 61.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.74ms. Allocated memory is still 98.6MB. Free memory was 61.9MB in the beginning and 59.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 942.25ms. Allocated memory is still 98.6MB. Free memory was 59.5MB in the beginning and 38.9MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 25228.43ms. Allocated memory was 98.6MB in the beginning and 637.5MB in the end (delta: 539.0MB). Free memory was 38.3MB in the beginning and 264.3MB in the end (delta: -226.0MB). Peak memory consumption was 314.7MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 637.5MB. Free memory is still 264.3MB. 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: 11.2s, 156 PlacesBefore, 51 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 3656 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 144 TotalNumberOfCompositions, 9396 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4259, independent: 4051, independent conditional: 0, independent unconditional: 4051, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1982, independent: 1946, independent conditional: 0, independent unconditional: 1946, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4259, independent: 2105, independent conditional: 0, independent unconditional: 2105, dependent: 172, dependent conditional: 0, dependent unconditional: 172, unknown: 1982, unknown conditional: 0, unknown unconditional: 1982] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L867] 0 pthread_t t213; [L868] FCALL, FORK 0 pthread_create(&t213, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t213, ((void *)0), P0, ((void *)0))=32768, t213={-16:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L869] 0 pthread_t t214; [L870] FCALL, FORK 0 pthread_create(&t214, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t214, ((void *)0), P1, ((void *)0))=32769, t213={-16:0}, t214={-12:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L871] 0 pthread_t t215; [L872] FCALL, FORK 0 pthread_create(&t215, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t215, ((void *)0), P2, ((void *)0))=32770, t213={-16:0}, t214={-12:0}, t215={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t216; [L874] FCALL, FORK 0 pthread_create(&t216, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t216, ((void *)0), P3, ((void *)0))=32771, t213={-16:0}, t214={-12:0}, t215={-2:0}, t216={-4:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L813] 4 z$w_buff1 = z$w_buff0 [L814] 4 z$w_buff0 = 1 [L815] 4 z$w_buff1_used = z$w_buff0_used [L816] 4 z$w_buff0_used = (_Bool)1 [L817] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L817] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L818] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L819] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L820] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L821] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L822] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L823] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 z$flush_delayed = weak$$choice2 [L829] 4 z$mem_tmp = z [L830] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L831] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L832] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L833] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L834] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L836] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EAX = z [L838] 4 z = z$flush_delayed ? z$mem_tmp : z [L839] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L842] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L788] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L789] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L790] 3 z$flush_delayed = weak$$choice2 [L791] 3 z$mem_tmp = z [L792] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L793] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L794] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L795] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L798] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 __unbuffered_p2_EBX = z [L800] 3 z = z$flush_delayed ? z$mem_tmp : z [L801] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L845] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L846] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L847] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L848] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L849] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L852] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L854] 4 return 0; [L876] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L878] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L878] RET 0 assume_abort_if_not(main$tmp_guard0) [L880] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L881] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L882] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L883] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L884] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t213={-16:0}, t214={-12:0}, t215={-2:0}, t216={-4:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L887] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L889] 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", "mix008.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={6:5}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 865]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 868]: 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: 872]: 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: 870]: 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 9 procedures, 184 locations, 16 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: 24.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 446 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 357 mSDsluCounter, 114 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1809 IncrementalHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 29 mSDtfsCounter, 1809 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=5, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1495 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 23:05:00,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91f2cf49-f7d2-4b0f-9432-5f3b88644575/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