./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:42:43,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:42:44,075 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:42:44,086 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:42:44,087 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:42:44,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:42:44,115 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:42:44,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:42:44,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:42:44,118 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:42:44,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:42:44,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:42:44,120 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:42:44,121 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:42:44,126 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:42:44,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:42:44,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:42:44,128 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:42:44,128 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:42:44,129 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:42:44,130 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:42:44,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:42:44,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:42:44,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:42:44,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:42:44,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:42:44,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:42:44,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:42:44,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:42:44,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:42:44,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:42:44,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:42:44,140 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:42:44,140 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:42:44,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:42:44,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:42:44,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:42:44,141 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:42:44,142 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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-06 22:42:44,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:42:44,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:42:44,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:42:44,539 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:42:44,540 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:42:44,541 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:42:47,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:42:47,959 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:42:47,959 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:42:47,981 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/8c225355b/a842028361eb4df8b6ce66b25fd44097/FLAG82380266a [2023-11-06 22:42:48,000 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/8c225355b/a842028361eb4df8b6ce66b25fd44097 [2023-11-06 22:42:48,004 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:42:48,005 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:42:48,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:42:48,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:42:48,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:42:48,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@766159de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48, skipping insertion in model container [2023-11-06 22:42:48,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,070 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:42:48,552 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:42:48,567 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:42:48,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:42:48,668 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:42:48,668 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:42:48,676 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:42:48,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48 WrapperNode [2023-11-06 22:42:48,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:42:48,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:42:48,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:42:48,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:42:48,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,746 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-06 22:42:48,748 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:42:48,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:42:48,749 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:42:48,749 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:42:48,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:42:48,785 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:42:48,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:42:48,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:42:48,786 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (1/1) ... [2023-11-06 22:42:48,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:42:48,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:42:48,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:42:48,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:42:48,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:42:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:42:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:42:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:42:48,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:42:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:42:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:42:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:42:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:42:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:42:48,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:42:48,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:42:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:42:48,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:42:48,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:42:48,896 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:42:49,117 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:42:49,119 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:42:49,495 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:42:49,642 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:42:49,643 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:42:49,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:49 BoogieIcfgContainer [2023-11-06 22:42:49,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:42:49,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:42:49,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:42:49,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:42:49,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:42:48" (1/3) ... [2023-11-06 22:42:49,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a04b9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:42:49, skipping insertion in model container [2023-11-06 22:42:49,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:42:48" (2/3) ... [2023-11-06 22:42:49,654 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a04b9f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:42:49, skipping insertion in model container [2023-11-06 22:42:49,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:49" (3/3) ... [2023-11-06 22:42:49,655 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:42:49,676 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:42:49,677 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:42:49,677 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:42:49,742 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:42:49,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:42:49,862 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:42:49,862 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:42:49,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:42:49,877 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 126 transitions, 264 flow [2023-11-06 22:42:49,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 123 transitions, 255 flow [2023-11-06 22:42:49,894 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:42:49,917 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:42:49,923 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 123 transitions, 255 flow [2023-11-06 22:42:49,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 255 flow [2023-11-06 22:42:49,997 INFO L124 PetriNetUnfolderBase]: 3/123 cut-off events. [2023-11-06 22:42:49,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:42:49,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 3/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:42:50,003 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-06 22:42:55,680 INFO L134 LiptonReduction]: Checked pairs total: 5723 [2023-11-06 22:42:55,680 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-11-06 22:42:55,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:42:55,719 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;@1f6b3ec8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:42:55,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:42:55,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:42:55,721 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:42:55,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:42:55,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:42:55,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:42:55,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:42:55,728 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 563, now seen corresponding path program 1 times [2023-11-06 22:42:55,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066953875] [2023-11-06 22:42:55,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:55,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:55,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066953875] [2023-11-06 22:42:55,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066953875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:55,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:55,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:42:55,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889092875] [2023-11-06 22:42:55,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:55,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:42:55,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:55,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:42:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:42:55,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 257 [2023-11-06 22:42:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:42:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 257 [2023-11-06 22:42:55,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:42:56,494 INFO L124 PetriNetUnfolderBase]: 1461/2202 cut-off events. [2023-11-06 22:42:56,494 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-06 22:42:56,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4407 conditions, 2202 events. 1461/2202 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 10503 event pairs, 1461 based on Foata normal form. 80/1874 useless extension candidates. Maximal degree in co-relation 4396. Up to 2151 conditions per place. [2023-11-06 22:42:56,515 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 23 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-11-06 22:42:56,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 105 flow [2023-11-06 22:42:56,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:42:56,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:42:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 256 transitions. [2023-11-06 22:42:56,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4980544747081712 [2023-11-06 22:42:56,531 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 256 transitions. [2023-11-06 22:42:56,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 256 transitions. [2023-11-06 22:42:56,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:42:56,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 256 transitions. [2023-11-06 22:42:56,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.0) internal successors, (256), 2 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:56,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:56,545 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 257.0) internal successors, (771), 3 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:56,547 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 256 transitions. [2023-11-06 22:42:56,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 105 flow [2023-11-06 22:42:56,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:42:56,553 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-11-06 22:42:56,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-06 22:42:56,558 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-11-06 22:42:56,558 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-11-06 22:42:56,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:56,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:42:56,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:42:56,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:42:56,560 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:42:56,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash 533381336, now seen corresponding path program 1 times [2023-11-06 22:42:56,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:56,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537528740] [2023-11-06 22:42:56,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:56,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:56,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537528740] [2023-11-06 22:42:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537528740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:42:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581441822] [2023-11-06 22:42:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:56,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:42:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:56,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:42:56,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:42:56,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 257 [2023-11-06 22:42:56,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:56,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:42:56,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 257 [2023-11-06 22:42:56,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:42:57,307 INFO L124 PetriNetUnfolderBase]: 1143/1780 cut-off events. [2023-11-06 22:42:57,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:42:57,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3521 conditions, 1780 events. 1143/1780 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 8540 event pairs, 317 based on Foata normal form. 0/1584 useless extension candidates. Maximal degree in co-relation 3518. Up to 1363 conditions per place. [2023-11-06 22:42:57,320 INFO L140 encePairwiseOnDemand]: 254/257 looper letters, 31 selfloop transitions, 2 changer transitions 4/39 dead transitions. [2023-11-06 22:42:57,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 160 flow [2023-11-06 22:42:57,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:42:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:42:57,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-11-06 22:42:57,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48508430609597925 [2023-11-06 22:42:57,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-11-06 22:42:57,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-11-06 22:42:57,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:42:57,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-11-06 22:42:57,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:57,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:57,332 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:57,332 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 374 transitions. [2023-11-06 22:42:57,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 160 flow [2023-11-06 22:42:57,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 160 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:42:57,334 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 54 flow [2023-11-06 22:42:57,335 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2023-11-06 22:42:57,335 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-11-06 22:42:57,336 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 54 flow [2023-11-06 22:42:57,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:57,337 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:42:57,337 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:57,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:42:57,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:42:57,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:57,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1345796696, now seen corresponding path program 1 times [2023-11-06 22:42:57,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923405147] [2023-11-06 22:42:57,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:57,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:57,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:57,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923405147] [2023-11-06 22:42:57,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923405147] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:57,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:57,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:42:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128476483] [2023-11-06 22:42:57,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:57,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:42:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:42:57,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:42:57,733 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 257 [2023-11-06 22:42:57,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:57,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:42:57,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 257 [2023-11-06 22:42:57,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:42:58,124 INFO L124 PetriNetUnfolderBase]: 977/1507 cut-off events. [2023-11-06 22:42:58,124 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-06 22:42:58,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3130 conditions, 1507 events. 977/1507 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7011 event pairs, 459 based on Foata normal form. 0/1446 useless extension candidates. Maximal degree in co-relation 3126. Up to 1269 conditions per place. [2023-11-06 22:42:58,156 INFO L140 encePairwiseOnDemand]: 251/257 looper letters, 40 selfloop transitions, 8 changer transitions 0/50 dead transitions. [2023-11-06 22:42:58,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 50 transitions, 216 flow [2023-11-06 22:42:58,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:42:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:42:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2023-11-06 22:42:58,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45136186770428016 [2023-11-06 22:42:58,161 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2023-11-06 22:42:58,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2023-11-06 22:42:58,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:42:58,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2023-11-06 22:42:58,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:58,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:58,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:58,171 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 54 flow. Second operand 5 states and 580 transitions. [2023-11-06 22:42:58,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 50 transitions, 216 flow [2023-11-06 22:42:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 50 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:42:58,173 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 108 flow [2023-11-06 22:42:58,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-11-06 22:42:58,175 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-11-06 22:42:58,175 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 108 flow [2023-11-06 22:42:58,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:58,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:42:58,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:58,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:42:58,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:42:58,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1229974183, now seen corresponding path program 1 times [2023-11-06 22:42:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463560289] [2023-11-06 22:42:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:42:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463560289] [2023-11-06 22:42:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463560289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:58,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:42:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053396546] [2023-11-06 22:42:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:58,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:42:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:42:58,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:42:59,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 257 [2023-11-06 22:42:59,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 108 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:42:59,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 257 [2023-11-06 22:42:59,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:42:59,509 INFO L124 PetriNetUnfolderBase]: 773/1282 cut-off events. [2023-11-06 22:42:59,509 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2023-11-06 22:42:59,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3082 conditions, 1282 events. 773/1282 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6385 event pairs, 16 based on Foata normal form. 124/1406 useless extension candidates. Maximal degree in co-relation 3075. Up to 904 conditions per place. [2023-11-06 22:42:59,522 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 34 selfloop transitions, 5 changer transitions 3/44 dead transitions. [2023-11-06 22:42:59,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 225 flow [2023-11-06 22:42:59,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:42:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:42:59,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 622 transitions. [2023-11-06 22:42:59,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4033722438391699 [2023-11-06 22:42:59,527 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 622 transitions. [2023-11-06 22:42:59,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 622 transitions. [2023-11-06 22:42:59,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:42:59,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 622 transitions. [2023-11-06 22:42:59,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.66666666666667) internal successors, (622), 6 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,536 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,536 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 108 flow. Second operand 6 states and 622 transitions. [2023-11-06 22:42:59,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 225 flow [2023-11-06 22:42:59,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 44 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:42:59,543 INFO L231 Difference]: Finished difference. Result has 40 places, 23 transitions, 82 flow [2023-11-06 22:42:59,543 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=82, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2023-11-06 22:42:59,545 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-06 22:42:59,545 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 23 transitions, 82 flow [2023-11-06 22:42:59,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:42:59,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:42:59,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:42:59,547 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:42:59,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:42:59,548 INFO L85 PathProgramCache]: Analyzing trace with hash 628749706, now seen corresponding path program 1 times [2023-11-06 22:42:59,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:42:59,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289762129] [2023-11-06 22:42:59,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:42:59,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:42:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:42:59,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 22:42:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:42:59,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289762129] [2023-11-06 22:42:59,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289762129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:42:59,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:42:59,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:42:59,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83207700] [2023-11-06 22:42:59,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:42:59,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:42:59,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:42:59,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:42:59,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:42:59,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 257 [2023-11-06 22:42:59,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 23 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:42:59,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:42:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 257 [2023-11-06 22:42:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:00,368 INFO L124 PetriNetUnfolderBase]: 1136/1721 cut-off events. [2023-11-06 22:43:00,369 INFO L125 PetriNetUnfolderBase]: For 1027/1027 co-relation queries the response was YES. [2023-11-06 22:43:00,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4175 conditions, 1721 events. 1136/1721 cut-off events. For 1027/1027 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8023 event pairs, 116 based on Foata normal form. 76/1795 useless extension candidates. Maximal degree in co-relation 4168. Up to 853 conditions per place. [2023-11-06 22:43:00,385 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 46 selfloop transitions, 8 changer transitions 28/83 dead transitions. [2023-11-06 22:43:00,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 83 transitions, 414 flow [2023-11-06 22:43:00,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:43:00,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1021 transitions. [2023-11-06 22:43:00,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4414180717682663 [2023-11-06 22:43:00,390 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1021 transitions. [2023-11-06 22:43:00,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1021 transitions. [2023-11-06 22:43:00,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:00,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1021 transitions. [2023-11-06 22:43:00,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 113.44444444444444) internal successors, (1021), 9 states have internal predecessors, (1021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:00,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:00,402 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:00,403 INFO L175 Difference]: Start difference. First operand has 40 places, 23 transitions, 82 flow. Second operand 9 states and 1021 transitions. [2023-11-06 22:43:00,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 83 transitions, 414 flow [2023-11-06 22:43:00,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 83 transitions, 391 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-06 22:43:00,409 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 146 flow [2023-11-06 22:43:00,409 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-11-06 22:43:00,410 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-06 22:43:00,410 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 146 flow [2023-11-06 22:43:00,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:00,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:00,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:00,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:43:00,412 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:00,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1229976022, now seen corresponding path program 1 times [2023-11-06 22:43:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:00,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485593229] [2023-11-06 22:43:00,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:00,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:00,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:00,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:00,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485593229] [2023-11-06 22:43:00,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485593229] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:00,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:00,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:00,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136623946] [2023-11-06 22:43:00,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:00,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:00,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:00,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:00,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:00,608 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 257 [2023-11-06 22:43:00,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:00,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:00,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 257 [2023-11-06 22:43:00,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:01,515 INFO L124 PetriNetUnfolderBase]: 1674/2621 cut-off events. [2023-11-06 22:43:01,516 INFO L125 PetriNetUnfolderBase]: For 5901/5904 co-relation queries the response was YES. [2023-11-06 22:43:01,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8083 conditions, 2621 events. 1674/2621 cut-off events. For 5901/5904 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 13933 event pairs, 246 based on Foata normal form. 133/2744 useless extension candidates. Maximal degree in co-relation 8070. Up to 1032 conditions per place. [2023-11-06 22:43:01,549 INFO L140 encePairwiseOnDemand]: 250/257 looper letters, 56 selfloop transitions, 14 changer transitions 34/106 dead transitions. [2023-11-06 22:43:01,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 106 transitions, 726 flow [2023-11-06 22:43:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:43:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1027 transitions. [2023-11-06 22:43:01,556 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440121054907047 [2023-11-06 22:43:01,556 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1027 transitions. [2023-11-06 22:43:01,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1027 transitions. [2023-11-06 22:43:01,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:01,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1027 transitions. [2023-11-06 22:43:01,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.11111111111111) internal successors, (1027), 9 states have internal predecessors, (1027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:01,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:01,569 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:01,569 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 146 flow. Second operand 9 states and 1027 transitions. [2023-11-06 22:43:01,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 106 transitions, 726 flow [2023-11-06 22:43:01,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 106 transitions, 680 flow, removed 20 selfloop flow, removed 4 redundant places. [2023-11-06 22:43:01,606 INFO L231 Difference]: Finished difference. Result has 55 places, 39 transitions, 303 flow [2023-11-06 22:43:01,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=303, PETRI_PLACES=55, PETRI_TRANSITIONS=39} [2023-11-06 22:43:01,610 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2023-11-06 22:43:01,614 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 39 transitions, 303 flow [2023-11-06 22:43:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.2) internal successors, (531), 5 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:01,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:01,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:01,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:43:01,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:01,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:01,616 INFO L85 PathProgramCache]: Analyzing trace with hash -525820251, now seen corresponding path program 1 times [2023-11-06 22:43:01,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:01,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665812921] [2023-11-06 22:43:01,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:01,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:01,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:01,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665812921] [2023-11-06 22:43:01,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665812921] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:01,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:01,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137083196] [2023-11-06 22:43:01,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:01,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:01,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:01,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:01,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:01,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 257 [2023-11-06 22:43:01,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 39 transitions, 303 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:01,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:01,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 257 [2023-11-06 22:43:01,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:02,346 INFO L124 PetriNetUnfolderBase]: 1284/2057 cut-off events. [2023-11-06 22:43:02,346 INFO L125 PetriNetUnfolderBase]: For 7324/7341 co-relation queries the response was YES. [2023-11-06 22:43:02,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7127 conditions, 2057 events. 1284/2057 cut-off events. For 7324/7341 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10515 event pairs, 308 based on Foata normal form. 69/2121 useless extension candidates. Maximal degree in co-relation 7110. Up to 1593 conditions per place. [2023-11-06 22:43:02,371 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 35 selfloop transitions, 6 changer transitions 14/59 dead transitions. [2023-11-06 22:43:02,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 59 transitions, 491 flow [2023-11-06 22:43:02,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:43:02,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2023-11-06 22:43:02,374 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443579766536965 [2023-11-06 22:43:02,374 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2023-11-06 22:43:02,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2023-11-06 22:43:02,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:02,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2023-11-06 22:43:02,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:02,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:02,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:02,380 INFO L175 Difference]: Start difference. First operand has 55 places, 39 transitions, 303 flow. Second operand 5 states and 571 transitions. [2023-11-06 22:43:02,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 59 transitions, 491 flow [2023-11-06 22:43:02,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 443 flow, removed 24 selfloop flow, removed 4 redundant places. [2023-11-06 22:43:02,408 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 276 flow [2023-11-06 22:43:02,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2023-11-06 22:43:02,409 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-11-06 22:43:02,409 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 276 flow [2023-11-06 22:43:02,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:02,410 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:02,410 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:02,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:43:02,410 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:02,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:02,411 INFO L85 PathProgramCache]: Analyzing trace with hash -123037081, now seen corresponding path program 1 times [2023-11-06 22:43:02,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:02,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89917659] [2023-11-06 22:43:02,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:02,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:02,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89917659] [2023-11-06 22:43:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89917659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:43:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036451492] [2023-11-06 22:43:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:02,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:43:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:43:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:43:02,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 257 [2023-11-06 22:43:02,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:02,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:02,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 257 [2023-11-06 22:43:02,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:03,379 INFO L124 PetriNetUnfolderBase]: 1418/2196 cut-off events. [2023-11-06 22:43:03,380 INFO L125 PetriNetUnfolderBase]: For 5082/5090 co-relation queries the response was YES. [2023-11-06 22:43:03,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7252 conditions, 2196 events. 1418/2196 cut-off events. For 5082/5090 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10727 event pairs, 351 based on Foata normal form. 62/2252 useless extension candidates. Maximal degree in co-relation 7235. Up to 769 conditions per place. [2023-11-06 22:43:03,411 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 34 selfloop transitions, 6 changer transitions 30/72 dead transitions. [2023-11-06 22:43:03,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 72 transitions, 565 flow [2023-11-06 22:43:03,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:43:03,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2023-11-06 22:43:03,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.440337224383917 [2023-11-06 22:43:03,416 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2023-11-06 22:43:03,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2023-11-06 22:43:03,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:03,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2023-11-06 22:43:03,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:03,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:03,425 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:03,425 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 276 flow. Second operand 6 states and 679 transitions. [2023-11-06 22:43:03,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 72 transitions, 565 flow [2023-11-06 22:43:03,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 72 transitions, 549 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:43:03,441 INFO L231 Difference]: Finished difference. Result has 57 places, 30 transitions, 205 flow [2023-11-06 22:43:03,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=205, PETRI_PLACES=57, PETRI_TRANSITIONS=30} [2023-11-06 22:43:03,446 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-11-06 22:43:03,446 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 205 flow [2023-11-06 22:43:03,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:03,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:03,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:03,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:43:03,448 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:03,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1464712708, now seen corresponding path program 1 times [2023-11-06 22:43:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873325104] [2023-11-06 22:43:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873325104] [2023-11-06 22:43:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873325104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389485426] [2023-11-06 22:43:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:03,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:03,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:03,703 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-11-06 22:43:03,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 30 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:03,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:03,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-11-06 22:43:03,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:04,065 INFO L124 PetriNetUnfolderBase]: 587/962 cut-off events. [2023-11-06 22:43:04,066 INFO L125 PetriNetUnfolderBase]: For 3195/3201 co-relation queries the response was YES. [2023-11-06 22:43:04,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3353 conditions, 962 events. 587/962 cut-off events. For 3195/3201 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4190 event pairs, 239 based on Foata normal form. 45/992 useless extension candidates. Maximal degree in co-relation 3334. Up to 702 conditions per place. [2023-11-06 22:43:04,077 INFO L140 encePairwiseOnDemand]: 253/257 looper letters, 32 selfloop transitions, 5 changer transitions 15/56 dead transitions. [2023-11-06 22:43:04,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 415 flow [2023-11-06 22:43:04,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:04,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:43:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-06 22:43:04,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591439688715953 [2023-11-06 22:43:04,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-06 22:43:04,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-06 22:43:04,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:04,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-06 22:43:04,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,092 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,092 INFO L175 Difference]: Start difference. First operand has 57 places, 30 transitions, 205 flow. Second operand 5 states and 590 transitions. [2023-11-06 22:43:04,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 415 flow [2023-11-06 22:43:04,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 56 transitions, 348 flow, removed 20 selfloop flow, removed 10 redundant places. [2023-11-06 22:43:04,104 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 175 flow [2023-11-06 22:43:04,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-11-06 22:43:04,105 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-11-06 22:43:04,105 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 175 flow [2023-11-06 22:43:04,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,106 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:04,106 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:04,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:43:04,107 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:04,107 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:04,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1891872836, now seen corresponding path program 1 times [2023-11-06 22:43:04,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477184134] [2023-11-06 22:43:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:04,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477184134] [2023-11-06 22:43:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477184134] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:04,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887689712] [2023-11-06 22:43:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:04,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:04,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:04,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:04,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 257 [2023-11-06 22:43:04,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 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 22:43:04,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:04,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 257 [2023-11-06 22:43:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:04,703 INFO L124 PetriNetUnfolderBase]: 835/1291 cut-off events. [2023-11-06 22:43:04,704 INFO L125 PetriNetUnfolderBase]: For 2195/2195 co-relation queries the response was YES. [2023-11-06 22:43:04,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 1291 events. 835/1291 cut-off events. For 2195/2195 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5250 event pairs, 215 based on Foata normal form. 36/1322 useless extension candidates. Maximal degree in co-relation 4006. Up to 406 conditions per place. [2023-11-06 22:43:04,713 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 27 selfloop transitions, 3 changer transitions 26/57 dead transitions. [2023-11-06 22:43:04,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 385 flow [2023-11-06 22:43:04,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:43:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:43:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-11-06 22:43:04,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4487678339818418 [2023-11-06 22:43:04,717 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-11-06 22:43:04,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-11-06 22:43:04,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:04,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-11-06 22:43:04,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,725 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 257.0) internal successors, (1799), 7 states have internal predecessors, (1799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,725 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 175 flow. Second operand 6 states and 692 transitions. [2023-11-06 22:43:04,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 385 flow [2023-11-06 22:43:04,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 369 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 22:43:04,733 INFO L231 Difference]: Finished difference. Result has 54 places, 21 transitions, 113 flow [2023-11-06 22:43:04,733 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=54, PETRI_TRANSITIONS=21} [2023-11-06 22:43:04,734 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2023-11-06 22:43:04,734 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 21 transitions, 113 flow [2023-11-06 22:43:04,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 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 22:43:04,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:04,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:04,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:43:04,735 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:04,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:04,736 INFO L85 PathProgramCache]: Analyzing trace with hash -528704435, now seen corresponding path program 1 times [2023-11-06 22:43:04,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:04,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979333174] [2023-11-06 22:43:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:04,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:04,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979333174] [2023-11-06 22:43:04,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979333174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:04,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:04,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190871500] [2023-11-06 22:43:04,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:04,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:04,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-11-06 22:43:04,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 21 transitions, 113 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:04,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:04,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-11-06 22:43:04,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:05,021 INFO L124 PetriNetUnfolderBase]: 188/330 cut-off events. [2023-11-06 22:43:05,021 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2023-11-06 22:43:05,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1117 conditions, 330 events. 188/330 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 49 based on Foata normal form. 15/344 useless extension candidates. Maximal degree in co-relation 1101. Up to 290 conditions per place. [2023-11-06 22:43:05,026 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 25 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2023-11-06 22:43:05,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 219 flow [2023-11-06 22:43:05,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:43:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-11-06 22:43:05,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46303501945525294 [2023-11-06 22:43:05,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-11-06 22:43:05,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-11-06 22:43:05,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:05,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-11-06 22:43:05,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,034 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 257.0) internal successors, (1028), 4 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,035 INFO L175 Difference]: Start difference. First operand has 54 places, 21 transitions, 113 flow. Second operand 3 states and 357 transitions. [2023-11-06 22:43:05,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 219 flow [2023-11-06 22:43:05,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 153 flow, removed 15 selfloop flow, removed 16 redundant places. [2023-11-06 22:43:05,039 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 91 flow [2023-11-06 22:43:05,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-11-06 22:43:05,040 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -4 predicate places. [2023-11-06 22:43:05,041 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 91 flow [2023-11-06 22:43:05,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:05,041 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:05,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:43:05,042 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:05,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:05,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1132322068, now seen corresponding path program 1 times [2023-11-06 22:43:05,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:05,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865229189] [2023-11-06 22:43:05,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:05,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:05,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:05,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865229189] [2023-11-06 22:43:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865229189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584629856] [2023-11-06 22:43:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:05,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:05,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-11-06 22:43:05,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:05,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-11-06 22:43:05,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:05,410 INFO L124 PetriNetUnfolderBase]: 74/158 cut-off events. [2023-11-06 22:43:05,410 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-06 22:43:05,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 475 conditions, 158 events. 74/158 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 424 event pairs, 18 based on Foata normal form. 17/174 useless extension candidates. Maximal degree in co-relation 467. Up to 78 conditions per place. [2023-11-06 22:43:05,413 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 29 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2023-11-06 22:43:05,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 212 flow [2023-11-06 22:43:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:43:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:43:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2023-11-06 22:43:05,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4601167315175097 [2023-11-06 22:43:05,417 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 473 transitions. [2023-11-06 22:43:05,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 473 transitions. [2023-11-06 22:43:05,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:05,418 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 473 transitions. [2023-11-06 22:43:05,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.25) internal successors, (473), 4 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,424 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 257.0) internal successors, (1285), 5 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,424 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 91 flow. Second operand 4 states and 473 transitions. [2023-11-06 22:43:05,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 212 flow [2023-11-06 22:43:05,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:43:05,426 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 127 flow [2023-11-06 22:43:05,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:43:05,428 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-06 22:43:05,428 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 127 flow [2023-11-06 22:43:05,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:05,429 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 22:43:05,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:43:05,429 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:05,430 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:05,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1923564725, now seen corresponding path program 1 times [2023-11-06 22:43:05,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:05,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769187665] [2023-11-06 22:43:05,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:05,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:05,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:05,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769187665] [2023-11-06 22:43:05,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769187665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:05,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:43:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922748243] [2023-11-06 22:43:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:05,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:05,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:05,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:05,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 257 [2023-11-06 22:43:05,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:05,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 257 [2023-11-06 22:43:05,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:05,885 INFO L124 PetriNetUnfolderBase]: 48/106 cut-off events. [2023-11-06 22:43:05,886 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-06 22:43:05,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 106 events. 48/106 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 252 event pairs, 14 based on Foata normal form. 7/112 useless extension candidates. Maximal degree in co-relation 349. Up to 40 conditions per place. [2023-11-06 22:43:05,888 INFO L140 encePairwiseOnDemand]: 252/257 looper letters, 26 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2023-11-06 22:43:05,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 236 flow [2023-11-06 22:43:05,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:43:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2023-11-06 22:43:05,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4529182879377432 [2023-11-06 22:43:05,892 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2023-11-06 22:43:05,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2023-11-06 22:43:05,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:05,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2023-11-06 22:43:05,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 257.0) internal successors, (1542), 6 states have internal predecessors, (1542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,901 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 127 flow. Second operand 5 states and 582 transitions. [2023-11-06 22:43:05,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 236 flow [2023-11-06 22:43:05,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 38 transitions, 197 flow, removed 12 selfloop flow, removed 5 redundant places. [2023-11-06 22:43:05,903 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 127 flow [2023-11-06 22:43:05,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2023-11-06 22:43:05,905 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-11-06 22:43:05,905 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 127 flow [2023-11-06 22:43:05,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.4) internal successors, (562), 5 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:05,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:05,906 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:05,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:43:05,906 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:05,907 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:05,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1616181463, now seen corresponding path program 1 times [2023-11-06 22:43:05,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:05,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361539448] [2023-11-06 22:43:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:06,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:43:06,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361539448] [2023-11-06 22:43:06,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361539448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:06,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:06,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:43:06,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036062535] [2023-11-06 22:43:06,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:06,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:43:06,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:43:06,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:43:06,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:43:07,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 257 [2023-11-06 22:43:07,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 127 flow. Second operand has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:07,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:07,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 257 [2023-11-06 22:43:07,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:07,282 INFO L124 PetriNetUnfolderBase]: 56/132 cut-off events. [2023-11-06 22:43:07,283 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-06 22:43:07,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 132 events. 56/132 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 359 event pairs, 11 based on Foata normal form. 1/133 useless extension candidates. Maximal degree in co-relation 426. Up to 55 conditions per place. [2023-11-06 22:43:07,284 INFO L140 encePairwiseOnDemand]: 249/257 looper letters, 27 selfloop transitions, 5 changer transitions 19/53 dead transitions. [2023-11-06 22:43:07,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 369 flow [2023-11-06 22:43:07,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:43:07,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:43:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 947 transitions. [2023-11-06 22:43:07,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40942498919152615 [2023-11-06 22:43:07,293 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 947 transitions. [2023-11-06 22:43:07,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 947 transitions. [2023-11-06 22:43:07,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:07,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 947 transitions. [2023-11-06 22:43:07,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:07,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:07,304 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 257.0) internal successors, (2570), 10 states have internal predecessors, (2570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:07,304 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 127 flow. Second operand 9 states and 947 transitions. [2023-11-06 22:43:07,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 369 flow [2023-11-06 22:43:07,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 313 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 22:43:07,307 INFO L231 Difference]: Finished difference. Result has 48 places, 27 transitions, 121 flow [2023-11-06 22:43:07,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=257, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=121, PETRI_PLACES=48, PETRI_TRANSITIONS=27} [2023-11-06 22:43:07,308 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2023-11-06 22:43:07,308 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 27 transitions, 121 flow [2023-11-06 22:43:07,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.375) internal successors, (827), 8 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:07,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:07,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:07,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:43:07,310 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:07,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:07,310 INFO L85 PathProgramCache]: Analyzing trace with hash -464846353, now seen corresponding path program 2 times [2023-11-06 22:43:07,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:43:07,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206960113] [2023-11-06 22:43:07,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:07,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:43:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:43:07,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:43:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:43:07,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:43:07,462 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:43:07,463 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:43:07,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:43:07,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:43:07,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:43:07,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:43:07,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:43:07,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:43:07,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:43:07,466 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:43:07,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:43:07,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:43:07,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:43:07,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:43:07,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:43:07,468 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:07,474 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:43:07,474 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:43:07,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:43:07 BasicIcfg [2023-11-06 22:43:07,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:43:07,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:43:07,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:43:07,561 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:43:07,562 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:42:49" (3/4) ... [2023-11-06 22:43:07,564 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:43:07,565 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:43:07,566 INFO L158 Benchmark]: Toolchain (without parser) took 19560.38ms. Allocated memory was 161.5MB in the beginning and 392.2MB in the end (delta: 230.7MB). Free memory was 121.5MB in the beginning and 171.0MB in the end (delta: -49.5MB). Peak memory consumption was 181.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,566 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:43:07,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.92ms. Allocated memory is still 161.5MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 909.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.32ms. Allocated memory is still 161.5MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,567 INFO L158 Benchmark]: Boogie Preprocessor took 35.36ms. Allocated memory is still 161.5MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,568 INFO L158 Benchmark]: RCFGBuilder took 860.87ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 80.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,568 INFO L158 Benchmark]: TraceAbstraction took 17912.07ms. Allocated memory was 161.5MB in the beginning and 392.2MB in the end (delta: 230.7MB). Free memory was 79.4MB in the beginning and 172.0MB in the end (delta: -92.6MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,569 INFO L158 Benchmark]: Witness Printer took 4.09ms. Allocated memory is still 392.2MB. Free memory was 172.0MB in the beginning and 171.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:07,573 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 117.4MB. Free memory is still 89.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 669.92ms. Allocated memory is still 161.5MB. Free memory was 121.5MB in the beginning and 120.6MB in the end (delta: 909.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.32ms. Allocated memory is still 161.5MB. Free memory was 120.6MB in the beginning and 118.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.36ms. Allocated memory is still 161.5MB. Free memory was 118.1MB in the beginning and 116.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 860.87ms. Allocated memory is still 161.5MB. Free memory was 116.0MB in the beginning and 80.3MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17912.07ms. Allocated memory was 161.5MB in the beginning and 392.2MB in the end (delta: 230.7MB). Free memory was 79.4MB in the beginning and 172.0MB in the end (delta: -92.6MB). Peak memory consumption was 139.9MB. Max. memory is 16.1GB. * Witness Printer took 4.09ms. Allocated memory is still 392.2MB. Free memory was 172.0MB in the beginning and 171.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 130 PlacesBefore, 41 PlacesAfterwards, 123 TransitionsBefore, 32 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 6 FixpointIterations, 49 TrivialSequentialCompositions, 70 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 5723 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2719, independent: 2569, independent conditional: 0, independent unconditional: 2569, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1267, independent: 1241, independent conditional: 0, independent unconditional: 1241, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2719, independent: 1328, independent conditional: 0, independent unconditional: 1328, dependent: 124, dependent conditional: 0, dependent unconditional: 124, unknown: 1267, unknown conditional: 0, unknown unconditional: 1267] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=7, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=8, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=9, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe012_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 729 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 568 mSDsluCounter, 324 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 233 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1466 IncrementalHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 91 mSDtfsCounter, 1466 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=6, InterpolantAutomatonStates: 77, 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.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1091 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:43:07,629 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:43:10,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:43:10,934 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:43:10,945 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:43:10,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:43:11,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:43:11,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:43:11,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:43:11,005 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:43:11,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:43:11,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:43:11,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:43:11,009 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:43:11,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:43:11,011 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:43:11,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:43:11,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:43:11,013 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:43:11,014 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:43:11,015 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:43:11,015 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:43:11,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:43:11,017 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:43:11,017 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:43:11,018 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:43:11,019 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:43:11,019 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:43:11,020 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:43:11,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:43:11,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:43:11,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:43:11,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:43:11,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:43:11,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:43:11,024 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:43:11,024 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:43:11,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:43:11,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:43:11,025 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:43:11,026 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:43:11,026 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:43:11,026 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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-06 22:43:11,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:43:11,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:43:11,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:43:11,582 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:43:11,582 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:43:11,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:43:15,561 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:43:16,049 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:43:16,056 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:43:16,093 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/1fd609e09/5fc6b68ef7e346978037314b61348ae3/FLAG64f5026cd [2023-11-06 22:43:16,119 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/data/1fd609e09/5fc6b68ef7e346978037314b61348ae3 [2023-11-06 22:43:16,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:43:16,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:43:16,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:43:16,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:43:16,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:43:16,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:16" (1/1) ... [2023-11-06 22:43:16,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50d8ec5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:16, skipping insertion in model container [2023-11-06 22:43:16,143 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:16" (1/1) ... [2023-11-06 22:43:16,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:43:16,876 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:43:16,902 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:43:16,991 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:43:17,046 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:43:17,047 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:43:17,057 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:43:17,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17 WrapperNode [2023-11-06 22:43:17,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:43:17,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:43:17,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:43:17,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:43:17,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,158 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-06 22:43:17,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:43:17,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:43:17,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:43:17,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:43:17,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,235 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,281 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:43:17,282 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:43:17,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:43:17,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:43:17,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (1/1) ... [2023-11-06 22:43:17,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:43:17,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:43:17,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:43:17,376 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:43:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:43:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:43:17,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:43:17,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:43:17,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:43:17,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:43:17,417 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:43:17,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:43:17,417 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:43:17,417 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:43:17,418 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:43:17,418 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:43:17,420 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:43:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:43:17,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:43:17,423 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:43:17,631 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:43:17,633 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:43:18,287 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:43:18,518 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:43:18,519 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:43:18,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:18 BoogieIcfgContainer [2023-11-06 22:43:18,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:43:18,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:43:18,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:43:18,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:43:18,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:43:16" (1/3) ... [2023-11-06 22:43:18,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c892ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:18, skipping insertion in model container [2023-11-06 22:43:18,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:17" (2/3) ... [2023-11-06 22:43:18,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c892ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:18, skipping insertion in model container [2023-11-06 22:43:18,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:18" (3/3) ... [2023-11-06 22:43:18,539 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-06 22:43:18,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:43:18,563 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-06 22:43:18,564 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:43:18,655 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:43:18,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:43:18,823 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:43:18,824 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:43:18,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:43:18,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 127 transitions, 266 flow [2023-11-06 22:43:18,843 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 124 transitions, 257 flow [2023-11-06 22:43:18,849 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:43:18,874 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:43:18,880 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 124 transitions, 257 flow [2023-11-06 22:43:18,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 124 transitions, 257 flow [2023-11-06 22:43:18,968 INFO L124 PetriNetUnfolderBase]: 3/124 cut-off events. [2023-11-06 22:43:18,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:43:18,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 124 events. 3/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2023-11-06 22:43:18,974 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-06 22:43:30,842 INFO L134 LiptonReduction]: Checked pairs total: 5856 [2023-11-06 22:43:30,843 INFO L136 LiptonReduction]: Total number of compositions: 129 [2023-11-06 22:43:30,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:43:30,872 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;@453f18a8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:43:30,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-06 22:43:30,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:43:30,876 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 22:43:30,876 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:43:30,877 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:30,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:43:30,878 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:30,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:30,885 INFO L85 PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times [2023-11-06 22:43:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733399631] [2023-11-06 22:43:30,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:30,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:30,910 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:30,917 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:43:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:31,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:43:31,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:31,048 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:31,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:31,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733399631] [2023-11-06 22:43:31,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733399631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:31,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:31,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:43:31,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228749235] [2023-11-06 22:43:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:31,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:43:31,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:43:31,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:43:31,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 256 [2023-11-06 22:43:31,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:31,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:31,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 256 [2023-11-06 22:43:31,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:31,722 INFO L124 PetriNetUnfolderBase]: 1277/1922 cut-off events. [2023-11-06 22:43:31,723 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-06 22:43:31,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3863 conditions, 1922 events. 1277/1922 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8931 event pairs, 1277 based on Foata normal form. 0/1614 useless extension candidates. Maximal degree in co-relation 3852. Up to 1887 conditions per place. [2023-11-06 22:43:31,754 INFO L140 encePairwiseOnDemand]: 249/256 looper letters, 22 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2023-11-06 22:43:31,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 101 flow [2023-11-06 22:43:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:43:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:43:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 257 transitions. [2023-11-06 22:43:31,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.501953125 [2023-11-06 22:43:31,787 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 257 transitions. [2023-11-06 22:43:31,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 257 transitions. [2023-11-06 22:43:31,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:31,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 257 transitions. [2023-11-06 22:43:31,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:31,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:31,811 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 256.0) internal successors, (768), 3 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:31,814 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 257 transitions. [2023-11-06 22:43:31,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 101 flow [2023-11-06 22:43:31,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:43:31,824 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2023-11-06 22:43:31,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-11-06 22:43:31,832 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2023-11-06 22:43:31,833 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2023-11-06 22:43:31,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 114.5) internal successors, (229), 2 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:31,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:31,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:43:31,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:32,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:32,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:32,048 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash 534357776, now seen corresponding path program 1 times [2023-11-06 22:43:32,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:32,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286848955] [2023-11-06 22:43:32,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:32,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:32,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:32,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:32,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:43:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:32,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:43:32,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:32,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:32,258 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:32,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:32,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286848955] [2023-11-06 22:43:32,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286848955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:32,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:32,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:43:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319440290] [2023-11-06 22:43:32,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:32,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:32,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:32,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:32,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 256 [2023-11-06 22:43:32,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:32,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:32,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 256 [2023-11-06 22:43:32,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:32,783 INFO L124 PetriNetUnfolderBase]: 999/1560 cut-off events. [2023-11-06 22:43:32,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:43:32,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3093 conditions, 1560 events. 999/1560 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7317 event pairs, 277 based on Foata normal form. 0/1428 useless extension candidates. Maximal degree in co-relation 3090. Up to 1195 conditions per place. [2023-11-06 22:43:32,799 INFO L140 encePairwiseOnDemand]: 253/256 looper letters, 31 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-11-06 22:43:32,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 152 flow [2023-11-06 22:43:32,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:32,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:43:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-11-06 22:43:32,812 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48828125 [2023-11-06 22:43:32,812 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-11-06 22:43:32,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-11-06 22:43:32,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:32,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-11-06 22:43:32,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:32,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:32,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:32,829 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 375 transitions. [2023-11-06 22:43:32,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 152 flow [2023-11-06 22:43:32,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:43:32,831 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-11-06 22:43:32,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-11-06 22:43:32,833 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 22:43:32,834 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-11-06 22:43:32,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:32,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:32,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:32,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 22:43:33,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:33,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:33,051 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:33,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1054927894, now seen corresponding path program 1 times [2023-11-06 22:43:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:33,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978635168] [2023-11-06 22:43:33,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:33,054 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:33,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:33,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:43:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:33,199 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:43:33,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:33,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:33,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:33,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:33,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978635168] [2023-11-06 22:43:33,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978635168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:33,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:33,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:33,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125803835] [2023-11-06 22:43:33,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:33,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:43:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:43:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:43:33,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2023-11-06 22:43:33,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:33,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:33,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2023-11-06 22:43:33,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:33,539 INFO L124 PetriNetUnfolderBase]: 450/755 cut-off events. [2023-11-06 22:43:33,539 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-06 22:43:33,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1601 conditions, 755 events. 450/755 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3283 event pairs, 112 based on Foata normal form. 27/742 useless extension candidates. Maximal degree in co-relation 1597. Up to 633 conditions per place. [2023-11-06 22:43:33,547 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 29 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-11-06 22:43:33,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 152 flow [2023-11-06 22:43:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:43:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:43:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2023-11-06 22:43:33,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2023-11-06 22:43:33,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 364 transitions. [2023-11-06 22:43:33,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 364 transitions. [2023-11-06 22:43:33,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:33,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 364 transitions. [2023-11-06 22:43:33,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:33,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:33,558 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 256.0) internal successors, (1024), 4 states have internal predecessors, (1024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:33,559 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 3 states and 364 transitions. [2023-11-06 22:43:33,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 152 flow [2023-11-06 22:43:33,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:43:33,561 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 76 flow [2023-11-06 22:43:33,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-11-06 22:43:33,563 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2023-11-06 22:43:33,563 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 76 flow [2023-11-06 22:43:33,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:33,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:33,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:33,591 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:33,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:33,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:33,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:33,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1978774002, now seen corresponding path program 1 times [2023-11-06 22:43:33,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:33,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029757264] [2023-11-06 22:43:33,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:33,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:33,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:33,795 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:33,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:43:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:33,950 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:43:33,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:34,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:34,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029757264] [2023-11-06 22:43:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029757264] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:34,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:34,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:43:34,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332676390] [2023-11-06 22:43:34,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:34,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:34,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:34,072 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2023-11-06 22:43:34,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:34,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2023-11-06 22:43:34,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:34,318 INFO L124 PetriNetUnfolderBase]: 180/347 cut-off events. [2023-11-06 22:43:34,319 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2023-11-06 22:43:34,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 347 events. 180/347 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1331 event pairs, 61 based on Foata normal form. 27/360 useless extension candidates. Maximal degree in co-relation 857. Up to 129 conditions per place. [2023-11-06 22:43:34,323 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 37 selfloop transitions, 7 changer transitions 0/46 dead transitions. [2023-11-06 22:43:34,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 46 transitions, 218 flow [2023-11-06 22:43:34,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:43:34,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:43:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 485 transitions. [2023-11-06 22:43:34,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4736328125 [2023-11-06 22:43:34,328 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 485 transitions. [2023-11-06 22:43:34,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 485 transitions. [2023-11-06 22:43:34,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:34,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 485 transitions. [2023-11-06 22:43:34,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.25) internal successors, (485), 4 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,337 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,337 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 76 flow. Second operand 4 states and 485 transitions. [2023-11-06 22:43:34,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 46 transitions, 218 flow [2023-11-06 22:43:34,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:43:34,342 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 112 flow [2023-11-06 22:43:34,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-11-06 22:43:34,343 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-11-06 22:43:34,344 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 112 flow [2023-11-06 22:43:34,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:34,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:34,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:34,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:34,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:34,563 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:34,563 INFO L85 PathProgramCache]: Analyzing trace with hash -788850498, now seen corresponding path program 1 times [2023-11-06 22:43:34,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:34,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252102940] [2023-11-06 22:43:34,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:34,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:34,564 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:34,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:34,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:43:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:34,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:43:34,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:34,819 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:34,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:34,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252102940] [2023-11-06 22:43:34,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252102940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:34,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:43:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199226380] [2023-11-06 22:43:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:34,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:43:34,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:34,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:43:34,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:43:34,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2023-11-06 22:43:34,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:34,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:34,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2023-11-06 22:43:34,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:35,198 INFO L124 PetriNetUnfolderBase]: 135/257 cut-off events. [2023-11-06 22:43:35,199 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-06 22:43:35,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 708 conditions, 257 events. 135/257 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 935 event pairs, 56 based on Foata normal form. 9/261 useless extension candidates. Maximal degree in co-relation 702. Up to 108 conditions per place. [2023-11-06 22:43:35,202 INFO L140 encePairwiseOnDemand]: 251/256 looper letters, 34 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2023-11-06 22:43:35,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 242 flow [2023-11-06 22:43:35,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:43:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:43:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 595 transitions. [2023-11-06 22:43:35,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2023-11-06 22:43:35,207 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 595 transitions. [2023-11-06 22:43:35,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 595 transitions. [2023-11-06 22:43:35,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:35,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 595 transitions. [2023-11-06 22:43:35,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,217 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 256.0) internal successors, (1536), 6 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,217 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 112 flow. Second operand 5 states and 595 transitions. [2023-11-06 22:43:35,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 242 flow [2023-11-06 22:43:35,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 228 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:43:35,221 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 126 flow [2023-11-06 22:43:35,222 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-11-06 22:43:35,223 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-11-06 22:43:35,223 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 126 flow [2023-11-06 22:43:35,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:35,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:35,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:35,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:35,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:35,442 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:35,442 INFO L85 PathProgramCache]: Analyzing trace with hash -189199523, now seen corresponding path program 1 times [2023-11-06 22:43:35,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:35,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895129082] [2023-11-06 22:43:35,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:43:35,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:35,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:35,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:43:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:43:35,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:43:35,621 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:35,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:35,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:35,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [895129082] [2023-11-06 22:43:35,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [895129082] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:35,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:35,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:35,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189313955] [2023-11-06 22:43:35,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:35,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:35,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:35,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:35,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:35,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2023-11-06 22:43:35,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:35,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2023-11-06 22:43:35,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:35,932 INFO L124 PetriNetUnfolderBase]: 198/368 cut-off events. [2023-11-06 22:43:35,932 INFO L125 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2023-11-06 22:43:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 368 events. 198/368 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1405 event pairs, 83 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 1071. Up to 160 conditions per place. [2023-11-06 22:43:35,937 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 49 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-11-06 22:43:35,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 362 flow [2023-11-06 22:43:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:43:35,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:43:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2023-11-06 22:43:35,941 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4677734375 [2023-11-06 22:43:35,941 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2023-11-06 22:43:35,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2023-11-06 22:43:35,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:35,943 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2023-11-06 22:43:35,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,950 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,950 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 126 flow. Second operand 4 states and 479 transitions. [2023-11-06 22:43:35,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 362 flow [2023-11-06 22:43:35,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 306 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 22:43:35,956 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 114 flow [2023-11-06 22:43:35,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-06 22:43:35,958 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-11-06 22:43:35,958 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 114 flow [2023-11-06 22:43:35,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:35,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:35,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:35,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:36,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:36,176 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:36,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:36,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1484150967, now seen corresponding path program 2 times [2023-11-06 22:43:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37361445] [2023-11-06 22:43:36,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:43:36,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:36,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:36,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:36,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:43:36,342 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:43:36,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:43:36,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:43:36,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:36,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:36,832 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:36,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:36,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37361445] [2023-11-06 22:43:36,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37361445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:36,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:36,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:43:36,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266191382] [2023-11-06 22:43:36,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:36,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:43:36,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:36,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:43:36,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:43:36,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 256 [2023-11-06 22:43:36,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 114 flow. Second operand has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:36,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:36,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 256 [2023-11-06 22:43:36,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:37,308 INFO L124 PetriNetUnfolderBase]: 206/437 cut-off events. [2023-11-06 22:43:37,308 INFO L125 PetriNetUnfolderBase]: For 278/278 co-relation queries the response was YES. [2023-11-06 22:43:37,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 437 events. 206/437 cut-off events. For 278/278 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1998 event pairs, 23 based on Foata normal form. 1/438 useless extension candidates. Maximal degree in co-relation 1222. Up to 152 conditions per place. [2023-11-06 22:43:37,314 INFO L140 encePairwiseOnDemand]: 250/256 looper letters, 60 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-11-06 22:43:37,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 408 flow [2023-11-06 22:43:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:43:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:43:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2023-11-06 22:43:37,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4486607142857143 [2023-11-06 22:43:37,320 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2023-11-06 22:43:37,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2023-11-06 22:43:37,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:37,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2023-11-06 22:43:37,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:37,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:37,339 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 256.0) internal successors, (2048), 8 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:37,340 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 114 flow. Second operand 7 states and 804 transitions. [2023-11-06 22:43:37,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 408 flow [2023-11-06 22:43:37,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 68 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:43:37,345 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 134 flow [2023-11-06 22:43:37,346 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2023-11-06 22:43:37,347 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-11-06 22:43:37,347 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 134 flow [2023-11-06 22:43:37,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.57142857142857) internal successors, (774), 7 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:37,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:37,348 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:37,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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 22:43:37,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:37,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:37,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:37,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1486260897, now seen corresponding path program 3 times [2023-11-06 22:43:37,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:37,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840769383] [2023-11-06 22:43:37,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:43:37,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:37,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:37,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:43:37,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:43:37,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:43:37,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:43:37,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:43:37,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:43:37,807 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:43:37,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:43:37,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840769383] [2023-11-06 22:43:37,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840769383] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:43:37,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:43:37,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:43:37,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719295946] [2023-11-06 22:43:37,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:43:37,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:43:37,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:43:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:43:37,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:43:37,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 256 [2023-11-06 22:43:37,835 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:37,835 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:43:37,835 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 256 [2023-11-06 22:43:37,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:43:38,132 INFO L124 PetriNetUnfolderBase]: 342/696 cut-off events. [2023-11-06 22:43:38,132 INFO L125 PetriNetUnfolderBase]: For 658/658 co-relation queries the response was YES. [2023-11-06 22:43:38,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 696 events. 342/696 cut-off events. For 658/658 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3447 event pairs, 104 based on Foata normal form. 1/697 useless extension candidates. Maximal degree in co-relation 2199. Up to 316 conditions per place. [2023-11-06 22:43:38,142 INFO L140 encePairwiseOnDemand]: 252/256 looper letters, 58 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2023-11-06 22:43:38,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 396 flow [2023-11-06 22:43:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:43:38,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:43:38,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-11-06 22:43:38,146 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697265625 [2023-11-06 22:43:38,146 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-11-06 22:43:38,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-11-06 22:43:38,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:43:38,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-11-06 22:43:38,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:38,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:38,153 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 256.0) internal successors, (1280), 5 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:38,154 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 134 flow. Second operand 4 states and 481 transitions. [2023-11-06 22:43:38,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 396 flow [2023-11-06 22:43:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:43:38,165 INFO L231 Difference]: Finished difference. Result has 47 places, 32 transitions, 142 flow [2023-11-06 22:43:38,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=256, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2023-11-06 22:43:38,168 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-11-06 22:43:38,168 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 32 transitions, 142 flow [2023-11-06 22:43:38,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:43:38,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:43:38,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:43:38,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:38,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:38,372 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-06 22:43:38,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:43:38,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1026864799, now seen corresponding path program 4 times [2023-11-06 22:43:38,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:43:38,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135919136] [2023-11-06 22:43:38,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:43:38,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:38,374 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:43:38,376 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:43:38,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:43:38,572 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:43:38,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:43:38,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:43:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:43:38,787 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:43:38,787 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:43:38,789 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-06 22:43:38,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-06 22:43:38,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-06 22:43:38,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-06 22:43:38,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-06 22:43:38,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-06 22:43:38,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-06 22:43:38,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-06 22:43:38,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-06 22:43:38,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-06 22:43:38,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-06 22:43:38,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-06 22:43:38,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-06 22:43:38,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:43:39,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:43:39,011 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-06 22:43:39,017 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:43:39,017 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:43:39,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:43:39 BasicIcfg [2023-11-06 22:43:39,118 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:43:39,119 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:43:39,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:43:39,119 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:43:39,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:18" (3/4) ... [2023-11-06 22:43:39,122 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:43:39,123 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:43:39,124 INFO L158 Benchmark]: Toolchain (without parser) took 22994.93ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 85.4MB in the beginning and 127.7MB in the end (delta: -42.3MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,124 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:43:39,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 927.26ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 61.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.06ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,126 INFO L158 Benchmark]: Boogie Preprocessor took 121.35ms. Allocated memory is still 111.1MB. Free memory was 58.9MB in the beginning and 88.3MB in the end (delta: -29.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,126 INFO L158 Benchmark]: RCFGBuilder took 1241.03ms. Allocated memory is still 111.1MB. Free memory was 88.3MB in the beginning and 78.8MB in the end (delta: 9.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,127 INFO L158 Benchmark]: TraceAbstraction took 20591.16ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 78.3MB in the beginning and 128.7MB in the end (delta: -50.4MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2023-11-06 22:43:39,127 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 161.5MB. Free memory was 128.7MB in the beginning and 127.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:43:39,130 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.37ms. Allocated memory is still 77.6MB. Free memory is still 53.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 927.26ms. Allocated memory is still 111.1MB. Free memory was 85.4MB in the beginning and 61.6MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.06ms. Allocated memory is still 111.1MB. Free memory was 61.6MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 121.35ms. Allocated memory is still 111.1MB. Free memory was 58.9MB in the beginning and 88.3MB in the end (delta: -29.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1241.03ms. Allocated memory is still 111.1MB. Free memory was 88.3MB in the beginning and 78.8MB in the end (delta: 9.5MB). Peak memory consumption was 38.0MB. Max. memory is 16.1GB. * TraceAbstraction took 20591.16ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 78.3MB in the beginning and 128.7MB in the end (delta: -50.4MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 161.5MB. Free memory was 128.7MB in the beginning and 127.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.0s, 131 PlacesBefore, 40 PlacesAfterwards, 124 TransitionsBefore, 31 TransitionsAfterwards, 2374 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 67 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 129 TotalNumberOfCompositions, 5856 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2655, independent: 2485, independent conditional: 0, independent unconditional: 2485, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1259, independent: 1226, independent conditional: 0, independent unconditional: 1226, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2655, independent: 1259, independent conditional: 0, independent unconditional: 1259, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 1259, unknown conditional: 0, unknown unconditional: 1259] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 93, Positive conditional cache size: 0, Positive unconditional cache size: 93, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=0, t2055={-6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=1, t2055={-6:0}, t2056={-10:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=2, t2055={-6:0}, t2056={-10:0}, t2057={-2:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, 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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={-6:0}, t2056={-10:0}, t2057={-2:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe012_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={5:6}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 186 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 645 IncrementalHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 11 mSDtfsCounter, 645 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=8, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 123 NumberOfCodeBlocks, 123 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 453 SizeOfPredicates, 2 NumberOfNonLiveVariables, 918 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:43:39,182 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c177e8d4-5fc5-479b-b7ea-f1e51be6ce4f/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