./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/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 c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:22:49,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:22:49,422 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:22:49,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:22:49,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:22:49,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:22:49,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:22:49,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:22:49,497 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:22:49,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:22:49,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:22:49,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:22:49,506 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:22:49,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:22:49,509 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:22:49,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:22:49,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:22:49,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:22:49,511 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:22:49,512 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:22:49,512 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:22:49,513 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:22:49,513 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:22:49,514 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:22:49,515 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:22:49,515 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:22:49,516 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:22:49,517 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:22:49,518 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:22:49,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:49,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:22:49,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:22:49,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:22:49,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:22:49,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:22:49,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:22:49,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:22:49,522 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:22:49,523 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_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 [2023-11-06 22:22:49,938 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:22:49,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:22:49,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:22:49,980 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:22:49,981 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:22:49,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-11-06 22:22:53,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:22:54,114 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:22:54,115 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-11-06 22:22:54,136 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/dec9ae569/1496f23f5e784961ac6e4579857c99fc/FLAG9b1cdb1ac [2023-11-06 22:22:54,154 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/dec9ae569/1496f23f5e784961ac6e4579857c99fc [2023-11-06 22:22:54,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:22:54,160 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:22:54,162 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:54,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:22:54,172 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:22:54,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:54,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44c8cf08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54, skipping insertion in model container [2023-11-06 22:22:54,177 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:54,241 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:22:54,778 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:54,796 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:22:54,877 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:22:54,930 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:22:54,930 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:22:54,938 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:22:54,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54 WrapperNode [2023-11-06 22:22:54,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:22:54,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:54,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:22:54,941 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:22:54,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:54,969 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,002 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-06 22:22:55,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:22:55,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:22:55,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:22:55,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:22:55,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:22:55,054 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:22:55,054 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:22:55,055 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:22:55,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (1/1) ... [2023-11-06 22:22:55,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:22:55,085 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:22:55,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:22:55,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:22:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:22:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:22:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:22:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:22:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:22:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:22:55,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:22:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:22:55,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:22:55,146 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:22:55,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:22:55,147 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:22:55,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:22:55,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:22:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:22:55,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:22:55,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:22:55,150 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:22:55,337 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:22:55,339 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:22:55,916 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:22:56,130 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:22:56,131 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:22:56,135 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:56 BoogieIcfgContainer [2023-11-06 22:22:56,136 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:22:56,141 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:22:56,141 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:22:56,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:22:56,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:22:54" (1/3) ... [2023-11-06 22:22:56,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37eb2e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:56, skipping insertion in model container [2023-11-06 22:22:56,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:22:54" (2/3) ... [2023-11-06 22:22:56,150 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37eb2e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:22:56, skipping insertion in model container [2023-11-06 22:22:56,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:56" (3/3) ... [2023-11-06 22:22:56,196 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2023-11-06 22:22:56,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:22:56,222 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:22:56,222 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:22:56,370 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:22:56,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:22:56,523 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:22:56,523 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:56,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:22:56,533 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 22:22:56,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 146 transitions, 304 flow [2023-11-06 22:22:56,545 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:22:56,566 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:22:56,580 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 146 transitions, 304 flow [2023-11-06 22:22:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 304 flow [2023-11-06 22:22:56,662 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 22:22:56,662 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:22:56,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:22:56,672 INFO L119 LiptonReduction]: Number of co-enabled transitions 3676 [2023-11-06 22:23:03,554 INFO L134 LiptonReduction]: Checked pairs total: 9111 [2023-11-06 22:23:03,554 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-11-06 22:23:03,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:03,576 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;@6ba23632, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:03,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:23:03,578 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:23:03,578 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:23:03,579 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:03,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:03,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:23:03,580 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:03,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:03,585 INFO L85 PathProgramCache]: Analyzing trace with hash 639, now seen corresponding path program 1 times [2023-11-06 22:23:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:03,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589900289] [2023-11-06 22:23:03,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:03,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:03,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:03,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:03,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589900289] [2023-11-06 22:23:03,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589900289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:03,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:23:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032482902] [2023-11-06 22:23:03,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:03,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:03,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:03,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:03,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 299 [2023-11-06 22:23:03,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:03,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:03,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 299 [2023-11-06 22:23:03,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:05,117 INFO L124 PetriNetUnfolderBase]: 5049/7097 cut-off events. [2023-11-06 22:23:05,118 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-06 22:23:05,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14135 conditions, 7097 events. 5049/7097 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 37351 event pairs, 5049 based on Foata normal form. 0/6112 useless extension candidates. Maximal degree in co-relation 14123. Up to 6881 conditions per place. [2023-11-06 22:23:05,197 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:23:05,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:23:05,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:05,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:23:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 307 transitions. [2023-11-06 22:23:05,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5133779264214047 [2023-11-06 22:23:05,221 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 307 transitions. [2023-11-06 22:23:05,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 307 transitions. [2023-11-06 22:23:05,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:05,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 307 transitions. [2023-11-06 22:23:05,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.5) internal successors, (307), 2 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:05,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:05,242 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:05,244 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 307 transitions. [2023-11-06 22:23:05,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:23:05,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:05,255 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:23:05,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:23:05,261 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:23:05,262 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:23:05,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:05,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:05,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:05,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:23:05,264 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:05,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1608850950, now seen corresponding path program 1 times [2023-11-06 22:23:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:05,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410507140] [2023-11-06 22:23:05,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:05,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:05,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410507140] [2023-11-06 22:23:05,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410507140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:05,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706276880] [2023-11-06 22:23:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:05,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:05,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:05,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:05,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:05,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 299 [2023-11-06 22:23:05,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:05,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:05,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 299 [2023-11-06 22:23:05,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:06,730 INFO L124 PetriNetUnfolderBase]: 3975/5687 cut-off events. [2023-11-06 22:23:06,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:06,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11264 conditions, 5687 events. 3975/5687 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29744 event pairs, 1089 based on Foata normal form. 0/5266 useless extension candidates. Maximal degree in co-relation 11261. Up to 4303 conditions per place. [2023-11-06 22:23:06,779 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-06 22:23:06,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-11-06 22:23:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:06,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:06,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 447 transitions. [2023-11-06 22:23:06,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983277591973244 [2023-11-06 22:23:06,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 447 transitions. [2023-11-06 22:23:06,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 447 transitions. [2023-11-06 22:23:06,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:06,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 447 transitions. [2023-11-06 22:23:06,785 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:06,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:06,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:06,790 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 447 transitions. [2023-11-06 22:23:06,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-11-06 22:23:06,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:23:06,793 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:23:06,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:23:06,794 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:23:06,794 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:23:06,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:06,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:06,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:06,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:23:06,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:06,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:06,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2044815656, now seen corresponding path program 1 times [2023-11-06 22:23:06,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:06,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679911425] [2023-11-06 22:23:06,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:06,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:07,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:07,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679911425] [2023-11-06 22:23:07,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679911425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:07,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:07,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:07,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058982415] [2023-11-06 22:23:07,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:07,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:07,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:08,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 299 [2023-11-06 22:23:08,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:08,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:08,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 299 [2023-11-06 22:23:08,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:08,830 INFO L124 PetriNetUnfolderBase]: 2855/4099 cut-off events. [2023-11-06 22:23:08,831 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-11-06 22:23:08,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8438 conditions, 4099 events. 2855/4099 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20480 event pairs, 1056 based on Foata normal form. 0/3991 useless extension candidates. Maximal degree in co-relation 8434. Up to 3768 conditions per place. [2023-11-06 22:23:08,878 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 34 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-06 22:23:08,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 42 transitions, 174 flow [2023-11-06 22:23:08,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:08,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2023-11-06 22:23:08,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4096989966555184 [2023-11-06 22:23:08,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 735 transitions. [2023-11-06 22:23:08,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 735 transitions. [2023-11-06 22:23:08,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:08,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 735 transitions. [2023-11-06 22:23:08,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 122.5) internal successors, (735), 6 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:08,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:08,897 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:08,898 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 6 states and 735 transitions. [2023-11-06 22:23:08,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 42 transitions, 174 flow [2023-11-06 22:23:08,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:08,902 INFO L231 Difference]: Finished difference. Result has 42 places, 27 transitions, 70 flow [2023-11-06 22:23:08,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=27} [2023-11-06 22:23:08,903 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -9 predicate places. [2023-11-06 22:23:08,904 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 27 transitions, 70 flow [2023-11-06 22:23:08,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.0) internal successors, (708), 6 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:08,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:08,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:08,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:23:08,906 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:08,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash -2044815678, now seen corresponding path program 1 times [2023-11-06 22:23:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078637545] [2023-11-06 22:23:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:09,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:09,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078637545] [2023-11-06 22:23:09,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078637545] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:09,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:09,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:09,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584539120] [2023-11-06 22:23:09,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:09,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:09,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:09,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:09,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:09,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 299 [2023-11-06 22:23:09,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 27 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:09,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:09,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 299 [2023-11-06 22:23:09,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:11,040 INFO L124 PetriNetUnfolderBase]: 8375/11424 cut-off events. [2023-11-06 22:23:11,040 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-06 22:23:11,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23155 conditions, 11424 events. 8375/11424 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 53488 event pairs, 3715 based on Foata normal form. 480/11904 useless extension candidates. Maximal degree in co-relation 23151. Up to 9713 conditions per place. [2023-11-06 22:23:11,137 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 38 selfloop transitions, 5 changer transitions 24/67 dead transitions. [2023-11-06 22:23:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 296 flow [2023-11-06 22:23:11,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:11,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 694 transitions. [2023-11-06 22:23:11,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4642140468227425 [2023-11-06 22:23:11,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 694 transitions. [2023-11-06 22:23:11,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 694 transitions. [2023-11-06 22:23:11,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:11,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 694 transitions. [2023-11-06 22:23:11,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.8) internal successors, (694), 5 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,154 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,154 INFO L175 Difference]: Start difference. First operand has 42 places, 27 transitions, 70 flow. Second operand 5 states and 694 transitions. [2023-11-06 22:23:11,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 296 flow [2023-11-06 22:23:11,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 67 transitions, 284 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:11,159 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 108 flow [2023-11-06 22:23:11,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2023-11-06 22:23:11,161 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-11-06 22:23:11,162 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 108 flow [2023-11-06 22:23:11,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:11,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:11,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:23:11,164 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:11,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:11,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1240056906, now seen corresponding path program 1 times [2023-11-06 22:23:11,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:11,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347138119] [2023-11-06 22:23:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:11,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347138119] [2023-11-06 22:23:11,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347138119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:23:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997785660] [2023-11-06 22:23:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:11,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:11,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2023-11-06 22:23:11,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:11,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:11,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2023-11-06 22:23:11,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:12,650 INFO L124 PetriNetUnfolderBase]: 5315/7723 cut-off events. [2023-11-06 22:23:12,650 INFO L125 PetriNetUnfolderBase]: For 3262/3393 co-relation queries the response was YES. [2023-11-06 22:23:12,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18505 conditions, 7723 events. 5315/7723 cut-off events. For 3262/3393 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 41209 event pairs, 1667 based on Foata normal form. 360/7917 useless extension candidates. Maximal degree in co-relation 18498. Up to 4163 conditions per place. [2023-11-06 22:23:12,724 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 33 selfloop transitions, 3 changer transitions 21/62 dead transitions. [2023-11-06 22:23:12,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 62 transitions, 302 flow [2023-11-06 22:23:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:12,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-11-06 22:23:12,729 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959866220735786 [2023-11-06 22:23:12,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-11-06 22:23:12,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-11-06 22:23:12,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:12,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-11-06 22:23:12,734 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,741 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,741 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 108 flow. Second operand 5 states and 717 transitions. [2023-11-06 22:23:12,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 62 transitions, 302 flow [2023-11-06 22:23:12,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 295 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:12,774 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 116 flow [2023-11-06 22:23:12,775 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2023-11-06 22:23:12,778 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-11-06 22:23:12,779 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 116 flow [2023-11-06 22:23:12,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:12,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:12,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:12,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:23:12,780 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:12,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1965759723, now seen corresponding path program 1 times [2023-11-06 22:23:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929523647] [2023-11-06 22:23:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:13,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929523647] [2023-11-06 22:23:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929523647] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:13,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:13,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:13,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951911592] [2023-11-06 22:23:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:13,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:13,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:13,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-06 22:23:13,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:13,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:13,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-06 22:23:13,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:14,159 INFO L124 PetriNetUnfolderBase]: 3485/5163 cut-off events. [2023-11-06 22:23:14,159 INFO L125 PetriNetUnfolderBase]: For 2305/2439 co-relation queries the response was YES. [2023-11-06 22:23:14,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12531 conditions, 5163 events. 3485/5163 cut-off events. For 2305/2439 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 27707 event pairs, 683 based on Foata normal form. 336/5347 useless extension candidates. Maximal degree in co-relation 12522. Up to 3499 conditions per place. [2023-11-06 22:23:14,222 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 55 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2023-11-06 22:23:14,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 72 transitions, 349 flow [2023-11-06 22:23:14,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:14,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 710 transitions. [2023-11-06 22:23:14,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47491638795986624 [2023-11-06 22:23:14,228 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 710 transitions. [2023-11-06 22:23:14,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 710 transitions. [2023-11-06 22:23:14,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:14,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 710 transitions. [2023-11-06 22:23:14,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:14,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:14,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:14,239 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 116 flow. Second operand 5 states and 710 transitions. [2023-11-06 22:23:14,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 72 transitions, 349 flow [2023-11-06 22:23:14,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 339 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:14,259 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 181 flow [2023-11-06 22:23:14,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=106, 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=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-06 22:23:14,263 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 22:23:14,267 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 181 flow [2023-11-06 22:23:14,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:14,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:14,268 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:14,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:23:14,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:14,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash 857834285, now seen corresponding path program 1 times [2023-11-06 22:23:14,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:14,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197809013] [2023-11-06 22:23:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197809013] [2023-11-06 22:23:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197809013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928516077] [2023-11-06 22:23:14,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:14,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:14,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:14,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:14,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:14,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-06 22:23:14,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 181 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:14,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:14,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-06 22:23:14,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:15,354 INFO L124 PetriNetUnfolderBase]: 2549/3966 cut-off events. [2023-11-06 22:23:15,355 INFO L125 PetriNetUnfolderBase]: For 2755/2843 co-relation queries the response was YES. [2023-11-06 22:23:15,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12007 conditions, 3966 events. 2549/3966 cut-off events. For 2755/2843 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 21886 event pairs, 316 based on Foata normal form. 227/4088 useless extension candidates. Maximal degree in co-relation 11997. Up to 1297 conditions per place. [2023-11-06 22:23:15,396 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 73 selfloop transitions, 19 changer transitions 0/99 dead transitions. [2023-11-06 22:23:15,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 99 transitions, 567 flow [2023-11-06 22:23:15,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:15,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 995 transitions. [2023-11-06 22:23:15,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47539417104634496 [2023-11-06 22:23:15,402 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 995 transitions. [2023-11-06 22:23:15,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 995 transitions. [2023-11-06 22:23:15,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:15,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 995 transitions. [2023-11-06 22:23:15,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.14285714285714) internal successors, (995), 7 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:15,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:15,416 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:15,416 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 181 flow. Second operand 7 states and 995 transitions. [2023-11-06 22:23:15,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 99 transitions, 567 flow [2023-11-06 22:23:15,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 99 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:23:15,431 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 310 flow [2023-11-06 22:23:15,431 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-06 22:23:15,433 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-11-06 22:23:15,433 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 310 flow [2023-11-06 22:23:15,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:15,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:15,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:15,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:23:15,434 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:15,434 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:15,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1646349259, now seen corresponding path program 1 times [2023-11-06 22:23:15,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:15,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12156846] [2023-11-06 22:23:15,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:15,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:15,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:15,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12156846] [2023-11-06 22:23:15,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12156846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:15,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:15,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:15,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590657128] [2023-11-06 22:23:15,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:15,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:15,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:15,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:15,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:15,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-11-06 22:23:15,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:15,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:15,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-11-06 22:23:15,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:16,987 INFO L124 PetriNetUnfolderBase]: 5414/8009 cut-off events. [2023-11-06 22:23:16,987 INFO L125 PetriNetUnfolderBase]: For 18569/18569 co-relation queries the response was YES. [2023-11-06 22:23:17,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30571 conditions, 8009 events. 5414/8009 cut-off events. For 18569/18569 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 42976 event pairs, 752 based on Foata normal form. 46/8055 useless extension candidates. Maximal degree in co-relation 30558. Up to 4388 conditions per place. [2023-11-06 22:23:17,037 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 85 selfloop transitions, 10 changer transitions 58/153 dead transitions. [2023-11-06 22:23:17,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 153 transitions, 1236 flow [2023-11-06 22:23:17,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:17,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 965 transitions. [2023-11-06 22:23:17,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4610606784519828 [2023-11-06 22:23:17,043 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 965 transitions. [2023-11-06 22:23:17,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 965 transitions. [2023-11-06 22:23:17,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:17,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 965 transitions. [2023-11-06 22:23:17,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.85714285714286) internal successors, (965), 7 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:17,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:17,053 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:17,053 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 310 flow. Second operand 7 states and 965 transitions. [2023-11-06 22:23:17,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 153 transitions, 1236 flow [2023-11-06 22:23:17,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 153 transitions, 1097 flow, removed 47 selfloop flow, removed 3 redundant places. [2023-11-06 22:23:17,213 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 241 flow [2023-11-06 22:23:17,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-11-06 22:23:17,216 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-11-06 22:23:17,216 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 241 flow [2023-11-06 22:23:17,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.33333333333333) internal successors, (758), 6 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:17,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:17,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:17,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:23:17,218 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:17,218 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1101184665, now seen corresponding path program 2 times [2023-11-06 22:23:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341444237] [2023-11-06 22:23:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:17,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:17,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 22:23:17,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:17,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341444237] [2023-11-06 22:23:17,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341444237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:17,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:17,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:17,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047027790] [2023-11-06 22:23:17,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:17,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:17,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:17,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-06 22:23:17,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:17,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:17,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-06 22:23:17,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:18,031 INFO L124 PetriNetUnfolderBase]: 1525/2474 cut-off events. [2023-11-06 22:23:18,031 INFO L125 PetriNetUnfolderBase]: For 4044/4201 co-relation queries the response was YES. [2023-11-06 22:23:18,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8243 conditions, 2474 events. 1525/2474 cut-off events. For 4044/4201 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 13156 event pairs, 258 based on Foata normal form. 167/2554 useless extension candidates. Maximal degree in co-relation 8227. Up to 764 conditions per place. [2023-11-06 22:23:18,046 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 66 selfloop transitions, 18 changer transitions 9/103 dead transitions. [2023-11-06 22:23:18,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 103 transitions, 697 flow [2023-11-06 22:23:18,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:18,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 996 transitions. [2023-11-06 22:23:18,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4758719541328237 [2023-11-06 22:23:18,052 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 996 transitions. [2023-11-06 22:23:18,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 996 transitions. [2023-11-06 22:23:18,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:18,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 996 transitions. [2023-11-06 22:23:18,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.28571428571428) internal successors, (996), 7 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:18,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:18,063 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:18,063 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 241 flow. Second operand 7 states and 996 transitions. [2023-11-06 22:23:18,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 103 transitions, 697 flow [2023-11-06 22:23:18,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 650 flow, removed 20 selfloop flow, removed 5 redundant places. [2023-11-06 22:23:18,077 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 356 flow [2023-11-06 22:23:18,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=356, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-06 22:23:18,078 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-11-06 22:23:18,078 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 356 flow [2023-11-06 22:23:18,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:18,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:18,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:18,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:23:18,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:18,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash -148421654, now seen corresponding path program 1 times [2023-11-06 22:23:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:18,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792646123] [2023-11-06 22:23:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:18,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:18,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:18,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:18,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792646123] [2023-11-06 22:23:18,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792646123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:18,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:18,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:18,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052757172] [2023-11-06 22:23:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:18,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:18,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:18,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:18,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2023-11-06 22:23:18,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 356 flow. Second operand has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:18,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:18,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2023-11-06 22:23:18,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:19,143 INFO L124 PetriNetUnfolderBase]: 2264/3743 cut-off events. [2023-11-06 22:23:19,143 INFO L125 PetriNetUnfolderBase]: For 8195/8333 co-relation queries the response was YES. [2023-11-06 22:23:19,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14151 conditions, 3743 events. 2264/3743 cut-off events. For 8195/8333 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21645 event pairs, 401 based on Foata normal form. 18/3635 useless extension candidates. Maximal degree in co-relation 14135. Up to 2054 conditions per place. [2023-11-06 22:23:19,191 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 95 selfloop transitions, 2 changer transitions 17/123 dead transitions. [2023-11-06 22:23:19,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 123 transitions, 1090 flow [2023-11-06 22:23:19,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-11-06 22:23:19,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959866220735786 [2023-11-06 22:23:19,197 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-11-06 22:23:19,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-11-06 22:23:19,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:19,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-11-06 22:23:19,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:19,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:19,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:19,207 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 356 flow. Second operand 5 states and 717 transitions. [2023-11-06 22:23:19,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 123 transitions, 1090 flow [2023-11-06 22:23:19,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 912 flow, removed 72 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:19,292 INFO L231 Difference]: Finished difference. Result has 67 places, 53 transitions, 306 flow [2023-11-06 22:23:19,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2023-11-06 22:23:19,294 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places. [2023-11-06 22:23:19,294 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 306 flow [2023-11-06 22:23:19,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:19,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:19,295 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:19,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:23:19,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:19,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1900039288, now seen corresponding path program 2 times [2023-11-06 22:23:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537007100] [2023-11-06 22:23:19,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:19,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:19,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537007100] [2023-11-06 22:23:19,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537007100] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:19,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:19,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:19,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381673809] [2023-11-06 22:23:19,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:19,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:19,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:19,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:19,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:19,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-06 22:23:19,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 306 flow. Second operand has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:19,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:19,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-06 22:23:19,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:20,574 INFO L124 PetriNetUnfolderBase]: 2019/3277 cut-off events. [2023-11-06 22:23:20,574 INFO L125 PetriNetUnfolderBase]: For 4282/4456 co-relation queries the response was YES. [2023-11-06 22:23:20,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11029 conditions, 3277 events. 2019/3277 cut-off events. For 4282/4456 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 18862 event pairs, 283 based on Foata normal form. 67/3217 useless extension candidates. Maximal degree in co-relation 11009. Up to 1009 conditions per place. [2023-11-06 22:23:20,591 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 43 selfloop transitions, 22 changer transitions 34/105 dead transitions. [2023-11-06 22:23:20,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 105 transitions, 701 flow [2023-11-06 22:23:20,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 22:23:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-06 22:23:20,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1255 transitions. [2023-11-06 22:23:20,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46636937941285767 [2023-11-06 22:23:20,598 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1255 transitions. [2023-11-06 22:23:20,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1255 transitions. [2023-11-06 22:23:20,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:20,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1255 transitions. [2023-11-06 22:23:20,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 139.44444444444446) internal successors, (1255), 9 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:20,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:20,613 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:20,613 INFO L175 Difference]: Start difference. First operand has 67 places, 53 transitions, 306 flow. Second operand 9 states and 1255 transitions. [2023-11-06 22:23:20,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 105 transitions, 701 flow [2023-11-06 22:23:20,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 105 transitions, 667 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-06 22:23:20,670 INFO L231 Difference]: Finished difference. Result has 74 places, 46 transitions, 307 flow [2023-11-06 22:23:20,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=74, PETRI_TRANSITIONS=46} [2023-11-06 22:23:20,671 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 23 predicate places. [2023-11-06 22:23:20,671 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 46 transitions, 307 flow [2023-11-06 22:23:20,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:20,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:20,672 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:20,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:23:20,672 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:20,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:20,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1970603989, now seen corresponding path program 1 times [2023-11-06 22:23:20,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:20,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482068760] [2023-11-06 22:23:20,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:20,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482068760] [2023-11-06 22:23:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482068760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:21,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56160436] [2023-11-06 22:23:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:21,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:21,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:21,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-11-06 22:23:21,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 46 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:21,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:21,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-11-06 22:23:21,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:21,969 INFO L124 PetriNetUnfolderBase]: 1018/1741 cut-off events. [2023-11-06 22:23:21,969 INFO L125 PetriNetUnfolderBase]: For 3251/3284 co-relation queries the response was YES. [2023-11-06 22:23:21,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6596 conditions, 1741 events. 1018/1741 cut-off events. For 3251/3284 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9059 event pairs, 88 based on Foata normal form. 4/1689 useless extension candidates. Maximal degree in co-relation 6575. Up to 990 conditions per place. [2023-11-06 22:23:21,982 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 57 selfloop transitions, 8 changer transitions 48/119 dead transitions. [2023-11-06 22:23:21,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 119 transitions, 1015 flow [2023-11-06 22:23:21,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:23:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1101 transitions. [2023-11-06 22:23:21,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46028428093645485 [2023-11-06 22:23:21,988 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1101 transitions. [2023-11-06 22:23:21,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1101 transitions. [2023-11-06 22:23:21,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:21,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1101 transitions. [2023-11-06 22:23:21,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.625) internal successors, (1101), 8 states have internal predecessors, (1101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:21,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:21,998 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:21,999 INFO L175 Difference]: Start difference. First operand has 74 places, 46 transitions, 307 flow. Second operand 8 states and 1101 transitions. [2023-11-06 22:23:21,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 119 transitions, 1015 flow [2023-11-06 22:23:22,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 802 flow, removed 50 selfloop flow, removed 12 redundant places. [2023-11-06 22:23:22,023 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 274 flow [2023-11-06 22:23:22,023 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2023-11-06 22:23:22,024 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-11-06 22:23:22,024 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 274 flow [2023-11-06 22:23:22,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 132.28571428571428) internal successors, (926), 7 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:22,025 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:22,025 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:22,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 22:23:22,026 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:22,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1355717625, now seen corresponding path program 2 times [2023-11-06 22:23:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:22,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619888450] [2023-11-06 22:23:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619888450] [2023-11-06 22:23:22,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619888450] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136764627] [2023-11-06 22:23:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:22,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:22,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:22,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:22,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 299 [2023-11-06 22:23:22,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 274 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 22:23:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 299 [2023-11-06 22:23:22,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:22,906 INFO L124 PetriNetUnfolderBase]: 1226/2155 cut-off events. [2023-11-06 22:23:22,906 INFO L125 PetriNetUnfolderBase]: For 2879/2879 co-relation queries the response was YES. [2023-11-06 22:23:22,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7592 conditions, 2155 events. 1226/2155 cut-off events. For 2879/2879 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12202 event pairs, 402 based on Foata normal form. 1/2109 useless extension candidates. Maximal degree in co-relation 7574. Up to 934 conditions per place. [2023-11-06 22:23:22,920 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 41 selfloop transitions, 1 changer transitions 61/106 dead transitions. [2023-11-06 22:23:22,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 106 transitions, 779 flow [2023-11-06 22:23:22,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:22,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:22,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2023-11-06 22:23:22,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4662207357859532 [2023-11-06 22:23:22,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2023-11-06 22:23:22,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2023-11-06 22:23:22,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:22,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2023-11-06 22:23:22,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:22,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:22,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:22,936 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 274 flow. Second operand 5 states and 697 transitions. [2023-11-06 22:23:22,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 106 transitions, 779 flow [2023-11-06 22:23:22,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 106 transitions, 773 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:22,962 INFO L231 Difference]: Finished difference. Result has 71 places, 43 transitions, 221 flow [2023-11-06 22:23:22,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=71, PETRI_TRANSITIONS=43} [2023-11-06 22:23:22,964 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 20 predicate places. [2023-11-06 22:23:22,965 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 43 transitions, 221 flow [2023-11-06 22:23:22,965 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 22:23:22,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:22,966 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:22,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 22:23:22,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:22,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2121362285, now seen corresponding path program 3 times [2023-11-06 22:23:22,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:22,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208805291] [2023-11-06 22:23:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:22,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:24,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:23:24,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208805291] [2023-11-06 22:23:24,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208805291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:24,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:24,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758949650] [2023-11-06 22:23:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:24,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:23:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:23:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:23:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:23:24,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 299 [2023-11-06 22:23:24,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 43 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:24,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:24,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 299 [2023-11-06 22:23:24,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:24,526 INFO L124 PetriNetUnfolderBase]: 557/948 cut-off events. [2023-11-06 22:23:24,526 INFO L125 PetriNetUnfolderBase]: For 1368/1380 co-relation queries the response was YES. [2023-11-06 22:23:24,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3399 conditions, 948 events. 557/948 cut-off events. For 1368/1380 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4140 event pairs, 207 based on Foata normal form. 9/928 useless extension candidates. Maximal degree in co-relation 3379. Up to 452 conditions per place. [2023-11-06 22:23:24,532 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 39 selfloop transitions, 4 changer transitions 40/87 dead transitions. [2023-11-06 22:23:24,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 87 transitions, 624 flow [2023-11-06 22:23:24,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:24,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:23:24,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1074 transitions. [2023-11-06 22:23:24,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489966555183946 [2023-11-06 22:23:24,538 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1074 transitions. [2023-11-06 22:23:24,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1074 transitions. [2023-11-06 22:23:24,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:24,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1074 transitions. [2023-11-06 22:23:24,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 134.25) internal successors, (1074), 8 states have internal predecessors, (1074), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:24,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:24,548 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:24,548 INFO L175 Difference]: Start difference. First operand has 71 places, 43 transitions, 221 flow. Second operand 8 states and 1074 transitions. [2023-11-06 22:23:24,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 87 transitions, 624 flow [2023-11-06 22:23:24,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 601 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-11-06 22:23:24,558 INFO L231 Difference]: Finished difference. Result has 69 places, 41 transitions, 216 flow [2023-11-06 22:23:24,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=69, PETRI_TRANSITIONS=41} [2023-11-06 22:23:24,559 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-11-06 22:23:24,559 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 41 transitions, 216 flow [2023-11-06 22:23:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 130.875) internal successors, (1047), 8 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:24,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:24,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 22:23:24,561 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:24,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1069500905, now seen corresponding path program 4 times [2023-11-06 22:23:24,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:23:24,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203698657] [2023-11-06 22:23:24,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:24,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:23:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:24,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:23:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:23:24,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 22:23:24,712 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:23:24,714 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:23:24,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:23:24,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:23:24,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:23:24,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:23:24,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:23:24,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:23:24,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:23:24,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:23:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:23:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:23:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:23:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:23:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:23:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:23:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:23:24,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 22:23:24,725 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:24,734 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:23:24,735 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:23:24,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:23:24 BasicIcfg [2023-11-06 22:23:24,907 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:23:24,907 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:23:24,908 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:23:24,908 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:23:24,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:22:56" (3/4) ... [2023-11-06 22:23:24,911 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:23:24,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:23:24,913 INFO L158 Benchmark]: Toolchain (without parser) took 30753.53ms. Allocated memory was 136.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.4MB in the beginning and 689.2MB in the end (delta: -616.8MB). Peak memory consumption was 455.4MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,913 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 136.3MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:23:24,914 INFO L158 Benchmark]: CACSL2BoogieTranslator took 778.03ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 72.0MB in the beginning and 135.4MB in the end (delta: -63.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,915 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.55ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,915 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 182.5MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,915 INFO L158 Benchmark]: RCFGBuilder took 1081.82ms. Allocated memory is still 182.5MB. Free memory was 131.2MB in the beginning and 92.7MB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,916 INFO L158 Benchmark]: TraceAbstraction took 28766.40ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 92.1MB in the beginning and 690.2MB in the end (delta: -598.2MB). Peak memory consumption was 425.3MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,916 INFO L158 Benchmark]: Witness Printer took 5.14ms. Allocated memory is still 1.2GB. Free memory was 690.2MB in the beginning and 689.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:23:24,920 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.39ms. Allocated memory is still 136.3MB. Free memory is still 107.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 778.03ms. Allocated memory was 136.3MB in the beginning and 182.5MB in the end (delta: 46.1MB). Free memory was 72.0MB in the beginning and 135.4MB in the end (delta: -63.3MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.55ms. Allocated memory is still 182.5MB. Free memory was 135.4MB in the beginning and 133.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.43ms. Allocated memory is still 182.5MB. Free memory was 133.3MB in the beginning and 131.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1081.82ms. Allocated memory is still 182.5MB. Free memory was 131.2MB in the beginning and 92.7MB in the end (delta: 38.5MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 28766.40ms. Allocated memory was 182.5MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 92.1MB in the beginning and 690.2MB in the end (delta: -598.2MB). Peak memory consumption was 425.3MB. Max. memory is 16.1GB. * Witness Printer took 5.14ms. Allocated memory is still 1.2GB. Free memory was 690.2MB in the beginning and 689.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 156 PlacesBefore, 51 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 3676 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 82 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 149 TotalNumberOfCompositions, 9111 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3631, independent: 3422, independent conditional: 0, independent unconditional: 3422, dependent: 209, dependent conditional: 0, dependent unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1881, independent: 1846, independent conditional: 0, independent unconditional: 1846, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3631, independent: 1576, independent conditional: 0, independent unconditional: 1576, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 1881, unknown conditional: 0, unknown unconditional: 1881] , Statistics on independence cache: Total cache size (in pairs): 152, Positive cache size: 133, Positive conditional cache size: 0, Positive unconditional cache size: 133, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-2, t437={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-1, t437={5:0}, t438={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=1, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix017_power.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 184 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 859 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 701 mSDsluCounter, 351 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2430 IncrementalHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 75 mSDtfsCounter, 2430 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=9, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-06 22:23:24,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/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 c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:23:27,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:23:28,054 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:23:28,061 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:23:28,062 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:23:28,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:23:28,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:23:28,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:23:28,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:23:28,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:23:28,114 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:23:28,115 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:23:28,115 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:23:28,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:23:28,122 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:23:28,123 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:23:28,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:23:28,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:23:28,125 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:23:28,126 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:23:28,127 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:23:28,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:23:28,128 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:23:28,129 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:23:28,129 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:23:28,130 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:23:28,131 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:23:28,131 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:23:28,132 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:23:28,133 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:23:28,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:23:28,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:28,136 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:23:28,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:23:28,137 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:23:28,137 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:23:28,138 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:23:28,138 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:23:28,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:23:28,140 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:23:28,140 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:23:28,141 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_0dd5e289-c09e-43bf-a837-59b7942261fa/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_0dd5e289-c09e-43bf-a837-59b7942261fa/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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 [2023-11-06 22:23:28,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:23:28,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:23:28,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:23:28,731 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:23:28,731 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:23:28,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-11-06 22:23:32,036 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:23:32,390 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:23:32,391 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2023-11-06 22:23:32,417 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/600ca35ac/b2e15b6546914750be527340fe1930e0/FLAGf831011a8 [2023-11-06 22:23:32,440 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/data/600ca35ac/b2e15b6546914750be527340fe1930e0 [2023-11-06 22:23:32,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:23:32,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:23:32,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:32,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:23:32,453 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:23:32,454 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:32" (1/1) ... [2023-11-06 22:23:32,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48189798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:32, skipping insertion in model container [2023-11-06 22:23:32,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:23:32" (1/1) ... [2023-11-06 22:23:32,534 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:23:32,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:33,009 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:23:33,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:23:33,198 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:23:33,199 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:23:33,209 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:23:33,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33 WrapperNode [2023-11-06 22:23:33,210 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:23:33,211 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:33,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:23:33,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:23:33,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,330 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-11-06 22:23:33,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:23:33,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:23:33,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:23:33,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:23:33,347 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,373 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,373 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:23:33,405 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:23:33,405 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:23:33,405 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:23:33,406 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (1/1) ... [2023-11-06 22:23:33,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:23:33,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:23:33,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:23:33,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:23:33,541 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:23:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:23:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:23:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:23:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:23:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:23:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 22:23:33,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 22:23:33,544 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 22:23:33,544 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 22:23:33,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 22:23:33,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 22:23:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 22:23:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 22:23:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:23:33,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:23:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:23:33,551 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:23:33,861 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:23:33,865 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:23:34,435 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:23:34,631 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:23:34,632 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 22:23:34,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:34 BoogieIcfgContainer [2023-11-06 22:23:34,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:23:34,640 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:23:34,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:23:34,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:23:34,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:23:32" (1/3) ... [2023-11-06 22:23:34,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f247b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:34, skipping insertion in model container [2023-11-06 22:23:34,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:23:33" (2/3) ... [2023-11-06 22:23:34,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f247b3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:23:34, skipping insertion in model container [2023-11-06 22:23:34,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:34" (3/3) ... [2023-11-06 22:23:34,652 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2023-11-06 22:23:34,675 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:23:34,676 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 22:23:34,676 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:23:34,783 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 22:23:34,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:23:34,962 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:23:34,963 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:34,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:23:34,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 22:23:34,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 157 places, 147 transitions, 306 flow [2023-11-06 22:23:34,992 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:23:35,012 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:23:35,018 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 147 transitions, 306 flow [2023-11-06 22:23:35,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 147 transitions, 306 flow [2023-11-06 22:23:35,100 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 22:23:35,103 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:35,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 111 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 22:23:35,111 INFO L119 LiptonReduction]: Number of co-enabled transitions 3676 [2023-11-06 22:23:47,135 INFO L134 LiptonReduction]: Checked pairs total: 9151 [2023-11-06 22:23:47,135 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-11-06 22:23:47,155 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:23:47,163 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;@5fcb0f36, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:23:47,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 22:23:47,165 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:23:47,166 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 22:23:47,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:47,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:47,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 22:23:47,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:47,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 635, now seen corresponding path program 1 times [2023-11-06 22:23:47,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:47,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531342997] [2023-11-06 22:23:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:47,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:47,200 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:47,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:23:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:47,331 INFO L262 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-06 22:23:47,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:47,342 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:47,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:47,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531342997] [2023-11-06 22:23:47,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531342997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:47,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:47,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 22:23:47,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846493970] [2023-11-06 22:23:47,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:47,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:23:47,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:47,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:23:47,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:23:47,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 292 [2023-11-06 22:23:47,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:47,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:47,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 292 [2023-11-06 22:23:47,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:49,154 INFO L124 PetriNetUnfolderBase]: 5049/7001 cut-off events. [2023-11-06 22:23:49,155 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2023-11-06 22:23:49,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14039 conditions, 7001 events. 5049/7001 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 36060 event pairs, 5049 based on Foata normal form. 0/6028 useless extension candidates. Maximal degree in co-relation 14027. Up to 6881 conditions per place. [2023-11-06 22:23:49,237 INFO L140 encePairwiseOnDemand]: 283/292 looper letters, 26 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2023-11-06 22:23:49,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 124 flow [2023-11-06 22:23:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:23:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 22:23:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-06 22:23:49,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5291095890410958 [2023-11-06 22:23:49,265 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-06 22:23:49,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-06 22:23:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:49,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-06 22:23:49,281 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:49,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:49,292 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 292.0) internal successors, (876), 3 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:49,294 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 2 states and 309 transitions. [2023-11-06 22:23:49,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 124 flow [2023-11-06 22:23:49,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 120 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:49,306 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow [2023-11-06 22:23:49,309 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-11-06 22:23:49,313 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-11-06 22:23:49,314 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow [2023-11-06 22:23:49,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 137.5) internal successors, (275), 2 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:49,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:49,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:49,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:49,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:49,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:49,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:49,530 INFO L85 PathProgramCache]: Analyzing trace with hash 11147753, now seen corresponding path program 1 times [2023-11-06 22:23:49,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:49,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534884398] [2023-11-06 22:23:49,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:49,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:49,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:49,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:49,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:23:49,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:49,679 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:23:49,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:49,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:49,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:49,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534884398] [2023-11-06 22:23:49,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534884398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:49,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:49,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:23:49,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85906755] [2023-11-06 22:23:49,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:49,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:23:49,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:49,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:23:49,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:23:49,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 292 [2023-11-06 22:23:49,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 138.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 22:23:49,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:49,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 292 [2023-11-06 22:23:49,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:50,903 INFO L124 PetriNetUnfolderBase]: 3975/5831 cut-off events. [2023-11-06 22:23:50,904 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:23:50,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11408 conditions, 5831 events. 3975/5831 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 33498 event pairs, 753 based on Foata normal form. 0/5410 useless extension candidates. Maximal degree in co-relation 11405. Up to 4303 conditions per place. [2023-11-06 22:23:50,958 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-11-06 22:23:50,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 182 flow [2023-11-06 22:23:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:23:50,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:23:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-11-06 22:23:50,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5136986301369864 [2023-11-06 22:23:50,963 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-11-06 22:23:50,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-11-06 22:23:50,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:50,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-11-06 22:23:50,966 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 22:23:50,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:50,974 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 292.0) internal successors, (1168), 4 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:50,975 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 450 transitions. [2023-11-06 22:23:50,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 182 flow [2023-11-06 22:23:50,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 45 transitions, 182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:23:50,979 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow [2023-11-06 22:23:50,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2023-11-06 22:23:50,980 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-11-06 22:23:50,981 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow [2023-11-06 22:23:50,982 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 22:23:50,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:50,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:51,006 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:51,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:51,198 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:51,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:51,199 INFO L85 PathProgramCache]: Analyzing trace with hash 241044424, now seen corresponding path program 1 times [2023-11-06 22:23:51,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144918606] [2023-11-06 22:23:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:51,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:51,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:51,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:51,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:23:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:51,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:23:51,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:51,462 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:51,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:51,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144918606] [2023-11-06 22:23:51,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144918606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:51,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:51,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:51,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391218574] [2023-11-06 22:23:51,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:51,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:51,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:51,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:51,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:51,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2023-11-06 22:23:51,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:51,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:51,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2023-11-06 22:23:51,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:52,732 INFO L124 PetriNetUnfolderBase]: 2757/4007 cut-off events. [2023-11-06 22:23:52,732 INFO L125 PetriNetUnfolderBase]: For 264/264 co-relation queries the response was YES. [2023-11-06 22:23:52,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8368 conditions, 4007 events. 2757/4007 cut-off events. For 264/264 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 20696 event pairs, 542 based on Foata normal form. 192/4037 useless extension candidates. Maximal degree in co-relation 8364. Up to 3074 conditions per place. [2023-11-06 22:23:52,770 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 36 selfloop transitions, 5 changer transitions 23/68 dead transitions. [2023-11-06 22:23:52,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 68 transitions, 288 flow [2023-11-06 22:23:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:23:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:23:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2023-11-06 22:23:52,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48013698630136986 [2023-11-06 22:23:52,775 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2023-11-06 22:23:52,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2023-11-06 22:23:52,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:52,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2023-11-06 22:23:52,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,786 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 292.0) internal successors, (1752), 6 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,787 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 5 states and 701 transitions. [2023-11-06 22:23:52,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 68 transitions, 288 flow [2023-11-06 22:23:52,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 68 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:52,792 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 109 flow [2023-11-06 22:23:52,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=109, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2023-11-06 22:23:52,795 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-11-06 22:23:52,795 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 109 flow [2023-11-06 22:23:52,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:52,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:52,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:52,817 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:53,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:53,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:53,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:53,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2007063481, now seen corresponding path program 1 times [2023-11-06 22:23:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:53,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146037999] [2023-11-06 22:23:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:53,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:53,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:53,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:53,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:23:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:53,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:23:53,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:53,247 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:53,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146037999] [2023-11-06 22:23:53,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146037999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:53,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:53,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:23:53,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507971750] [2023-11-06 22:23:53,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:53,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:23:53,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:53,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:23:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:23:53,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2023-11-06 22:23:53,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 109 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:53,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:53,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2023-11-06 22:23:53,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:54,019 INFO L124 PetriNetUnfolderBase]: 1407/2198 cut-off events. [2023-11-06 22:23:54,020 INFO L125 PetriNetUnfolderBase]: For 884/884 co-relation queries the response was YES. [2023-11-06 22:23:54,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2198 events. 1407/2198 cut-off events. For 884/884 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11072 event pairs, 231 based on Foata normal form. 138/2265 useless extension candidates. Maximal degree in co-relation 5960. Up to 1054 conditions per place. [2023-11-06 22:23:54,044 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 47 selfloop transitions, 9 changer transitions 23/83 dead transitions. [2023-11-06 22:23:54,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 83 transitions, 429 flow [2023-11-06 22:23:54,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:23:54,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:23:54,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 843 transitions. [2023-11-06 22:23:54,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811643835616438 [2023-11-06 22:23:54,053 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 843 transitions. [2023-11-06 22:23:54,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 843 transitions. [2023-11-06 22:23:54,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:54,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 843 transitions. [2023-11-06 22:23:54,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:54,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:54,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 292.0) internal successors, (2044), 7 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:54,068 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 109 flow. Second operand 6 states and 843 transitions. [2023-11-06 22:23:54,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 83 transitions, 429 flow [2023-11-06 22:23:54,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:23:54,095 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 174 flow [2023-11-06 22:23:54,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2023-11-06 22:23:54,098 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-11-06 22:23:54,098 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 174 flow [2023-11-06 22:23:54,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:54,100 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:54,100 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:54,121 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:54,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:54,314 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:54,315 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:54,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1793160442, now seen corresponding path program 1 times [2023-11-06 22:23:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455853550] [2023-11-06 22:23:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:54,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:54,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:54,317 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:54,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:23:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:54,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:23:54,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:54,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:54,564 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:54,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:54,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455853550] [2023-11-06 22:23:54,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455853550] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:54,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:54,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:23:54,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859707992] [2023-11-06 22:23:54,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:54,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:23:54,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:54,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:23:54,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:23:54,615 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2023-11-06 22:23:54,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:54,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:54,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2023-11-06 22:23:54,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:55,299 INFO L124 PetriNetUnfolderBase]: 759/1244 cut-off events. [2023-11-06 22:23:55,300 INFO L125 PetriNetUnfolderBase]: For 1297/1297 co-relation queries the response was YES. [2023-11-06 22:23:55,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1244 events. 759/1244 cut-off events. For 1297/1297 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5699 event pairs, 169 based on Foata normal form. 57/1275 useless extension candidates. Maximal degree in co-relation 3893. Up to 419 conditions per place. [2023-11-06 22:23:55,310 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 56 selfloop transitions, 13 changer transitions 23/96 dead transitions. [2023-11-06 22:23:55,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 96 transitions, 590 flow [2023-11-06 22:23:55,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:23:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:23:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 983 transitions. [2023-11-06 22:23:55,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809197651663405 [2023-11-06 22:23:55,316 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 983 transitions. [2023-11-06 22:23:55,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 983 transitions. [2023-11-06 22:23:55,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:55,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 983 transitions. [2023-11-06 22:23:55,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.42857142857142) internal successors, (983), 7 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,336 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,336 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 174 flow. Second operand 7 states and 983 transitions. [2023-11-06 22:23:55,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 96 transitions, 590 flow [2023-11-06 22:23:55,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 96 transitions, 528 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-11-06 22:23:55,364 INFO L231 Difference]: Finished difference. Result has 52 places, 40 transitions, 224 flow [2023-11-06 22:23:55,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2023-11-06 22:23:55,366 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places. [2023-11-06 22:23:55,366 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 224 flow [2023-11-06 22:23:55,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,367 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:55,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:55,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:55,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:55,582 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:55,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1591242255, now seen corresponding path program 1 times [2023-11-06 22:23:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2129118146] [2023-11-06 22:23:55,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:55,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:55,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:55,589 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:55,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:23:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:55,791 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 22:23:55,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:55,916 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:55,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2129118146] [2023-11-06 22:23:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2129118146] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:55,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:23:55,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618698284] [2023-11-06 22:23:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:55,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:23:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:23:55,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:23:55,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 292 [2023-11-06 22:23:55,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:55,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:55,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 292 [2023-11-06 22:23:55,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:56,738 INFO L124 PetriNetUnfolderBase]: 625/1010 cut-off events. [2023-11-06 22:23:56,739 INFO L125 PetriNetUnfolderBase]: For 1004/1004 co-relation queries the response was YES. [2023-11-06 22:23:56,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3042 conditions, 1010 events. 625/1010 cut-off events. For 1004/1004 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4452 event pairs, 164 based on Foata normal form. 12/1007 useless extension candidates. Maximal degree in co-relation 3032. Up to 400 conditions per place. [2023-11-06 22:23:56,747 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 52 selfloop transitions, 17 changer transitions 12/85 dead transitions. [2023-11-06 22:23:56,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 85 transitions, 534 flow [2023-11-06 22:23:56,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:23:56,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:23:56,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1099 transitions. [2023-11-06 22:23:56,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704623287671233 [2023-11-06 22:23:56,754 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1099 transitions. [2023-11-06 22:23:56,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1099 transitions. [2023-11-06 22:23:56,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:56,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1099 transitions. [2023-11-06 22:23:56,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.375) internal successors, (1099), 8 states have internal predecessors, (1099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:56,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 292.0) internal successors, (2628), 9 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:56,767 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 292.0) internal successors, (2628), 9 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:56,767 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 224 flow. Second operand 8 states and 1099 transitions. [2023-11-06 22:23:56,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 85 transitions, 534 flow [2023-11-06 22:23:56,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 472 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-06 22:23:56,792 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 218 flow [2023-11-06 22:23:56,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2023-11-06 22:23:56,796 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-11-06 22:23:56,796 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 218 flow [2023-11-06 22:23:56,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 129.71428571428572) internal successors, (908), 7 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:56,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:56,798 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:56,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:57,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:57,011 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:57,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2057895029, now seen corresponding path program 1 times [2023-11-06 22:23:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:57,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824295785] [2023-11-06 22:23:57,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:23:57,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:57,016 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:57,032 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:23:57,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:23:57,208 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:23:57,210 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:57,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:57,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824295785] [2023-11-06 22:23:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824295785] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:57,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:57,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:57,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983775745] [2023-11-06 22:23:57,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:57,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:57,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:57,285 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 292 [2023-11-06 22:23:57,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:57,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:57,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 292 [2023-11-06 22:23:57,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:57,807 INFO L124 PetriNetUnfolderBase]: 1121/1743 cut-off events. [2023-11-06 22:23:57,807 INFO L125 PetriNetUnfolderBase]: For 1845/1845 co-relation queries the response was YES. [2023-11-06 22:23:57,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5340 conditions, 1743 events. 1121/1743 cut-off events. For 1845/1845 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8288 event pairs, 256 based on Foata normal form. 0/1726 useless extension candidates. Maximal degree in co-relation 5329. Up to 953 conditions per place. [2023-11-06 22:23:57,822 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 83 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-06 22:23:57,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 88 transitions, 669 flow [2023-11-06 22:23:57,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:23:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:23:57,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2023-11-06 22:23:57,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5034246575342466 [2023-11-06 22:23:57,827 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2023-11-06 22:23:57,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2023-11-06 22:23:57,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:57,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2023-11-06 22:23:57,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:57,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:57,836 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:57,836 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 218 flow. Second operand 4 states and 588 transitions. [2023-11-06 22:23:57,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 88 transitions, 669 flow [2023-11-06 22:23:57,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 88 transitions, 528 flow, removed 38 selfloop flow, removed 7 redundant places. [2023-11-06 22:23:57,866 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 167 flow [2023-11-06 22:23:57,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-06 22:23:57,868 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-11-06 22:23:57,868 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 167 flow [2023-11-06 22:23:57,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:57,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:57,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:57,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:58,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:58,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:58,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:58,085 INFO L85 PathProgramCache]: Analyzing trace with hash 928137943, now seen corresponding path program 2 times [2023-11-06 22:23:58,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274700360] [2023-11-06 22:23:58,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:23:58,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:58,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:58,088 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:58,092 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:23:58,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:23:58,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:23:58,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:23:58,295 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:58,370 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:58,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:58,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274700360] [2023-11-06 22:23:58,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274700360] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:58,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:58,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085334826] [2023-11-06 22:23:58,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:58,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:58,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:58,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:58,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:58,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 292 [2023-11-06 22:23:58,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:58,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:58,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 292 [2023-11-06 22:23:58,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:23:59,005 INFO L124 PetriNetUnfolderBase]: 1347/2163 cut-off events. [2023-11-06 22:23:59,005 INFO L125 PetriNetUnfolderBase]: For 2038/2038 co-relation queries the response was YES. [2023-11-06 22:23:59,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6288 conditions, 2163 events. 1347/2163 cut-off events. For 2038/2038 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11089 event pairs, 290 based on Foata normal form. 1/2134 useless extension candidates. Maximal degree in co-relation 6278. Up to 1279 conditions per place. [2023-11-06 22:23:59,025 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 82 selfloop transitions, 2 changer transitions 0/88 dead transitions. [2023-11-06 22:23:59,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 88 transitions, 541 flow [2023-11-06 22:23:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:23:59,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:23:59,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2023-11-06 22:23:59,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.502568493150685 [2023-11-06 22:23:59,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2023-11-06 22:23:59,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2023-11-06 22:23:59,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:23:59,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2023-11-06 22:23:59,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,041 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,042 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,043 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 167 flow. Second operand 4 states and 587 transitions. [2023-11-06 22:23:59,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 88 transitions, 541 flow [2023-11-06 22:23:59,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 88 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:23:59,081 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 179 flow [2023-11-06 22:23:59,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-11-06 22:23:59,082 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-11-06 22:23:59,082 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 179 flow [2023-11-06 22:23:59,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:23:59,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:23:59,094 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:23:59,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:59,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:23:59,286 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:23:59,286 INFO L85 PathProgramCache]: Analyzing trace with hash 105319653, now seen corresponding path program 3 times [2023-11-06 22:23:59,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:23:59,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343011837] [2023-11-06 22:23:59,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:23:59,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:23:59,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:23:59,294 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:23:59,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:23:59,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:23:59,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:23:59,524 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:23:59,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:23:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:23:59,592 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:23:59,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:23:59,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343011837] [2023-11-06 22:23:59,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343011837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:23:59,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:23:59,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:23:59,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901722819] [2023-11-06 22:23:59,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:23:59,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:23:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:23:59,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:23:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:23:59,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 292 [2023-11-06 22:23:59,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:23:59,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:23:59,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 292 [2023-11-06 22:23:59,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:00,483 INFO L124 PetriNetUnfolderBase]: 2030/3346 cut-off events. [2023-11-06 22:24:00,483 INFO L125 PetriNetUnfolderBase]: For 3420/3420 co-relation queries the response was YES. [2023-11-06 22:24:00,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9881 conditions, 3346 events. 2030/3346 cut-off events. For 3420/3420 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19610 event pairs, 622 based on Foata normal form. 1/3276 useless extension candidates. Maximal degree in co-relation 9869. Up to 1380 conditions per place. [2023-11-06 22:24:00,508 INFO L140 encePairwiseOnDemand]: 289/292 looper letters, 75 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2023-11-06 22:24:00,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 523 flow [2023-11-06 22:24:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:24:00,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:24:00,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 580 transitions. [2023-11-06 22:24:00,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4965753424657534 [2023-11-06 22:24:00,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 580 transitions. [2023-11-06 22:24:00,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 580 transitions. [2023-11-06 22:24:00,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:00,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 580 transitions. [2023-11-06 22:24:00,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:00,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:00,522 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 292.0) internal successors, (1460), 5 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:00,522 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 179 flow. Second operand 4 states and 580 transitions. [2023-11-06 22:24:00,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 523 flow [2023-11-06 22:24:00,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 520 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:00,586 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 191 flow [2023-11-06 22:24:00,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=191, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2023-11-06 22:24:00,587 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-11-06 22:24:00,588 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 191 flow [2023-11-06 22:24:00,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:00,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:00,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:00,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:00,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:00,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:24:00,803 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1537615877, now seen corresponding path program 4 times [2023-11-06 22:24:00,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444483997] [2023-11-06 22:24:00,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:24:00,804 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:00,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:00,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:00,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:24:00,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:24:00,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:24:00,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-06 22:24:01,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:01,288 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:01,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:01,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444483997] [2023-11-06 22:24:01,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444483997] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:01,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:01,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:24:01,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930171187] [2023-11-06 22:24:01,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:01,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:24:01,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:24:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:24:01,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:24:01,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 43 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:01,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:01,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:24:01,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:02,266 INFO L124 PetriNetUnfolderBase]: 2464/4248 cut-off events. [2023-11-06 22:24:02,267 INFO L125 PetriNetUnfolderBase]: For 4647/4647 co-relation queries the response was YES. [2023-11-06 22:24:02,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13505 conditions, 4248 events. 2464/4248 cut-off events. For 4647/4647 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 28023 event pairs, 474 based on Foata normal form. 1/4142 useless extension candidates. Maximal degree in co-relation 13491. Up to 1617 conditions per place. [2023-11-06 22:24:02,306 INFO L140 encePairwiseOnDemand]: 285/292 looper letters, 113 selfloop transitions, 9 changer transitions 0/129 dead transitions. [2023-11-06 22:24:02,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 129 transitions, 862 flow [2023-11-06 22:24:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:24:02,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 986 transitions. [2023-11-06 22:24:02,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48238747553816047 [2023-11-06 22:24:02,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 986 transitions. [2023-11-06 22:24:02,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 986 transitions. [2023-11-06 22:24:02,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:02,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 986 transitions. [2023-11-06 22:24:02,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.85714285714286) internal successors, (986), 7 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:02,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:02,326 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:02,326 INFO L175 Difference]: Start difference. First operand has 59 places, 43 transitions, 191 flow. Second operand 7 states and 986 transitions. [2023-11-06 22:24:02,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 129 transitions, 862 flow [2023-11-06 22:24:02,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 129 transitions, 858 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:02,530 INFO L231 Difference]: Finished difference. Result has 68 places, 50 transitions, 246 flow [2023-11-06 22:24:02,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=246, PETRI_PLACES=68, PETRI_TRANSITIONS=50} [2023-11-06 22:24:02,531 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-11-06 22:24:02,531 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 50 transitions, 246 flow [2023-11-06 22:24:02,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:02,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:02,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:02,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:24:02,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:02,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:24:02,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:02,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1609246007, now seen corresponding path program 5 times [2023-11-06 22:24:02,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:02,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281230238] [2023-11-06 22:24:02,734 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:24:02,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:02,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:02,736 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:02,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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 22:24:02,939 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:24:02,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:24:02,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:24:02,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:24:03,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:24:03,375 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:24:03,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:24:03,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281230238] [2023-11-06 22:24:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281230238] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:24:03,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:24:03,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:24:03,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506860027] [2023-11-06 22:24:03,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:24:03,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:24:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:24:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:24:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:24:03,448 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 292 [2023-11-06 22:24:03,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 50 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:03,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:24:03,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 292 [2023-11-06 22:24:03,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:24:04,489 INFO L124 PetriNetUnfolderBase]: 2616/4564 cut-off events. [2023-11-06 22:24:04,489 INFO L125 PetriNetUnfolderBase]: For 6634/6757 co-relation queries the response was YES. [2023-11-06 22:24:04,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16391 conditions, 4564 events. 2616/4564 cut-off events. For 6634/6757 co-relation queries the response was YES. Maximal size of possible extension queue 328. Compared 30793 event pairs, 316 based on Foata normal form. 89/4543 useless extension candidates. Maximal degree in co-relation 16373. Up to 1740 conditions per place. [2023-11-06 22:24:04,599 INFO L140 encePairwiseOnDemand]: 286/292 looper letters, 87 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2023-11-06 22:24:04,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 104 transitions, 714 flow [2023-11-06 22:24:04,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:24:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:24:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 975 transitions. [2023-11-06 22:24:04,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47700587084148727 [2023-11-06 22:24:04,607 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 975 transitions. [2023-11-06 22:24:04,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 975 transitions. [2023-11-06 22:24:04,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:24:04,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 975 transitions. [2023-11-06 22:24:04,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 139.28571428571428) internal successors, (975), 7 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,619 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 292.0) internal successors, (2336), 8 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,620 INFO L175 Difference]: Start difference. First operand has 68 places, 50 transitions, 246 flow. Second operand 7 states and 975 transitions. [2023-11-06 22:24:04,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 104 transitions, 714 flow [2023-11-06 22:24:04,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 104 transitions, 713 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:24:04,798 INFO L231 Difference]: Finished difference. Result has 75 places, 52 transitions, 287 flow [2023-11-06 22:24:04,798 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=292, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=75, PETRI_TRANSITIONS=52} [2023-11-06 22:24:04,799 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places. [2023-11-06 22:24:04,799 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 52 transitions, 287 flow [2023-11-06 22:24:04,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 134.14285714285714) internal successors, (939), 7 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:24:04,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:24:04,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:04,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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 22:24:05,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:05,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 22:24:05,016 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:24:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1730957319, now seen corresponding path program 6 times [2023-11-06 22:24:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:24:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813867318] [2023-11-06 22:24:05,016 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:24:05,017 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:05,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:24:05,018 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:24:05,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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 22:24:05,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-06 22:24:05,278 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-06 22:24:05,279 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 22:24:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 22:24:05,553 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-06 22:24:05,553 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 22:24:05,555 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 22:24:05,557 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 22:24:05,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 22:24:05,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 22:24:05,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 22:24:05,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 22:24:05,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 22:24:05,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 22:24:05,560 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 22:24:05,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 22:24:05,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 22:24:05,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 22:24:05,561 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 22:24:05,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 22:24:05,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 22:24:05,562 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 22:24:05,585 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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 22:24:05,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:24:05,779 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1] [2023-11-06 22:24:05,788 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 22:24:05,789 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:24:05,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:24:05 BasicIcfg [2023-11-06 22:24:05,959 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:24:05,960 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:24:05,960 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:24:05,961 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:24:05,961 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:23:34" (3/4) ... [2023-11-06 22:24:05,963 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 22:24:05,965 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:24:05,966 INFO L158 Benchmark]: Toolchain (without parser) took 33521.28ms. Allocated memory was 71.3MB in the beginning and 700.4MB in the end (delta: 629.1MB). Free memory was 37.7MB in the beginning and 544.4MB in the end (delta: -506.7MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,966 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:05,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.04ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 37.5MB in the beginning and 72.6MB in the end (delta: -35.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 121.05ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 70.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,967 INFO L158 Benchmark]: Boogie Preprocessor took 69.96ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,968 INFO L158 Benchmark]: RCFGBuilder took 1231.94ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 53.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,969 INFO L158 Benchmark]: TraceAbstraction took 31319.52ms. Allocated memory was 113.2MB in the beginning and 700.4MB in the end (delta: 587.2MB). Free memory was 53.3MB in the beginning and 544.4MB in the end (delta: -491.1MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. [2023-11-06 22:24:05,969 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 700.4MB. Free memory is still 544.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:24:05,976 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.31ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 764.04ms. Allocated memory was 71.3MB in the beginning and 113.2MB in the end (delta: 41.9MB). Free memory was 37.5MB in the beginning and 72.6MB in the end (delta: -35.1MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 121.05ms. Allocated memory is still 113.2MB. Free memory was 72.6MB in the beginning and 70.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.96ms. Allocated memory is still 113.2MB. Free memory was 70.1MB in the beginning and 67.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1231.94ms. Allocated memory is still 113.2MB. Free memory was 67.5MB in the beginning and 53.8MB in the end (delta: 13.7MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 31319.52ms. Allocated memory was 113.2MB in the beginning and 700.4MB in the end (delta: 587.2MB). Free memory was 53.3MB in the beginning and 544.4MB in the end (delta: -491.1MB). Peak memory consumption was 95.8MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 700.4MB. Free memory is still 544.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.1s, 157 PlacesBefore, 51 PlacesAfterwards, 147 TransitionsBefore, 39 TransitionsAfterwards, 3676 CoEnabledTransitionPairs, 7 FixpointIterations, 53 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 141 TotalNumberOfCompositions, 9151 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4109, independent: 3891, independent conditional: 0, independent unconditional: 3891, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1969, independent: 1921, independent conditional: 0, independent unconditional: 1921, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4109, independent: 1970, independent conditional: 0, independent unconditional: 1970, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1969, unknown conditional: 0, unknown unconditional: 1969] , Statistics on independence cache: Total cache size (in pairs): 167, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L729] 0 _Bool y$flush_delayed; [L730] 0 int y$mem_tmp; [L731] 0 _Bool y$r_buff0_thd0; [L732] 0 _Bool y$r_buff0_thd1; [L733] 0 _Bool y$r_buff0_thd2; [L734] 0 _Bool y$r_buff0_thd3; [L735] 0 _Bool y$r_buff0_thd4; [L736] 0 _Bool y$r_buff1_thd0; [L737] 0 _Bool y$r_buff1_thd1; [L738] 0 _Bool y$r_buff1_thd2; [L739] 0 _Bool y$r_buff1_thd3; [L740] 0 _Bool y$r_buff1_thd4; [L741] 0 _Bool y$read_delayed; [L742] 0 int *y$read_delayed_var; [L743] 0 int y$w_buff0; [L744] 0 _Bool y$w_buff0_used; [L745] 0 int y$w_buff1; [L746] 0 _Bool y$w_buff1_used; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t437; [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=0, t437={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t438; [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=1, t437={11:0}, t438={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L862] 0 pthread_t t439; [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=2, t437={11:0}, t438={15:0}, t439={9:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L864] 0 pthread_t t440; [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=3, t437={11:0}, t438={15:0}, t439={9:0}, t440={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 2 return 0; [L813] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L822] 3 return 0; [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L845] 4 return 0; [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t437={11:0}, t438={15:0}, t439={9:0}, t440={-2147483637:0}, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix017_power.opt_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={7:6}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 865]: 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: 863]: 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: 861]: 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: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 31.0s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 474 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 412 mSDsluCounter, 122 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 112 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1918 IncrementalHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 10 mSDtfsCounter, 1918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=11, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 190 ConstructedInterpolants, 0 QuantifiedInterpolants, 836 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1666 ConjunctsInSsa, 75 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 22:24:06,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0dd5e289-c09e-43bf-a837-59b7942261fa/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