./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:15:08,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:15:09,024 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 21:15:09,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:15:09,034 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:15:09,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:15:09,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:15:09,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:15:09,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:15:09,080 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:15:09,081 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:15:09,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:15:09,081 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:15:09,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:15:09,084 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:15:09,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:15:09,085 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:15:09,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:15:09,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:15:09,086 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:15:09,086 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:15:09,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:15:09,087 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:15:09,088 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:15:09,088 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:15:09,088 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:15:09,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:15:09,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:15:09,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:15:09,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:09,092 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:15:09,092 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:15:09,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:15:09,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:15:09,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:15:09,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:15:09,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:15:09,094 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:15:09,094 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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 [2023-11-06 21:15:09,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:15:09,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:15:09,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:15:09,433 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:15:09,434 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:15:09,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2023-11-06 21:15:12,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:15:12,885 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:15:12,888 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2023-11-06 21:15:12,906 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/16a7a36a5/13dd7ecab0c747788c5bb52c1b28efe1/FLAG4a399367e [2023-11-06 21:15:12,919 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/16a7a36a5/13dd7ecab0c747788c5bb52c1b28efe1 [2023-11-06 21:15:12,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:15:12,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:15:12,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:12,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:15:12,931 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:15:12,934 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,936 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce45f4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:12, skipping insertion in model container [2023-11-06 21:15:12,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:12" (1/1) ... [2023-11-06 21:15:12,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:15:13,472 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:13,496 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:15:13,605 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:15:13,645 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:13,645 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:15:13,653 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:15:13,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13 WrapperNode [2023-11-06 21:15:13,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:15:13,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:13,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:15:13,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:15:13,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,752 INFO L138 Inliner]: procedures = 176, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2023-11-06 21:15:13,752 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:15:13,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:15:13,753 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:15:13,753 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:15:13,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,796 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,827 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:15:13,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:15:13,833 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:15:13,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:15:13,834 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (1/1) ... [2023-11-06 21:15:13,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:15:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:15:13,877 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:15:13,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:15:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:15:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:15:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:15:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:15:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:15:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:15:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:15:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:15:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:15:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:15:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:15:13,931 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:15:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:15:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:15:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:15:13,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:15:13,936 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 21:15:14,122 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:15:14,125 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:15:14,757 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:15:15,325 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:15:15,325 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:15:15,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:15 BoogieIcfgContainer [2023-11-06 21:15:15,329 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:15:15,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:15:15,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:15:15,337 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:15:15,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:12" (1/3) ... [2023-11-06 21:15:15,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248cd07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:15, skipping insertion in model container [2023-11-06 21:15:15,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:13" (2/3) ... [2023-11-06 21:15:15,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@248cd07a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:15, skipping insertion in model container [2023-11-06 21:15:15,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:15" (3/3) ... [2023-11-06 21:15:15,343 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2023-11-06 21:15:15,364 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:15:15,364 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-06 21:15:15,365 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:15:15,530 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:15:15,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 171 transitions, 354 flow [2023-11-06 21:15:15,713 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 21:15:15,715 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:15,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 21:15:15,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 171 transitions, 354 flow [2023-11-06 21:15:15,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 168 transitions, 345 flow [2023-11-06 21:15:15,737 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:15:15,754 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 168 transitions, 345 flow [2023-11-06 21:15:15,758 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 175 places, 168 transitions, 345 flow [2023-11-06 21:15:15,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 168 transitions, 345 flow [2023-11-06 21:15:15,838 INFO L124 PetriNetUnfolderBase]: 3/168 cut-off events. [2023-11-06 21:15:15,839 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:15,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 168 events. 3/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 214 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 21:15:15,847 INFO L119 LiptonReduction]: Number of co-enabled transitions 5746 [2023-11-06 21:15:30,027 INFO L134 LiptonReduction]: Checked pairs total: 19753 [2023-11-06 21:15:30,028 INFO L136 LiptonReduction]: Total number of compositions: 164 [2023-11-06 21:15:30,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:30,051 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;@3f5952af, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:30,051 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-06 21:15:30,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:15:30,054 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 21:15:30,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:30,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:30,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:15:30,056 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:30,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:30,062 INFO L85 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2023-11-06 21:15:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:30,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114853728] [2023-11-06 21:15:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:30,195 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 21:15:30,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:30,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114853728] [2023-11-06 21:15:30,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114853728] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:30,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:30,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:15:30,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329672280] [2023-11-06 21:15:30,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:30,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:15:30,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:30,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:15:30,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:15:30,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 335 [2023-11-06 21:15:30,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:30,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:30,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 335 [2023-11-06 21:15:30,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:32,021 INFO L124 PetriNetUnfolderBase]: 4714/6842 cut-off events. [2023-11-06 21:15:32,021 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:32,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13689 conditions, 6842 events. 4714/6842 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 41949 event pairs, 4714 based on Foata normal form. 0/3767 useless extension candidates. Maximal degree in co-relation 13678. Up to 6801 conditions per place. [2023-11-06 21:15:32,089 INFO L140 encePairwiseOnDemand]: 314/335 looper letters, 36 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 21:15:32,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 161 flow [2023-11-06 21:15:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:15:32,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:15:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 325 transitions. [2023-11-06 21:15:32,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-11-06 21:15:32,112 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 325 transitions. [2023-11-06 21:15:32,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 325 transitions. [2023-11-06 21:15:32,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:32,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 325 transitions. [2023-11-06 21:15:32,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 162.5) internal successors, (325), 2 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:32,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:32,132 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:32,134 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 325 transitions. [2023-11-06 21:15:32,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 161 flow [2023-11-06 21:15:32,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:15:32,143 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 21:15:32,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 21:15:32,152 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 21:15:32,152 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 21:15:32,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 134.5) internal successors, (269), 2 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:32,153 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:32,153 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 21:15:32,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:15:32,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:32,165 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:32,165 INFO L85 PathProgramCache]: Analyzing trace with hash 951944, now seen corresponding path program 1 times [2023-11-06 21:15:32,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:32,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522259695] [2023-11-06 21:15:32,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:32,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:32,530 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 21:15:32,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:32,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522259695] [2023-11-06 21:15:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522259695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936053323] [2023-11-06 21:15:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:32,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:32,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:32,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 335 [2023-11-06 21:15:32,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:32,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:32,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 335 [2023-11-06 21:15:32,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:33,412 INFO L124 PetriNetUnfolderBase]: 2095/3114 cut-off events. [2023-11-06 21:15:33,413 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6231 conditions, 3114 events. 2095/3114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 17237 event pairs, 2095 based on Foata normal form. 0/2095 useless extension candidates. Maximal degree in co-relation 6228. Up to 3080 conditions per place. [2023-11-06 21:15:33,439 INFO L140 encePairwiseOnDemand]: 328/335 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 21:15:33,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 134 flow [2023-11-06 21:15:33,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-11-06 21:15:33,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298507462686567 [2023-11-06 21:15:33,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-11-06 21:15:33,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-11-06 21:15:33,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:33,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-11-06 21:15:33,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:33,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:33,454 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:33,457 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 432 transitions. [2023-11-06 21:15:33,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 134 flow [2023-11-06 21:15:33,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:33,459 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-11-06 21:15:33,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-06 21:15:33,461 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 21:15:33,462 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-11-06 21:15:33,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:33,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:33,470 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 21:15:33,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:33,471 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:33,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:33,474 INFO L85 PathProgramCache]: Analyzing trace with hash 951943, now seen corresponding path program 1 times [2023-11-06 21:15:33,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:33,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619468499] [2023-11-06 21:15:33,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:33,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:33,600 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 21:15:33,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619468499] [2023-11-06 21:15:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619468499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:33,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:33,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:33,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646006595] [2023-11-06 21:15:33,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:33,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:33,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:33,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:33,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:33,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 335 [2023-11-06 21:15:33,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:33,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:33,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 335 [2023-11-06 21:15:33,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:34,492 INFO L124 PetriNetUnfolderBase]: 1885/2953 cut-off events. [2023-11-06 21:15:34,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:34,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5869 conditions, 2953 events. 1885/2953 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 16849 event pairs, 1131 based on Foata normal form. 0/2412 useless extension candidates. Maximal degree in co-relation 5865. Up to 1666 conditions per place. [2023-11-06 21:15:34,521 INFO L140 encePairwiseOnDemand]: 321/335 looper letters, 33 selfloop transitions, 8 changer transitions 0/43 dead transitions. [2023-11-06 21:15:34,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 176 flow [2023-11-06 21:15:34,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:34,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:34,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-11-06 21:15:34,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42885572139303485 [2023-11-06 21:15:34,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-11-06 21:15:34,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-11-06 21:15:34,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:34,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-11-06 21:15:34,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:34,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:34,530 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:34,531 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 431 transitions. [2023-11-06 21:15:34,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 176 flow [2023-11-06 21:15:34,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 175 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:34,533 INFO L231 Difference]: Finished difference. Result has 45 places, 38 transitions, 135 flow [2023-11-06 21:15:34,533 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2023-11-06 21:15:34,535 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-11-06 21:15:34,535 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 38 transitions, 135 flow [2023-11-06 21:15:34,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:34,536 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:34,536 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:34,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:34,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:34,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:34,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1282136612, now seen corresponding path program 1 times [2023-11-06 21:15:34,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:34,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871882954] [2023-11-06 21:15:34,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:34,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:34,800 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 21:15:34,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:34,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871882954] [2023-11-06 21:15:34,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871882954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:34,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:34,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:34,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398513460] [2023-11-06 21:15:34,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:34,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:34,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:34,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:34,810 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 335 [2023-11-06 21:15:34,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 38 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:34,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:34,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 335 [2023-11-06 21:15:34,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:35,502 INFO L124 PetriNetUnfolderBase]: 1671/2731 cut-off events. [2023-11-06 21:15:35,502 INFO L125 PetriNetUnfolderBase]: For 726/767 co-relation queries the response was YES. [2023-11-06 21:15:35,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6924 conditions, 2731 events. 1671/2731 cut-off events. For 726/767 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 16241 event pairs, 726 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 6919. Up to 1713 conditions per place. [2023-11-06 21:15:35,531 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 55 selfloop transitions, 3 changer transitions 0/63 dead transitions. [2023-11-06 21:15:35,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 337 flow [2023-11-06 21:15:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-06 21:15:35,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44776119402985076 [2023-11-06 21:15:35,535 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-06 21:15:35,535 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-06 21:15:35,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:35,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-06 21:15:35,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,541 INFO L175 Difference]: Start difference. First operand has 45 places, 38 transitions, 135 flow. Second operand 3 states and 450 transitions. [2023-11-06 21:15:35,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 337 flow [2023-11-06 21:15:35,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:35,551 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 132 flow [2023-11-06 21:15:35,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-11-06 21:15:35,553 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 21:15:35,553 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 132 flow [2023-11-06 21:15:35,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:35,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:35,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:15:35,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:35,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1282136927, now seen corresponding path program 1 times [2023-11-06 21:15:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982131511] [2023-11-06 21:15:35,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:35,884 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 21:15:35,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:35,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982131511] [2023-11-06 21:15:35,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982131511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:35,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:35,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:35,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406913855] [2023-11-06 21:15:35,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:35,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:35,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:35,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:35,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 335 [2023-11-06 21:15:35,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:35,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:35,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 335 [2023-11-06 21:15:35,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:36,601 INFO L124 PetriNetUnfolderBase]: 1602/2619 cut-off events. [2023-11-06 21:15:36,602 INFO L125 PetriNetUnfolderBase]: For 664/673 co-relation queries the response was YES. [2023-11-06 21:15:36,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6792 conditions, 2619 events. 1602/2619 cut-off events. For 664/673 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15696 event pairs, 354 based on Foata normal form. 0/2255 useless extension candidates. Maximal degree in co-relation 6786. Up to 2053 conditions per place. [2023-11-06 21:15:36,624 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 49 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-11-06 21:15:36,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 300 flow [2023-11-06 21:15:36,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-11-06 21:15:36,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4368159203980099 [2023-11-06 21:15:36,631 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-11-06 21:15:36,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-11-06 21:15:36,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:36,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-11-06 21:15:36,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:36,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:36,638 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:36,638 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 132 flow. Second operand 3 states and 439 transitions. [2023-11-06 21:15:36,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 300 flow [2023-11-06 21:15:36,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:36,642 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 134 flow [2023-11-06 21:15:36,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-06 21:15:36,643 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-11-06 21:15:36,643 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 134 flow [2023-11-06 21:15:36,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:36,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:36,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:36,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:15:36,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:36,645 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -276903104, now seen corresponding path program 1 times [2023-11-06 21:15:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576021904] [2023-11-06 21:15:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:36,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:37,028 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 21:15:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576021904] [2023-11-06 21:15:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576021904] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290118942] [2023-11-06 21:15:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:37,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:37,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:37,117 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 335 [2023-11-06 21:15:37,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:37,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:37,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 335 [2023-11-06 21:15:37,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:37,842 INFO L124 PetriNetUnfolderBase]: 1709/2763 cut-off events. [2023-11-06 21:15:37,842 INFO L125 PetriNetUnfolderBase]: For 472/472 co-relation queries the response was YES. [2023-11-06 21:15:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7158 conditions, 2763 events. 1709/2763 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 16007 event pairs, 736 based on Foata normal form. 0/2408 useless extension candidates. Maximal degree in co-relation 7151. Up to 1741 conditions per place. [2023-11-06 21:15:37,860 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 58 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-11-06 21:15:37,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 341 flow [2023-11-06 21:15:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-11-06 21:15:37,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42014925373134326 [2023-11-06 21:15:37,863 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-11-06 21:15:37,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-11-06 21:15:37,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:37,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-11-06 21:15:37,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:37,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:37,871 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:37,871 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 134 flow. Second operand 4 states and 563 transitions. [2023-11-06 21:15:37,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 341 flow [2023-11-06 21:15:37,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:37,874 INFO L231 Difference]: Finished difference. Result has 47 places, 37 transitions, 132 flow [2023-11-06 21:15:37,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2023-11-06 21:15:37,875 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2023-11-06 21:15:37,875 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 132 flow [2023-11-06 21:15:37,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:37,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:37,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:37,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:15:37,877 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:37,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1091537415, now seen corresponding path program 1 times [2023-11-06 21:15:37,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:37,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706940954] [2023-11-06 21:15:37,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:37,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:38,006 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 21:15:38,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:38,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706940954] [2023-11-06 21:15:38,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706940954] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:38,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:38,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:38,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541579085] [2023-11-06 21:15:38,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:38,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:38,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:38,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:38,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:38,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 335 [2023-11-06 21:15:38,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:38,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:38,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 335 [2023-11-06 21:15:38,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:38,816 INFO L124 PetriNetUnfolderBase]: 1786/2941 cut-off events. [2023-11-06 21:15:38,816 INFO L125 PetriNetUnfolderBase]: For 586/586 co-relation queries the response was YES. [2023-11-06 21:15:38,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7635 conditions, 2941 events. 1786/2941 cut-off events. For 586/586 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 18173 event pairs, 382 based on Foata normal form. 30/2646 useless extension candidates. Maximal degree in co-relation 7628. Up to 1274 conditions per place. [2023-11-06 21:15:38,836 INFO L140 encePairwiseOnDemand]: 326/335 looper letters, 47 selfloop transitions, 13 changer transitions 0/62 dead transitions. [2023-11-06 21:15:38,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 320 flow [2023-11-06 21:15:38,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:38,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-06 21:15:38,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4246268656716418 [2023-11-06 21:15:38,840 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-06 21:15:38,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-06 21:15:38,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:38,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-06 21:15:38,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:38,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:38,847 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:38,847 INFO L175 Difference]: Start difference. First operand has 47 places, 37 transitions, 132 flow. Second operand 4 states and 569 transitions. [2023-11-06 21:15:38,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 320 flow [2023-11-06 21:15:38,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 62 transitions, 313 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:15:38,852 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 163 flow [2023-11-06 21:15:38,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-11-06 21:15:38,853 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 21:15:38,854 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 163 flow [2023-11-06 21:15:38,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:38,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:38,854 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:38,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:15:38,855 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:38,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1089940270, now seen corresponding path program 1 times [2023-11-06 21:15:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:38,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340651536] [2023-11-06 21:15:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:38,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:39,085 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 21:15:39,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:39,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340651536] [2023-11-06 21:15:39,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340651536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:39,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:39,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:39,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69304364] [2023-11-06 21:15:39,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:39,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:39,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:39,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:39,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:39,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 21:15:39,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 163 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:39,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:39,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 21:15:39,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:40,154 INFO L124 PetriNetUnfolderBase]: 3044/4882 cut-off events. [2023-11-06 21:15:40,155 INFO L125 PetriNetUnfolderBase]: For 2348/2427 co-relation queries the response was YES. [2023-11-06 21:15:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 4882 events. 3044/4882 cut-off events. For 2348/2427 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 31861 event pairs, 891 based on Foata normal form. 76/4460 useless extension candidates. Maximal degree in co-relation 13672. Up to 1757 conditions per place. [2023-11-06 21:15:40,193 INFO L140 encePairwiseOnDemand]: 331/335 looper letters, 84 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2023-11-06 21:15:40,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 91 transitions, 562 flow [2023-11-06 21:15:40,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:40,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2023-11-06 21:15:40,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4343283582089552 [2023-11-06 21:15:40,197 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2023-11-06 21:15:40,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2023-11-06 21:15:40,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:40,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2023-11-06 21:15:40,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 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 21:15:40,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,206 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,207 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 163 flow. Second operand 4 states and 582 transitions. [2023-11-06 21:15:40,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 91 transitions, 562 flow [2023-11-06 21:15:40,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 91 transitions, 530 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:40,217 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 170 flow [2023-11-06 21:15:40,217 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-06 21:15:40,221 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2023-11-06 21:15:40,222 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 170 flow [2023-11-06 21:15:40,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:40,223 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:40,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:15:40,223 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:40,224 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:40,224 INFO L85 PathProgramCache]: Analyzing trace with hash -522021561, now seen corresponding path program 1 times [2023-11-06 21:15:40,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:40,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263141424] [2023-11-06 21:15:40,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:40,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:40,520 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 21:15:40,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:40,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263141424] [2023-11-06 21:15:40,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263141424] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:40,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:40,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:40,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563911366] [2023-11-06 21:15:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:40,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:40,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 335 [2023-11-06 21:15:40,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:40,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:40,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 335 [2023-11-06 21:15:40,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:41,450 INFO L124 PetriNetUnfolderBase]: 2412/3918 cut-off events. [2023-11-06 21:15:41,450 INFO L125 PetriNetUnfolderBase]: For 1156/1168 co-relation queries the response was YES. [2023-11-06 21:15:41,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 3918 events. 2412/3918 cut-off events. For 1156/1168 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 24249 event pairs, 993 based on Foata normal form. 12/3344 useless extension candidates. Maximal degree in co-relation 10780. Up to 1529 conditions per place. [2023-11-06 21:15:41,476 INFO L140 encePairwiseOnDemand]: 324/335 looper letters, 46 selfloop transitions, 11 changer transitions 0/59 dead transitions. [2023-11-06 21:15:41,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 59 transitions, 353 flow [2023-11-06 21:15:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-11-06 21:15:41,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4044776119402985 [2023-11-06 21:15:41,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-11-06 21:15:41,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-11-06 21:15:41,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:41,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-11-06 21:15:41,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 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 21:15:41,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,486 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 170 flow. Second operand 4 states and 542 transitions. [2023-11-06 21:15:41,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 59 transitions, 353 flow [2023-11-06 21:15:41,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:41,489 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 233 flow [2023-11-06 21:15:41,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=233, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-06 21:15:41,490 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2023-11-06 21:15:41,490 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 233 flow [2023-11-06 21:15:41,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:41,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:41,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:15:41,492 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:41,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 213464930, now seen corresponding path program 1 times [2023-11-06 21:15:41,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370933349] [2023-11-06 21:15:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,822 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 21:15:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:41,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370933349] [2023-11-06 21:15:41,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370933349] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:41,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:41,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:15:41,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609524940] [2023-11-06 21:15:41,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:41,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:41,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:41,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:41,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:41,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 335 [2023-11-06 21:15:41,833 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:41,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:41,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 335 [2023-11-06 21:15:41,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:42,732 INFO L124 PetriNetUnfolderBase]: 2149/3691 cut-off events. [2023-11-06 21:15:42,732 INFO L125 PetriNetUnfolderBase]: For 2460/2501 co-relation queries the response was YES. [2023-11-06 21:15:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11274 conditions, 3691 events. 2149/3691 cut-off events. For 2460/2501 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 24888 event pairs, 735 based on Foata normal form. 15/3331 useless extension candidates. Maximal degree in co-relation 11265. Up to 2319 conditions per place. [2023-11-06 21:15:42,763 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 59 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-11-06 21:15:42,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 469 flow [2023-11-06 21:15:42,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-11-06 21:15:42,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44676616915422884 [2023-11-06 21:15:42,766 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-11-06 21:15:42,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-11-06 21:15:42,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:42,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-11-06 21:15:42,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:42,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:42,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:42,772 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 233 flow. Second operand 3 states and 449 transitions. [2023-11-06 21:15:42,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 469 flow [2023-11-06 21:15:42,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 69 transitions, 463 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:42,784 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 243 flow [2023-11-06 21:15:42,785 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-06 21:15:42,785 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2023-11-06 21:15:42,786 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 243 flow [2023-11-06 21:15:42,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:42,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:42,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:42,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:15:42,787 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:42,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:42,787 INFO L85 PathProgramCache]: Analyzing trace with hash 997200323, now seen corresponding path program 1 times [2023-11-06 21:15:42,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:42,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245501880] [2023-11-06 21:15:42,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:42,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:43,076 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 21:15:43,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:43,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245501880] [2023-11-06 21:15:43,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245501880] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:43,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:43,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:43,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780859736] [2023-11-06 21:15:43,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:43,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:15:43,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:43,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:15:43,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:15:43,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 335 [2023-11-06 21:15:43,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:43,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:43,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 335 [2023-11-06 21:15:43,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:44,228 INFO L124 PetriNetUnfolderBase]: 2017/3378 cut-off events. [2023-11-06 21:15:44,228 INFO L125 PetriNetUnfolderBase]: For 2378/2384 co-relation queries the response was YES. [2023-11-06 21:15:44,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10946 conditions, 3378 events. 2017/3378 cut-off events. For 2378/2384 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 21331 event pairs, 193 based on Foata normal form. 59/3234 useless extension candidates. Maximal degree in co-relation 10935. Up to 1118 conditions per place. [2023-11-06 21:15:44,255 INFO L140 encePairwiseOnDemand]: 322/335 looper letters, 65 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2023-11-06 21:15:44,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 85 transitions, 597 flow [2023-11-06 21:15:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:15:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:15:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 886 transitions. [2023-11-06 21:15:44,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37782515991471216 [2023-11-06 21:15:44,261 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 886 transitions. [2023-11-06 21:15:44,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 886 transitions. [2023-11-06 21:15:44,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:44,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 886 transitions. [2023-11-06 21:15:44,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:44,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:44,271 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 335.0) internal successors, (2680), 8 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:44,271 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 243 flow. Second operand 7 states and 886 transitions. [2023-11-06 21:15:44,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 85 transitions, 597 flow [2023-11-06 21:15:44,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:44,282 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 366 flow [2023-11-06 21:15:44,282 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=366, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-06 21:15:44,283 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2023-11-06 21:15:44,283 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 366 flow [2023-11-06 21:15:44,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.75) internal successors, (950), 8 states have internal predecessors, (950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:44,284 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:44,284 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:44,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:15:44,285 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:44,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:44,285 INFO L85 PathProgramCache]: Analyzing trace with hash 848440318, now seen corresponding path program 1 times [2023-11-06 21:15:44,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:44,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075169283] [2023-11-06 21:15:44,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:44,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:45,015 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 21:15:45,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:45,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075169283] [2023-11-06 21:15:45,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075169283] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:45,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:45,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:45,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093094245] [2023-11-06 21:15:45,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:45,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:15:45,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:45,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:15:45,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:45,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 335 [2023-11-06 21:15:45,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 366 flow. Second operand has 9 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:45,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:45,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 335 [2023-11-06 21:15:45,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:46,564 INFO L124 PetriNetUnfolderBase]: 1403/2433 cut-off events. [2023-11-06 21:15:46,565 INFO L125 PetriNetUnfolderBase]: For 3165/3188 co-relation queries the response was YES. [2023-11-06 21:15:46,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8635 conditions, 2433 events. 1403/2433 cut-off events. For 3165/3188 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 14830 event pairs, 66 based on Foata normal form. 4/2408 useless extension candidates. Maximal degree in co-relation 8622. Up to 648 conditions per place. [2023-11-06 21:15:46,582 INFO L140 encePairwiseOnDemand]: 327/335 looper letters, 62 selfloop transitions, 19 changer transitions 1/89 dead transitions. [2023-11-06 21:15:46,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 657 flow [2023-11-06 21:15:46,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:15:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 21:15:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2023-11-06 21:15:46,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3711442786069652 [2023-11-06 21:15:46,589 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1119 transitions. [2023-11-06 21:15:46,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1119 transitions. [2023-11-06 21:15:46,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:46,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1119 transitions. [2023-11-06 21:15:46,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.33333333333333) internal successors, (1119), 9 states have internal predecessors, (1119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:46,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:46,603 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:46,604 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 366 flow. Second operand 9 states and 1119 transitions. [2023-11-06 21:15:46,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 657 flow [2023-11-06 21:15:46,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 89 transitions, 647 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:46,632 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 388 flow [2023-11-06 21:15:46,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=388, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2023-11-06 21:15:46,635 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -4 predicate places. [2023-11-06 21:15:46,635 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 388 flow [2023-11-06 21:15:46,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 118.66666666666667) internal successors, (1068), 9 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:46,636 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:46,636 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:46,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:15:46,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:46,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:46,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2020741634, now seen corresponding path program 1 times [2023-11-06 21:15:46,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:46,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809483750] [2023-11-06 21:15:46,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:46,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:48,034 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 21:15:48,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:48,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809483750] [2023-11-06 21:15:48,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809483750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:48,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:48,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:15:48,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698431579] [2023-11-06 21:15:48,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:48,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:15:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:15:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:15:48,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 335 [2023-11-06 21:15:48,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 388 flow. Second operand has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:48,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:48,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 335 [2023-11-06 21:15:48,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:49,180 INFO L124 PetriNetUnfolderBase]: 1845/3015 cut-off events. [2023-11-06 21:15:49,180 INFO L125 PetriNetUnfolderBase]: For 4443/4453 co-relation queries the response was YES. [2023-11-06 21:15:49,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10932 conditions, 3015 events. 1845/3015 cut-off events. For 4443/4453 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 18117 event pairs, 871 based on Foata normal form. 14/3006 useless extension candidates. Maximal degree in co-relation 10918. Up to 2574 conditions per place. [2023-11-06 21:15:49,196 INFO L140 encePairwiseOnDemand]: 326/335 looper letters, 79 selfloop transitions, 12 changer transitions 1/94 dead transitions. [2023-11-06 21:15:49,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 790 flow [2023-11-06 21:15:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:15:49,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:15:49,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 966 transitions. [2023-11-06 21:15:49,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3604477611940298 [2023-11-06 21:15:49,201 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 966 transitions. [2023-11-06 21:15:49,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 966 transitions. [2023-11-06 21:15:49,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:49,203 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 966 transitions. [2023-11-06 21:15:49,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 120.75) internal successors, (966), 8 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:49,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 335.0) internal successors, (3015), 9 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:49,212 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 335.0) internal successors, (3015), 9 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:49,212 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 388 flow. Second operand 8 states and 966 transitions. [2023-11-06 21:15:49,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 790 flow [2023-11-06 21:15:49,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 94 transitions, 729 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-06 21:15:49,238 INFO L231 Difference]: Finished difference. Result has 73 places, 63 transitions, 473 flow [2023-11-06 21:15:49,238 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=349, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=473, PETRI_PLACES=73, PETRI_TRANSITIONS=63} [2023-11-06 21:15:49,239 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2023-11-06 21:15:49,239 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 63 transitions, 473 flow [2023-11-06 21:15:49,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.75) internal successors, (918), 8 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:49,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:49,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:49,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:15:49,240 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:49,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1769813194, now seen corresponding path program 2 times [2023-11-06 21:15:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638063118] [2023-11-06 21:15:49,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:49,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:49,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:50,746 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 21:15:50,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638063118] [2023-11-06 21:15:50,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638063118] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:50,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:50,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:50,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160783286] [2023-11-06 21:15:50,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:50,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:15:50,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:50,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:15:50,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:51,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 335 [2023-11-06 21:15:51,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 63 transitions, 473 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:51,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:51,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 335 [2023-11-06 21:15:51,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:52,095 INFO L124 PetriNetUnfolderBase]: 2096/3405 cut-off events. [2023-11-06 21:15:52,095 INFO L125 PetriNetUnfolderBase]: For 4520/4530 co-relation queries the response was YES. [2023-11-06 21:15:52,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12396 conditions, 3405 events. 2096/3405 cut-off events. For 4520/4530 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 20607 event pairs, 508 based on Foata normal form. 14/3399 useless extension candidates. Maximal degree in co-relation 12376. Up to 2593 conditions per place. [2023-11-06 21:15:52,121 INFO L140 encePairwiseOnDemand]: 326/335 looper letters, 81 selfloop transitions, 22 changer transitions 1/106 dead transitions. [2023-11-06 21:15:52,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 106 transitions, 906 flow [2023-11-06 21:15:52,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:15:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 21:15:52,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1100 transitions. [2023-11-06 21:15:52,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3648424543946932 [2023-11-06 21:15:52,127 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1100 transitions. [2023-11-06 21:15:52,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1100 transitions. [2023-11-06 21:15:52,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:52,129 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1100 transitions. [2023-11-06 21:15:52,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.22222222222223) internal successors, (1100), 9 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:52,137 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:52,138 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 335.0) internal successors, (3350), 10 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:52,138 INFO L175 Difference]: Start difference. First operand has 73 places, 63 transitions, 473 flow. Second operand 9 states and 1100 transitions. [2023-11-06 21:15:52,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 106 transitions, 906 flow [2023-11-06 21:15:52,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 106 transitions, 892 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:52,176 INFO L231 Difference]: Finished difference. Result has 85 places, 74 transitions, 638 flow [2023-11-06 21:15:52,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=638, PETRI_PLACES=85, PETRI_TRANSITIONS=74} [2023-11-06 21:15:52,177 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 14 predicate places. [2023-11-06 21:15:52,177 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 74 transitions, 638 flow [2023-11-06 21:15:52,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:52,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:52,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:52,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:15:52,179 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:52,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:52,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1109479024, now seen corresponding path program 3 times [2023-11-06 21:15:52,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:52,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115975259] [2023-11-06 21:15:52,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:52,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:53,507 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 21:15:53,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:53,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115975259] [2023-11-06 21:15:53,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115975259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:53,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:53,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:15:53,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465920487] [2023-11-06 21:15:53,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:53,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:15:53,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:53,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:15:53,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:15:53,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 335 [2023-11-06 21:15:53,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 74 transitions, 638 flow. Second operand has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:53,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:53,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 335 [2023-11-06 21:15:53,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:55,025 INFO L124 PetriNetUnfolderBase]: 2078/3413 cut-off events. [2023-11-06 21:15:55,026 INFO L125 PetriNetUnfolderBase]: For 6383/6391 co-relation queries the response was YES. [2023-11-06 21:15:55,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13021 conditions, 3413 events. 2078/3413 cut-off events. For 6383/6391 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 21040 event pairs, 206 based on Foata normal form. 12/3405 useless extension candidates. Maximal degree in co-relation 12996. Up to 2016 conditions per place. [2023-11-06 21:15:55,049 INFO L140 encePairwiseOnDemand]: 327/335 looper letters, 88 selfloop transitions, 39 changer transitions 2/131 dead transitions. [2023-11-06 21:15:55,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 131 transitions, 1230 flow [2023-11-06 21:15:55,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:15:55,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 21:15:55,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1334 transitions. [2023-11-06 21:15:55,055 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3620081411126187 [2023-11-06 21:15:55,056 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1334 transitions. [2023-11-06 21:15:55,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1334 transitions. [2023-11-06 21:15:55,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:55,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1334 transitions. [2023-11-06 21:15:55,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.27272727272727) internal successors, (1334), 11 states have internal predecessors, (1334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,070 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,070 INFO L175 Difference]: Start difference. First operand has 85 places, 74 transitions, 638 flow. Second operand 11 states and 1334 transitions. [2023-11-06 21:15:55,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 131 transitions, 1230 flow [2023-11-06 21:15:55,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 131 transitions, 1170 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-11-06 21:15:55,126 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 864 flow [2023-11-06 21:15:55,126 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=864, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2023-11-06 21:15:55,126 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 26 predicate places. [2023-11-06 21:15:55,127 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 864 flow [2023-11-06 21:15:55,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.55555555555556) internal successors, (1040), 9 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:55,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:55,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:15:55,128 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:55,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:55,129 INFO L85 PathProgramCache]: Analyzing trace with hash 848442067, now seen corresponding path program 1 times [2023-11-06 21:15:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425560882] [2023-11-06 21:15:55,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:55,218 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 21:15:55,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:55,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425560882] [2023-11-06 21:15:55,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425560882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:55,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:55,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504202691] [2023-11-06 21:15:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:55,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:55,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:55,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 335 [2023-11-06 21:15:55,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 864 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:55,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:55,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 335 [2023-11-06 21:15:55,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:55,984 INFO L124 PetriNetUnfolderBase]: 1904/3041 cut-off events. [2023-11-06 21:15:55,984 INFO L125 PetriNetUnfolderBase]: For 8386/8392 co-relation queries the response was YES. [2023-11-06 21:15:55,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12332 conditions, 3041 events. 1904/3041 cut-off events. For 8386/8392 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 17602 event pairs, 1074 based on Foata normal form. 79/3114 useless extension candidates. Maximal degree in co-relation 12304. Up to 2376 conditions per place. [2023-11-06 21:15:55,998 INFO L140 encePairwiseOnDemand]: 324/335 looper letters, 33 selfloop transitions, 1 changer transitions 55/91 dead transitions. [2023-11-06 21:15:55,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 1048 flow [2023-11-06 21:15:56,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:56,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-11-06 21:15:56,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4007462686567164 [2023-11-06 21:15:56,010 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-11-06 21:15:56,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-11-06 21:15:56,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:56,011 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-11-06 21:15:56,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,017 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,017 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 864 flow. Second operand 4 states and 537 transitions. [2023-11-06 21:15:56,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 1048 flow [2023-11-06 21:15:56,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 91 transitions, 983 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-11-06 21:15:56,079 INFO L231 Difference]: Finished difference. Result has 90 places, 36 transitions, 251 flow [2023-11-06 21:15:56,079 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=251, PETRI_PLACES=90, PETRI_TRANSITIONS=36} [2023-11-06 21:15:56,079 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 19 predicate places. [2023-11-06 21:15:56,080 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 36 transitions, 251 flow [2023-11-06 21:15:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:56,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:56,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:15:56,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:56,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:56,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1805134812, now seen corresponding path program 1 times [2023-11-06 21:15:56,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:56,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030590040] [2023-11-06 21:15:56,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:56,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:56,277 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 21:15:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:56,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030590040] [2023-11-06 21:15:56,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030590040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:56,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:56,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635891533] [2023-11-06 21:15:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:56,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:56,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 21:15:56,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 36 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:56,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 21:15:56,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:56,429 INFO L124 PetriNetUnfolderBase]: 233/450 cut-off events. [2023-11-06 21:15:56,430 INFO L125 PetriNetUnfolderBase]: For 951/951 co-relation queries the response was YES. [2023-11-06 21:15:56,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1537 conditions, 450 events. 233/450 cut-off events. For 951/951 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2030 event pairs, 52 based on Foata normal form. 14/461 useless extension candidates. Maximal degree in co-relation 1512. Up to 365 conditions per place. [2023-11-06 21:15:56,432 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 47 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-11-06 21:15:56,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 57 transitions, 490 flow [2023-11-06 21:15:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 422 transitions. [2023-11-06 21:15:56,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199004975124378 [2023-11-06 21:15:56,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 422 transitions. [2023-11-06 21:15:56,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 422 transitions. [2023-11-06 21:15:56,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:56,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 422 transitions. [2023-11-06 21:15:56,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,440 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 335.0) internal successors, (1340), 4 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,440 INFO L175 Difference]: Start difference. First operand has 90 places, 36 transitions, 251 flow. Second operand 3 states and 422 transitions. [2023-11-06 21:15:56,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 57 transitions, 490 flow [2023-11-06 21:15:56,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 57 transitions, 446 flow, removed 3 selfloop flow, removed 10 redundant places. [2023-11-06 21:15:56,444 INFO L231 Difference]: Finished difference. Result has 68 places, 39 transitions, 244 flow [2023-11-06 21:15:56,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=68, PETRI_TRANSITIONS=39} [2023-11-06 21:15:56,444 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -3 predicate places. [2023-11-06 21:15:56,445 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 39 transitions, 244 flow [2023-11-06 21:15:56,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:56,445 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 21:15:56,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:15:56,446 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:56,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1426036301, now seen corresponding path program 1 times [2023-11-06 21:15:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053486874] [2023-11-06 21:15:56,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:56,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:56,645 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 21:15:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053486874] [2023-11-06 21:15:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053486874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:56,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:56,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:56,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420680312] [2023-11-06 21:15:56,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:56,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:56,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:56,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:56,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:56,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 21:15:56,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 39 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:56,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 21:15:56,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:56,799 INFO L124 PetriNetUnfolderBase]: 142/305 cut-off events. [2023-11-06 21:15:56,799 INFO L125 PetriNetUnfolderBase]: For 505/505 co-relation queries the response was YES. [2023-11-06 21:15:56,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 305 events. 142/305 cut-off events. For 505/505 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1283 event pairs, 18 based on Foata normal form. 23/325 useless extension candidates. Maximal degree in co-relation 1146. Up to 116 conditions per place. [2023-11-06 21:15:56,802 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 55 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2023-11-06 21:15:56,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 555 flow [2023-11-06 21:15:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:56,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2023-11-06 21:15:56,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41865671641791047 [2023-11-06 21:15:56,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2023-11-06 21:15:56,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2023-11-06 21:15:56,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:56,806 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2023-11-06 21:15:56,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,810 INFO L175 Difference]: Start difference. First operand has 68 places, 39 transitions, 244 flow. Second operand 4 states and 561 transitions. [2023-11-06 21:15:56,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 555 flow [2023-11-06 21:15:56,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 68 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:56,814 INFO L231 Difference]: Finished difference. Result has 71 places, 42 transitions, 280 flow [2023-11-06 21:15:56,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=71, PETRI_TRANSITIONS=42} [2023-11-06 21:15:56,815 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 0 predicate places. [2023-11-06 21:15:56,815 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 42 transitions, 280 flow [2023-11-06 21:15:56,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:56,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:56,816 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 21:15:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:15:56,816 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:56,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1049956615, now seen corresponding path program 1 times [2023-11-06 21:15:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889610807] [2023-11-06 21:15:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:57,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 21:15:57,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:57,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889610807] [2023-11-06 21:15:57,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889610807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:57,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:57,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:15:57,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800752012] [2023-11-06 21:15:57,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:57,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:15:57,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:57,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:15:57,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:15:57,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 21:15:57,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 42 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:57,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 21:15:57,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:57,243 INFO L124 PetriNetUnfolderBase]: 282/609 cut-off events. [2023-11-06 21:15:57,244 INFO L125 PetriNetUnfolderBase]: For 1457/1457 co-relation queries the response was YES. [2023-11-06 21:15:57,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2311 conditions, 609 events. 282/609 cut-off events. For 1457/1457 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3189 event pairs, 53 based on Foata normal form. 5/614 useless extension candidates. Maximal degree in co-relation 2291. Up to 280 conditions per place. [2023-11-06 21:15:57,248 INFO L140 encePairwiseOnDemand]: 332/335 looper letters, 59 selfloop transitions, 2 changer transitions 6/72 dead transitions. [2023-11-06 21:15:57,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 610 flow [2023-11-06 21:15:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:15:57,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:15:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-11-06 21:15:57,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41492537313432837 [2023-11-06 21:15:57,251 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-11-06 21:15:57,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-11-06 21:15:57,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:57,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-11-06 21:15:57,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,257 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 335.0) internal successors, (1675), 5 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,257 INFO L175 Difference]: Start difference. First operand has 71 places, 42 transitions, 280 flow. Second operand 4 states and 556 transitions. [2023-11-06 21:15:57,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 610 flow [2023-11-06 21:15:57,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 72 transitions, 583 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-11-06 21:15:57,262 INFO L231 Difference]: Finished difference. Result has 74 places, 43 transitions, 279 flow [2023-11-06 21:15:57,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=74, PETRI_TRANSITIONS=43} [2023-11-06 21:15:57,263 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-11-06 21:15:57,263 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 43 transitions, 279 flow [2023-11-06 21:15:57,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:57,264 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 21:15:57,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:15:57,264 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:57,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:57,264 INFO L85 PathProgramCache]: Analyzing trace with hash -969918191, now seen corresponding path program 2 times [2023-11-06 21:15:57,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:57,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298006511] [2023-11-06 21:15:57,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:57,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:57,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:57,486 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 21:15:57,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:57,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298006511] [2023-11-06 21:15:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298006511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:57,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:57,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:15:57,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583323523] [2023-11-06 21:15:57,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:57,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:15:57,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:57,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:15:57,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:15:57,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 335 [2023-11-06 21:15:57,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 43 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:57,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 335 [2023-11-06 21:15:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:57,677 INFO L124 PetriNetUnfolderBase]: 184/395 cut-off events. [2023-11-06 21:15:57,678 INFO L125 PetriNetUnfolderBase]: For 967/991 co-relation queries the response was YES. [2023-11-06 21:15:57,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 395 events. 184/395 cut-off events. For 967/991 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1975 event pairs, 22 based on Foata normal form. 40/419 useless extension candidates. Maximal degree in co-relation 1514. Up to 171 conditions per place. [2023-11-06 21:15:57,680 INFO L140 encePairwiseOnDemand]: 330/335 looper letters, 44 selfloop transitions, 10 changer transitions 10/69 dead transitions. [2023-11-06 21:15:57,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 69 transitions, 581 flow [2023-11-06 21:15:57,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:15:57,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:15:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 691 transitions. [2023-11-06 21:15:57,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41253731343283584 [2023-11-06 21:15:57,684 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 691 transitions. [2023-11-06 21:15:57,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 691 transitions. [2023-11-06 21:15:57,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:57,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 691 transitions. [2023-11-06 21:15:57,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,690 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 335.0) internal successors, (2010), 6 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,690 INFO L175 Difference]: Start difference. First operand has 74 places, 43 transitions, 279 flow. Second operand 5 states and 691 transitions. [2023-11-06 21:15:57,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 69 transitions, 581 flow [2023-11-06 21:15:57,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 69 transitions, 544 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-06 21:15:57,694 INFO L231 Difference]: Finished difference. Result has 75 places, 40 transitions, 262 flow [2023-11-06 21:15:57,695 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=335, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=40} [2023-11-06 21:15:57,695 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 4 predicate places. [2023-11-06 21:15:57,695 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 40 transitions, 262 flow [2023-11-06 21:15:57,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:15:57,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:57,696 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 21:15:57,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 21:15:57,697 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:15:57,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:57,697 INFO L85 PathProgramCache]: Analyzing trace with hash -137731826, now seen corresponding path program 1 times [2023-11-06 21:15:57,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767272346] [2023-11-06 21:15:57,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:57,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:15:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:15:57,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:15:57,956 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:15:57,957 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-11-06 21:15:57,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-11-06 21:15:57,962 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-11-06 21:15:57,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-11-06 21:15:57,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-11-06 21:15:57,963 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-11-06 21:15:57,964 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-11-06 21:15:57,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-11-06 21:15:57,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-11-06 21:15:57,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-11-06 21:15:57,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-11-06 21:15:57,965 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-11-06 21:15:57,966 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-11-06 21:15:57,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-11-06 21:15:57,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-11-06 21:15:57,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-11-06 21:15:57,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-11-06 21:15:57,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-11-06 21:15:57,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-11-06 21:15:57,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-11-06 21:15:57,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-11-06 21:15:57,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-11-06 21:15:57,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-11-06 21:15:57,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-11-06 21:15:57,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-11-06 21:15:57,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-11-06 21:15:57,969 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-11-06 21:15:57,970 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-11-06 21:15:57,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-11-06 21:15:57,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-11-06 21:15:57,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-11-06 21:15:57,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-11-06 21:15:57,971 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-11-06 21:15:57,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-11-06 21:15:57,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-11-06 21:15:57,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-11-06 21:15:57,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-11-06 21:15:57,972 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-11-06 21:15:57,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-11-06 21:15:57,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-11-06 21:15:57,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-11-06 21:15:57,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 21:15:57,974 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:57,983 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:15:57,983 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:15:58,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:15:58 BasicIcfg [2023-11-06 21:15:58,113 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:15:58,114 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:15:58,114 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:15:58,114 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:15:58,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:15" (3/4) ... [2023-11-06 21:15:58,116 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:15:58,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:15:58,118 INFO L158 Benchmark]: Toolchain (without parser) took 45194.11ms. Allocated memory was 138.4MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 99.5MB in the beginning and 1.0GB in the end (delta: -932.3MB). Peak memory consumption was 123.6MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,118 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 66.9MB in the beginning and 66.7MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:58,119 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.84ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 75.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,119 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.23ms. Allocated memory is still 138.4MB. Free memory was 75.4MB in the beginning and 72.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,119 INFO L158 Benchmark]: Boogie Preprocessor took 78.57ms. Allocated memory is still 138.4MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,120 INFO L158 Benchmark]: RCFGBuilder took 1497.36ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 119.2MB in the end (delta: -48.5MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,120 INFO L158 Benchmark]: TraceAbstraction took 42780.49ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.2MB in the beginning and 1.0GB in the end (delta: -912.7MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. [2023-11-06 21:15:58,121 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:15:58,126 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 113.2MB. Free memory was 66.9MB in the beginning and 66.7MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.84ms. Allocated memory is still 138.4MB. Free memory was 99.0MB in the beginning and 75.4MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.23ms. Allocated memory is still 138.4MB. Free memory was 75.4MB in the beginning and 72.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.57ms. Allocated memory is still 138.4MB. Free memory was 72.8MB in the beginning and 70.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1497.36ms. Allocated memory was 138.4MB in the beginning and 180.4MB in the end (delta: 41.9MB). Free memory was 70.7MB in the beginning and 119.2MB in the end (delta: -48.5MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 42780.49ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.2MB in the beginning and 1.0GB in the end (delta: -912.7MB). Peak memory consumption was 99.2MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 1.2GB. Free memory is still 1.0GB. 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: 14.3s, 175 PlacesBefore, 71 PlacesAfterwards, 168 TransitionsBefore, 62 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 7 FixpointIterations, 70 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 164 TotalNumberOfCompositions, 19753 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8575, independent: 8188, independent conditional: 0, independent unconditional: 8188, dependent: 387, dependent conditional: 0, dependent unconditional: 387, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2758, independent: 2692, independent conditional: 0, independent unconditional: 2692, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8575, independent: 5496, independent conditional: 0, independent unconditional: 5496, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 2758, unknown conditional: 0, unknown unconditional: 2758] , Statistics on independence cache: Total cache size (in pairs): 406, Positive cache size: 372, Positive conditional cache size: 0, Positive unconditional cache size: 372, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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(&t2049, ((void *)0), P0, ((void *)0))=9, t2049={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, pthread_create(&t2050, ((void *)0), P1, ((void *)0))=10, t2049={7:0}, t2050={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=1, weak$$choice2=255, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, t2049={7:0}, t2050={8:0}, t2051={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=11, t2049={7:0}, t2050={8:0}, t2051={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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=1, main$tmp_guard1=0, t2049={7:0}, t2050={8:0}, t2051={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] 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_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 216 locations, 61 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: 42.4s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1948 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1455 mSDsluCounter, 552 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 457 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4128 IncrementalHoareTripleChecker+Invalid, 4425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 95 mSDtfsCounter, 4128 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=15, InterpolantAutomatonStates: 97, 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.7s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 2461 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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 21:15:58,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:16:00,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:16:01,055 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 21:16:01,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:16:01,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:16:01,110 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:16:01,111 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:16:01,111 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:16:01,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:16:01,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:16:01,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:16:01,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:16:01,115 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:16:01,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:16:01,116 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:16:01,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:16:01,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:16:01,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:16:01,118 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:16:01,119 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:16:01,119 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:16:01,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:16:01,120 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:16:01,121 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:16:01,121 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:16:01,122 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:16:01,122 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:16:01,122 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:16:01,123 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:16:01,123 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:16:01,125 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:16:01,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:01,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:16:01,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:16:01,126 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:16:01,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:16:01,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:16:01,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:16:01,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:16:01,128 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:16:01,129 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:16:01,129 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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 -> c0d36e1a5ffb179c1d1cdd78990789e54ced4be7c39ab7d274d26f9b2f26b935 [2023-11-06 21:16:01,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:16:01,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:16:01,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:16:01,592 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:16:01,592 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:16:01,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2023-11-06 21:16:04,651 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:16:05,003 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:16:05,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/sv-benchmarks/c/pthread-wmm/safe012_power.oepc.i [2023-11-06 21:16:05,031 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/28e758bcd/7cfaa75463f54567ad19c319153ef7b8/FLAGe10c67112 [2023-11-06 21:16:05,046 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/data/28e758bcd/7cfaa75463f54567ad19c319153ef7b8 [2023-11-06 21:16:05,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:16:05,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:16:05,052 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:05,052 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:16:05,058 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:16:05,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:05,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1754daee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05, skipping insertion in model container [2023-11-06 21:16:05,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:05,118 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:16:05,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:05,740 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:16:05,829 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:16:05,889 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:16:05,889 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:16:05,897 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:16:05,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05 WrapperNode [2023-11-06 21:16:05,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:16:05,899 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:05,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:16:05,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:16:05,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:05,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,007 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-06 21:16:06,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:16:06,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:16:06,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:16:06,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:16:06,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,022 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,073 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:16:06,086 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:16:06,086 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:16:06,086 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:16:06,087 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (1/1) ... [2023-11-06 21:16:06,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:16:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:06,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:16:06,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:16:06,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 21:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:16:06,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 21:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-06 21:16:06,177 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:16:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:16:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:16:06,178 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:16:06,178 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:16:06,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:16:06,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:16:06,181 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 21:16:06,350 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:16:06,353 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:16:07,042 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:16:07,746 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:16:07,747 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:16:07,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:07 BoogieIcfgContainer [2023-11-06 21:16:07,751 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:16:07,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:16:07,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:16:07,759 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:16:07,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:05" (1/3) ... [2023-11-06 21:16:07,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bce572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:07, skipping insertion in model container [2023-11-06 21:16:07,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:05" (2/3) ... [2023-11-06 21:16:07,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32bce572 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:07, skipping insertion in model container [2023-11-06 21:16:07,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:07" (3/3) ... [2023-11-06 21:16:07,766 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.oepc.i [2023-11-06 21:16:07,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:16:07,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 36 error locations. [2023-11-06 21:16:07,786 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:16:07,988 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:16:08,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 172 transitions, 356 flow [2023-11-06 21:16:08,173 INFO L124 PetriNetUnfolderBase]: 3/169 cut-off events. [2023-11-06 21:16:08,174 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:08,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 3/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 215 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 21:16:08,181 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 172 transitions, 356 flow [2023-11-06 21:16:08,192 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 176 places, 169 transitions, 347 flow [2023-11-06 21:16:08,197 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:16:08,212 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 169 transitions, 347 flow [2023-11-06 21:16:08,217 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 176 places, 169 transitions, 347 flow [2023-11-06 21:16:08,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 169 transitions, 347 flow [2023-11-06 21:16:08,308 INFO L124 PetriNetUnfolderBase]: 3/169 cut-off events. [2023-11-06 21:16:08,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:08,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 169 events. 3/169 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 214 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 110. Up to 2 conditions per place. [2023-11-06 21:16:08,316 INFO L119 LiptonReduction]: Number of co-enabled transitions 5746 [2023-11-06 21:16:36,549 INFO L134 LiptonReduction]: Checked pairs total: 21780 [2023-11-06 21:16:36,550 INFO L136 LiptonReduction]: Total number of compositions: 161 [2023-11-06 21:16:36,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:16:36,573 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;@18c00393, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:16:36,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2023-11-06 21:16:36,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:16:36,577 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-11-06 21:16:36,578 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:36,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:36,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:16:36,579 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:36,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash 964, now seen corresponding path program 1 times [2023-11-06 21:16:36,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:36,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024186603] [2023-11-06 21:16:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:36,600 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 21:16:36,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:36,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:36,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:36,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 21:16:36,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:36,737 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 21:16:36,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:36,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024186603] [2023-11-06 21:16:36,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024186603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:36,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:36,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:16:36,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317642831] [2023-11-06 21:16:36,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:36,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:16:36,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:36,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:16:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:16:36,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 333 [2023-11-06 21:16:36,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:36,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:36,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 333 [2023-11-06 21:16:36,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:38,653 INFO L124 PetriNetUnfolderBase]: 4714/6836 cut-off events. [2023-11-06 21:16:38,654 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:38,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13683 conditions, 6836 events. 4714/6836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 41871 event pairs, 4714 based on Foata normal form. 0/3761 useless extension candidates. Maximal degree in co-relation 13672. Up to 6801 conditions per place. [2023-11-06 21:16:38,736 INFO L140 encePairwiseOnDemand]: 312/333 looper letters, 36 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2023-11-06 21:16:38,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 40 transitions, 161 flow [2023-11-06 21:16:38,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:16:38,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:16:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 327 transitions. [2023-11-06 21:16:38,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49099099099099097 [2023-11-06 21:16:38,760 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 327 transitions. [2023-11-06 21:16:38,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 327 transitions. [2023-11-06 21:16:38,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:38,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 327 transitions. [2023-11-06 21:16:38,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 163.5) internal successors, (327), 2 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,782 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,784 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 2 states and 327 transitions. [2023-11-06 21:16:38,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 40 transitions, 161 flow [2023-11-06 21:16:38,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 158 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:38,794 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 86 flow [2023-11-06 21:16:38,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 21:16:38,803 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 21:16:38,804 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 86 flow [2023-11-06 21:16:38,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 135.5) internal successors, (271), 2 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:38,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:38,805 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 21:16:38,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:39,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:39,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:39,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:39,024 INFO L85 PathProgramCache]: Analyzing trace with hash 950086, now seen corresponding path program 1 times [2023-11-06 21:16:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764734438] [2023-11-06 21:16:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:39,026 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 21:16:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:39,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:39,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:39,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:39,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:39,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:16:39,271 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-06 21:16:39,322 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 21:16:39,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:39,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764734438] [2023-11-06 21:16:39,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764734438] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:39,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:39,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:16:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189840361] [2023-11-06 21:16:39,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:39,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:39,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:39,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:39,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:39,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 333 [2023-11-06 21:16:39,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:39,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:39,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 333 [2023-11-06 21:16:39,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:40,350 INFO L124 PetriNetUnfolderBase]: 2095/3109 cut-off events. [2023-11-06 21:16:40,350 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:40,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6226 conditions, 3109 events. 2095/3109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 17208 event pairs, 2095 based on Foata normal form. 0/2090 useless extension candidates. Maximal degree in co-relation 6223. Up to 3080 conditions per place. [2023-11-06 21:16:40,411 INFO L140 encePairwiseOnDemand]: 326/333 looper letters, 29 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-11-06 21:16:40,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 34 transitions, 134 flow [2023-11-06 21:16:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:40,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 438 transitions. [2023-11-06 21:16:40,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43843843843843844 [2023-11-06 21:16:40,416 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 438 transitions. [2023-11-06 21:16:40,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 438 transitions. [2023-11-06 21:16:40,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:40,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 438 transitions. [2023-11-06 21:16:40,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:40,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:40,424 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:40,424 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 86 flow. Second operand 3 states and 438 transitions. [2023-11-06 21:16:40,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 34 transitions, 134 flow [2023-11-06 21:16:40,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 34 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:16:40,426 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 76 flow [2023-11-06 21:16:40,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-11-06 21:16:40,428 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 21:16:40,428 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 76 flow [2023-11-06 21:16:40,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:40,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:40,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 21:16:40,454 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:40,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:40,640 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:40,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:40,641 INFO L85 PathProgramCache]: Analyzing trace with hash 950085, now seen corresponding path program 1 times [2023-11-06 21:16:40,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:40,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383310240] [2023-11-06 21:16:40,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:40,642 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 21:16:40,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:40,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:40,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:40,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:16:40,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:40,811 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 21:16:40,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-06 21:16:40,863 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 21:16:40,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:40,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383310240] [2023-11-06 21:16:40,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383310240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:40,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:16:40,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316352238] [2023-11-06 21:16:40,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:40,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:40,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:40,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:40,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:41,027 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 21:16:41,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:41,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 21:16:41,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:41,855 INFO L124 PetriNetUnfolderBase]: 1248/1886 cut-off events. [2023-11-06 21:16:41,855 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:16:41,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 1886 events. 1248/1886 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 9488 event pairs, 712 based on Foata normal form. 63/1564 useless extension candidates. Maximal degree in co-relation 3786. Up to 1053 conditions per place. [2023-11-06 21:16:41,877 INFO L140 encePairwiseOnDemand]: 325/333 looper letters, 34 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-11-06 21:16:41,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 158 flow [2023-11-06 21:16:41,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 21:16:41,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2023-11-06 21:16:41,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 21:16:41,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 21:16:41,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:41,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 21:16:41,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,887 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 76 flow. Second operand 3 states and 435 transitions. [2023-11-06 21:16:41,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 158 flow [2023-11-06 21:16:41,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 157 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:41,890 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 85 flow [2023-11-06 21:16:41,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 21:16:41,891 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 21:16:41,892 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 85 flow [2023-11-06 21:16:41,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:41,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:41,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:41,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,106 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:42,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:42,106 INFO L85 PathProgramCache]: Analyzing trace with hash 729522853, now seen corresponding path program 1 times [2023-11-06 21:16:42,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114945769] [2023-11-06 21:16:42,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:42,108 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 21:16:42,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:42,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:42,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 21:16:42,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:42,308 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 21:16:42,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:42,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:42,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114945769] [2023-11-06 21:16:42,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114945769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:42,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:42,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:16:42,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865567946] [2023-11-06 21:16:42,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:42,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:16:42,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:42,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:16:42,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:16:42,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 21:16:42,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:42,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 21:16:42,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:42,742 INFO L124 PetriNetUnfolderBase]: 588/989 cut-off events. [2023-11-06 21:16:42,742 INFO L125 PetriNetUnfolderBase]: For 48/60 co-relation queries the response was YES. [2023-11-06 21:16:42,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2136 conditions, 989 events. 588/989 cut-off events. For 48/60 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4867 event pairs, 191 based on Foata normal form. 12/857 useless extension candidates. Maximal degree in co-relation 2131. Up to 921 conditions per place. [2023-11-06 21:16:42,751 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2023-11-06 21:16:42,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 197 flow [2023-11-06 21:16:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:16:42,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:16:42,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-11-06 21:16:42,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43543543543543545 [2023-11-06 21:16:42,759 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-11-06 21:16:42,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-11-06 21:16:42,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:42,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-11-06 21:16:42,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,772 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 85 flow. Second operand 3 states and 435 transitions. [2023-11-06 21:16:42,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 197 flow [2023-11-06 21:16:42,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:42,776 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 107 flow [2023-11-06 21:16:42,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-06 21:16:42,779 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -26 predicate places. [2023-11-06 21:16:42,779 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 107 flow [2023-11-06 21:16:42,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:42,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:42,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:42,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:42,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:42,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:42,993 INFO L85 PathProgramCache]: Analyzing trace with hash 392516364, now seen corresponding path program 1 times [2023-11-06 21:16:42,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:42,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332512784] [2023-11-06 21:16:42,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:42,994 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 21:16:42,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:42,996 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:43,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:43,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:16:43,203 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:43,281 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 21:16:43,282 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:43,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332512784] [2023-11-06 21:16:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1332512784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:43,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45507807] [2023-11-06 21:16:43,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:43,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:43,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:43,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:43,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:43,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 21:16:43,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:43,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:43,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 21:16:43,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:43,593 INFO L124 PetriNetUnfolderBase]: 161/334 cut-off events. [2023-11-06 21:16:43,594 INFO L125 PetriNetUnfolderBase]: For 60/62 co-relation queries the response was YES. [2023-11-06 21:16:43,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 334 events. 161/334 cut-off events. For 60/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1286 event pairs, 43 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 832. Up to 202 conditions per place. [2023-11-06 21:16:43,597 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 44 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-11-06 21:16:43,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 261 flow [2023-11-06 21:16:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:16:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:16:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-06 21:16:43,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43243243243243246 [2023-11-06 21:16:43,600 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-06 21:16:43,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-06 21:16:43,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:43,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-06 21:16:43,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:43,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:43,607 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:43,607 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 107 flow. Second operand 4 states and 576 transitions. [2023-11-06 21:16:43,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 261 flow [2023-11-06 21:16:43,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:43,610 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 143 flow [2023-11-06 21:16:43,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-06 21:16:43,611 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2023-11-06 21:16:43,611 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 143 flow [2023-11-06 21:16:43,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:43,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:43,612 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 21:16:43,630 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:43,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:43,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:43,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:43,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1435288668, now seen corresponding path program 1 times [2023-11-06 21:16:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:43,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765874480] [2023-11-06 21:16:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:43,826 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 21:16:43,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:43,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:43,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:44,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 21:16:44,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:44,065 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 21:16:44,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:44,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:44,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765874480] [2023-11-06 21:16:44,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765874480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:44,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:44,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:16:44,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120493702] [2023-11-06 21:16:44,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:44,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:44,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:44,083 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 21:16:44,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 143 flow. Second operand has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:44,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 21:16:44,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:44,405 INFO L124 PetriNetUnfolderBase]: 82/172 cut-off events. [2023-11-06 21:16:44,405 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-11-06 21:16:44,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 504 conditions, 172 events. 82/172 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 513 event pairs, 24 based on Foata normal form. 7/172 useless extension candidates. Maximal degree in co-relation 497. Up to 70 conditions per place. [2023-11-06 21:16:44,407 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 37 selfloop transitions, 10 changer transitions 1/51 dead transitions. [2023-11-06 21:16:44,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 51 transitions, 263 flow [2023-11-06 21:16:44,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:16:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:16:44,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 704 transitions. [2023-11-06 21:16:44,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4228228228228228 [2023-11-06 21:16:44,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 704 transitions. [2023-11-06 21:16:44,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 704 transitions. [2023-11-06 21:16:44,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:44,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 704 transitions. [2023-11-06 21:16:44,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,420 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,420 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 143 flow. Second operand 5 states and 704 transitions. [2023-11-06 21:16:44,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 51 transitions, 263 flow [2023-11-06 21:16:44,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 51 transitions, 247 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:44,423 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2023-11-06 21:16:44,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-11-06 21:16:44,424 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -25 predicate places. [2023-11-06 21:16:44,425 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2023-11-06 21:16:44,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:44,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:44,426 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 21:16:44,444 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:44,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:44,639 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:44,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:44,639 INFO L85 PathProgramCache]: Analyzing trace with hash 830563236, now seen corresponding path program 1 times [2023-11-06 21:16:44,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:44,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454460723] [2023-11-06 21:16:44,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:44,640 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 21:16:44,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:44,641 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:44,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:44,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 21:16:44,848 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:44,929 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 21:16:44,929 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:44,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:44,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454460723] [2023-11-06 21:16:44,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454460723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:44,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:44,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338762771] [2023-11-06 21:16:44,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:44,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:44,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:44,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:44,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:45,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2023-11-06 21:16:45,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:45,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2023-11-06 21:16:45,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:45,257 INFO L124 PetriNetUnfolderBase]: 94/204 cut-off events. [2023-11-06 21:16:45,258 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2023-11-06 21:16:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588 conditions, 204 events. 94/204 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 728 event pairs, 13 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 581. Up to 139 conditions per place. [2023-11-06 21:16:45,260 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 42 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-11-06 21:16:45,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 46 transitions, 277 flow [2023-11-06 21:16:45,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:16:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:16:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-11-06 21:16:45,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41516516516516516 [2023-11-06 21:16:45,267 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-11-06 21:16:45,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-11-06 21:16:45,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:45,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-11-06 21:16:45,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,282 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,282 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 553 transitions. [2023-11-06 21:16:45,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 46 transitions, 277 flow [2023-11-06 21:16:45,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 245 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:45,291 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 113 flow [2023-11-06 21:16:45,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-11-06 21:16:45,293 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 21:16:45,293 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 113 flow [2023-11-06 21:16:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:45,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:45,294 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 21:16:45,308 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:45,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:45,508 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:45,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash 344344395, now seen corresponding path program 1 times [2023-11-06 21:16:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525590038] [2023-11-06 21:16:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:45,509 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 21:16:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:45,510 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:45,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:45,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 21:16:45,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:45,846 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:45,847 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:45,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525590038] [2023-11-06 21:16:45,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525590038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:45,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:45,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:45,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50670336] [2023-11-06 21:16:45,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:45,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:45,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:46,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2023-11-06 21:16:46,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:46,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2023-11-06 21:16:46,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:46,254 INFO L124 PetriNetUnfolderBase]: 94/203 cut-off events. [2023-11-06 21:16:46,255 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2023-11-06 21:16:46,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 203 events. 94/203 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 720 event pairs, 13 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 562. Up to 141 conditions per place. [2023-11-06 21:16:46,257 INFO L140 encePairwiseOnDemand]: 330/333 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-11-06 21:16:46,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 245 flow [2023-11-06 21:16:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:16:46,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 21:16:46,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 560 transitions. [2023-11-06 21:16:46,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42042042042042044 [2023-11-06 21:16:46,260 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 560 transitions. [2023-11-06 21:16:46,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 560 transitions. [2023-11-06 21:16:46,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:46,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 560 transitions. [2023-11-06 21:16:46,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,267 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 113 flow. Second operand 4 states and 560 transitions. [2023-11-06 21:16:46,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 245 flow [2023-11-06 21:16:46,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:46,270 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 112 flow [2023-11-06 21:16:46,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-06 21:16:46,271 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -27 predicate places. [2023-11-06 21:16:46,272 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 112 flow [2023-11-06 21:16:46,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:46,272 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 21:16:46,289 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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)] Ended with exit code 0 [2023-11-06 21:16:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:46,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:46,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:46,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1140017037, now seen corresponding path program 1 times [2023-11-06 21:16:46,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:46,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948127047] [2023-11-06 21:16:46,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:46,487 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 21:16:46,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:46,488 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:46,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:46,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:46,723 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:46,797 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 21:16:46,797 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:46,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:46,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948127047] [2023-11-06 21:16:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948127047] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:46,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:46,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:16:46,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531125150] [2023-11-06 21:16:46,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:46,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:46,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:46,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:46,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:46,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2023-11-06 21:16:46,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:46,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:46,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2023-11-06 21:16:46,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:47,165 INFO L124 PetriNetUnfolderBase]: 160/336 cut-off events. [2023-11-06 21:16:47,165 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2023-11-06 21:16:47,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 336 events. 160/336 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1432 event pairs, 30 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 933. Up to 139 conditions per place. [2023-11-06 21:16:47,169 INFO L140 encePairwiseOnDemand]: 329/333 looper letters, 67 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-11-06 21:16:47,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 72 transitions, 411 flow [2023-11-06 21:16:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:16:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:16:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2023-11-06 21:16:47,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42342342342342343 [2023-11-06 21:16:47,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 705 transitions. [2023-11-06 21:16:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 705 transitions. [2023-11-06 21:16:47,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:47,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 705 transitions. [2023-11-06 21:16:47,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.0) internal successors, (705), 5 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,181 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,181 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 112 flow. Second operand 5 states and 705 transitions. [2023-11-06 21:16:47,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 72 transitions, 411 flow [2023-11-06 21:16:47,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:16:47,186 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 131 flow [2023-11-06 21:16:47,186 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-11-06 21:16:47,187 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2023-11-06 21:16:47,187 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 131 flow [2023-11-06 21:16:47,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:47,188 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 21:16:47,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:47,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:47,401 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:47,401 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:47,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1801723803, now seen corresponding path program 2 times [2023-11-06 21:16:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721338723] [2023-11-06 21:16:47,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 21:16:47,402 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 21:16:47,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:47,403 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:47,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 21:16:47,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 21:16:47,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:47,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:47,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:47,738 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 21:16:47,738 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:47,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:47,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1721338723] [2023-11-06 21:16:47,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1721338723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:47,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:47,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:47,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011114269] [2023-11-06 21:16:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:47,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:47,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:47,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:47,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2023-11-06 21:16:47,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 131 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:47,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:47,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2023-11-06 21:16:47,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:48,085 INFO L124 PetriNetUnfolderBase]: 194/435 cut-off events. [2023-11-06 21:16:48,086 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-11-06 21:16:48,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 435 events. 194/435 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2197 event pairs, 20 based on Foata normal form. 1/436 useless extension candidates. Maximal degree in co-relation 1347. Up to 186 conditions per place. [2023-11-06 21:16:48,090 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 67 selfloop transitions, 7 changer transitions 0/77 dead transitions. [2023-11-06 21:16:48,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 457 flow [2023-11-06 21:16:48,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:16:48,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 838 transitions. [2023-11-06 21:16:48,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4194194194194194 [2023-11-06 21:16:48,094 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 838 transitions. [2023-11-06 21:16:48,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 838 transitions. [2023-11-06 21:16:48,095 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:48,095 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 838 transitions. [2023-11-06 21:16:48,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.66666666666666) internal successors, (838), 6 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,103 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,103 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 131 flow. Second operand 6 states and 838 transitions. [2023-11-06 21:16:48,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 457 flow [2023-11-06 21:16:48,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:48,109 INFO L231 Difference]: Finished difference. Result has 56 places, 37 transitions, 172 flow [2023-11-06 21:16:48,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=56, PETRI_TRANSITIONS=37} [2023-11-06 21:16:48,110 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -15 predicate places. [2023-11-06 21:16:48,110 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 37 transitions, 172 flow [2023-11-06 21:16:48,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:48,111 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 21:16:48,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:48,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:48,323 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:48,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:48,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1980720231, now seen corresponding path program 3 times [2023-11-06 21:16:48,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:48,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897366585] [2023-11-06 21:16:48,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 21:16:48,324 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 21:16:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:48,325 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:48,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 21:16:48,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 21:16:48,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 21:16:48,544 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:16:48,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:48,622 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 21:16:48,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 21:16:48,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 21:16:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897366585] [2023-11-06 21:16:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897366585] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:48,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:48,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:48,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269097899] [2023-11-06 21:16:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:48,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:16:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 21:16:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:16:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:16:48,632 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2023-11-06 21:16:48,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 37 transitions, 172 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:48,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2023-11-06 21:16:48,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:48,979 INFO L124 PetriNetUnfolderBase]: 217/507 cut-off events. [2023-11-06 21:16:48,980 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2023-11-06 21:16:48,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 507 events. 217/507 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2696 event pairs, 30 based on Foata normal form. 1/508 useless extension candidates. Maximal degree in co-relation 1736. Up to 214 conditions per place. [2023-11-06 21:16:48,985 INFO L140 encePairwiseOnDemand]: 328/333 looper letters, 69 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-11-06 21:16:48,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 81 transitions, 510 flow [2023-11-06 21:16:48,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:48,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:16:48,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 841 transitions. [2023-11-06 21:16:48,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4209209209209209 [2023-11-06 21:16:48,990 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 841 transitions. [2023-11-06 21:16:48,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 841 transitions. [2023-11-06 21:16:48,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:48,992 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 841 transitions. [2023-11-06 21:16:48,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.16666666666666) internal successors, (841), 6 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:48,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:49,000 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:49,000 INFO L175 Difference]: Start difference. First operand has 56 places, 37 transitions, 172 flow. Second operand 6 states and 841 transitions. [2023-11-06 21:16:49,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 81 transitions, 510 flow [2023-11-06 21:16:49,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:16:49,006 INFO L231 Difference]: Finished difference. Result has 62 places, 40 transitions, 217 flow [2023-11-06 21:16:49,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=62, PETRI_TRANSITIONS=40} [2023-11-06 21:16:49,007 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, -9 predicate places. [2023-11-06 21:16:49,007 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 217 flow [2023-11-06 21:16:49,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:16:49,008 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:49,008 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 21:16:49,022 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:49,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:49,221 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2023-11-06 21:16:49,222 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -705463133, now seen corresponding path program 4 times [2023-11-06 21:16:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:16:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [72542489] [2023-11-06 21:16:49,222 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 21:16:49,222 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 21:16:49,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:16:49,224 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:49,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 (13)] Waiting until timeout for monitored process [2023-11-06 21:16:49,537 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 21:16:49,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 21:16:49,537 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:16:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:16:49,772 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 21:16:49,772 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:16:49,774 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2023-11-06 21:16:49,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2023-11-06 21:16:49,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2023-11-06 21:16:49,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2023-11-06 21:16:49,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2023-11-06 21:16:49,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2023-11-06 21:16:49,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2023-11-06 21:16:49,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2023-11-06 21:16:49,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2023-11-06 21:16:49,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2023-11-06 21:16:49,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2023-11-06 21:16:49,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2023-11-06 21:16:49,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2023-11-06 21:16:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2023-11-06 21:16:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2023-11-06 21:16:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 61 remaining) [2023-11-06 21:16:49,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 61 remaining) [2023-11-06 21:16:49,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2023-11-06 21:16:49,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2023-11-06 21:16:49,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2023-11-06 21:16:49,780 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2023-11-06 21:16:49,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2023-11-06 21:16:49,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2023-11-06 21:16:49,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 61 remaining) [2023-11-06 21:16:49,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 61 remaining) [2023-11-06 21:16:49,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 61 remaining) [2023-11-06 21:16:49,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 61 remaining) [2023-11-06 21:16:49,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 61 remaining) [2023-11-06 21:16:49,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 61 remaining) [2023-11-06 21:16:49,782 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 61 remaining) [2023-11-06 21:16:49,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 61 remaining) [2023-11-06 21:16:49,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 61 remaining) [2023-11-06 21:16:49,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2023-11-06 21:16:49,783 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2023-11-06 21:16:49,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2023-11-06 21:16:49,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (25 of 61 remaining) [2023-11-06 21:16:49,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 61 remaining) [2023-11-06 21:16:49,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 61 remaining) [2023-11-06 21:16:49,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 61 remaining) [2023-11-06 21:16:49,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2023-11-06 21:16:49,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2023-11-06 21:16:49,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2023-11-06 21:16:49,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2023-11-06 21:16:49,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2023-11-06 21:16:49,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2023-11-06 21:16:49,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2023-11-06 21:16:49,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2023-11-06 21:16:49,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2023-11-06 21:16:49,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2023-11-06 21:16:49,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2023-11-06 21:16:49,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2023-11-06 21:16:49,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2023-11-06 21:16:49,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 61 remaining) [2023-11-06 21:16:49,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 61 remaining) [2023-11-06 21:16:49,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 61 remaining) [2023-11-06 21:16:49,788 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 61 remaining) [2023-11-06 21:16:49,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 61 remaining) [2023-11-06 21:16:49,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 61 remaining) [2023-11-06 21:16:49,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 61 remaining) [2023-11-06 21:16:49,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 61 remaining) [2023-11-06 21:16:49,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 61 remaining) [2023-11-06 21:16:49,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 (13)] Forceful destruction successful, exit code 0 [2023-11-06 21:16:50,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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 21:16:50,004 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:50,012 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:16:50,012 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:16:50,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:16:50 BasicIcfg [2023-11-06 21:16:50,142 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:16:50,143 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:16:50,145 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:16:50,146 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:16:50,146 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:07" (3/4) ... [2023-11-06 21:16:50,148 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:16:50,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:16:50,150 INFO L158 Benchmark]: Toolchain (without parser) took 45099.73ms. Allocated memory was 73.4MB in the beginning and 956.3MB in the end (delta: 882.9MB). Free memory was 48.2MB in the beginning and 845.1MB in the end (delta: -796.9MB). Peak memory consumption was 87.5MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,151 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:50,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 846.29ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 61.6MB in the end (delta: -13.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,153 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.83ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 59.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,153 INFO L158 Benchmark]: Boogie Preprocessor took 74.47ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,153 INFO L158 Benchmark]: RCFGBuilder took 1665.59ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 58.0MB in the end (delta: -1.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,154 INFO L158 Benchmark]: TraceAbstraction took 42386.99ms. Allocated memory was 94.4MB in the beginning and 956.3MB in the end (delta: 861.9MB). Free memory was 57.7MB in the beginning and 845.1MB in the end (delta: -787.4MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. [2023-11-06 21:16:50,154 INFO L158 Benchmark]: Witness Printer took 6.61ms. Allocated memory is still 956.3MB. Free memory is still 845.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:16:50,156 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 73.4MB. Free memory is still 49.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 846.29ms. Allocated memory was 73.4MB in the beginning and 94.4MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 61.6MB in the end (delta: -13.6MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.83ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 59.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.47ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 56.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1665.59ms. Allocated memory is still 94.4MB. Free memory was 56.6MB in the beginning and 58.0MB in the end (delta: -1.4MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42386.99ms. Allocated memory was 94.4MB in the beginning and 956.3MB in the end (delta: 861.9MB). Free memory was 57.7MB in the beginning and 845.1MB in the end (delta: -787.4MB). Peak memory consumption was 75.6MB. Max. memory is 16.1GB. * Witness Printer took 6.61ms. Allocated memory is still 956.3MB. Free memory is still 845.1MB. 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: 28.3s, 176 PlacesBefore, 71 PlacesAfterwards, 169 TransitionsBefore, 62 TransitionsAfterwards, 5746 CoEnabledTransitionPairs, 8 FixpointIterations, 67 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 2 ChoiceCompositions, 161 TotalNumberOfCompositions, 21780 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9236, independent: 8793, independent conditional: 0, independent unconditional: 8793, dependent: 443, dependent conditional: 0, dependent unconditional: 443, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2761, independent: 2694, independent conditional: 0, independent unconditional: 2694, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9236, independent: 6099, independent conditional: 0, independent unconditional: 6099, dependent: 376, dependent conditional: 0, dependent unconditional: 376, unknown: 2761, unknown conditional: 0, unknown unconditional: 2761] , Statistics on independence cache: Total cache size (in pairs): 404, Positive cache size: 370, Positive conditional cache size: 0, Positive unconditional cache size: 370, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L837] 0 pthread_t t2049; [L838] FCALL, FORK 0 pthread_create(&t2049, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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(&t2049, ((void *)0), P0, ((void *)0))=-1610612736, t2049={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L839] 0 pthread_t t2050; [L840] FCALL, FORK 0 pthread_create(&t2050, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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(&t2050, ((void *)0), P1, ((void *)0))=-1610612735, t2049={7:0}, t2050={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L841] 0 pthread_t t2051; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L842] FCALL, FORK 0 pthread_create(&t2051, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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, pthread_create(&t2051, ((void *)0), P2, ((void *)0))=-1610612734, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] EXPR 1 \read(z) [L768] EXPR 1 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L768] 1 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L769] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)))) [L770] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)))) [L771] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (weak$$choice0 ? z$r_buff1_thd1 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd1 && z$w_buff1_used && !z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L777] EXPR 1 \read(z) [L777] 1 __unbuffered_p0_EAX = z [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] EXPR 1 \read(z) [L778] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L778] 1 z = z$flush_delayed ? z$mem_tmp : z [L779] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L782] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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$$choice1=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L794] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L797] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L809] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L812] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 \read(z) [L815] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L818] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L819] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L846] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L846] RET 0 assume_abort_if_not(main$tmp_guard0) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 \read(z) [L848] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __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=1, main$tmp_guard1=0, t2049={7:0}, t2050={14:0}, t2051={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] [L855] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L856] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L856] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L857] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L859] 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_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=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=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 835]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 840]: 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: 838]: 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: 842]: 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, 217 locations, 61 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: 42.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 38 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 27 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 11 mSDtfsCounter, 1119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=217occurred in iteration=11, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 143 ConstructedInterpolants, 2 QuantifiedInterpolants, 673 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1515 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 21:16:50,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a022801b-ca22-41dd-8d8d-288bc7c1cef9/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